./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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 a76e61da8563dd867a04fa03c43a1d8e84863fd7 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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 a76e61da8563dd867a04fa03c43a1d8e84863fd7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: incompatible size --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:41:31,779 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:41:31,781 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:41:31,794 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:41:31,795 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:41:31,796 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:41:31,798 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:41:31,806 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:41:31,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:41:31,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:41:31,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:41:31,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:41:31,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:41:31,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:41:31,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:41:31,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:41:31,821 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:41:31,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:41:31,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:41:31,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:41:31,827 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:41:31,828 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:41:31,829 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:41:31,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:41:31,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:41:31,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:41:31,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:41:31,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:41:31,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:41:31,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:41:31,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:41:31,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:41:31,836 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:41:31,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:41:31,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:41:31,837 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:41:31,838 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:41:31,838 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:41:31,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:41:31,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:41:31,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:41:31,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:41:31,852 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:41:31,852 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:41:31,853 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:41:31,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:41:31,854 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:41:31,854 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:41:31,854 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:41:31,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:41:31,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:41:31,855 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:41:31,855 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:41:31,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:41:31,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:41:31,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:41:31,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:41:31,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:41:31,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:41:31,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:41:31,857 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:41:31,857 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:41:31,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:41:31,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:41:31,858 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:41:31,858 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:41:31,858 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:41:31,858 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:41:31,858 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:41:31,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:41:31,859 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_3990336c-5583-4683-8c6a-3119c239ac9a/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 -> a76e61da8563dd867a04fa03c43a1d8e84863fd7 [2019-11-19 23:41:32,022 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:41:32,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:41:32,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:41:32,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:41:32,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:41:32,041 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-19 23:41:32,102 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/407832dae/04d875bc23d64bdbb4751be4c0da1b2c/FLAGa0d0f46e4 [2019-11-19 23:41:32,576 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:41:32,577 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-19 23:41:32,596 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/407832dae/04d875bc23d64bdbb4751be4c0da1b2c/FLAGa0d0f46e4 [2019-11-19 23:41:32,835 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/407832dae/04d875bc23d64bdbb4751be4c0da1b2c [2019-11-19 23:41:32,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:41:32,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:41:32,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:41:32,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:41:32,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:41:32,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:41:32" (1/1) ... [2019-11-19 23:41:32,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d16bf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:32, skipping insertion in model container [2019-11-19 23:41:32,846 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:41:32" (1/1) ... [2019-11-19 23:41:32,853 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:41:32,930 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:41:33,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:41:33,431 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:41:33,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:41:33,551 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:41:33,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33 WrapperNode [2019-11-19 23:41:33,552 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:41:33,553 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:41:33,553 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:41:33,553 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:41:33,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,583 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:41:33,648 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:41:33,648 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:41:33,649 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:41:33,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,684 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,765 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... [2019-11-19 23:41:33,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:41:33,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:41:33,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:41:33,783 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:41:33,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:41:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:41:33,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:41:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 23:41:33,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 23:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:41:33,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:41:33,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:41:34,155 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:41:35,132 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 23:41:35,132 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 23:41:35,133 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:41:35,135 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:41:35,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:41:35 BoogieIcfgContainer [2019-11-19 23:41:35,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:41:35,140 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:41:35,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:41:35,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:41:35,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:41:32" (1/3) ... [2019-11-19 23:41:35,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd8039b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:41:35, skipping insertion in model container [2019-11-19 23:41:35,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:41:33" (2/3) ... [2019-11-19 23:41:35,148 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dd8039b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:41:35, skipping insertion in model container [2019-11-19 23:41:35,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:41:35" (3/3) ... [2019-11-19 23:41:35,152 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2019-11-19 23:41:35,161 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:41:35,170 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:41:35,180 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:41:35,205 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:41:35,205 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:41:35,205 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:41:35,206 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:41:35,206 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:41:35,206 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:41:35,206 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:41:35,206 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:41:35,229 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-19 23:41:35,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 23:41:35,244 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:35,245 INFO L410 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] [2019-11-19 23:41:35,245 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:35,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:35,252 INFO L82 PathProgramCache]: Analyzing trace with hash 556191018, now seen corresponding path program 1 times [2019-11-19 23:41:35,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:35,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678171953] [2019-11-19 23:41:35,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:35,613 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-19 23:41:35,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678171953] [2019-11-19 23:41:35,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:35,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:35,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692162472] [2019-11-19 23:41:35,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:35,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:35,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:35,638 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-11-19 23:41:36,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:36,255 INFO L93 Difference]: Finished difference Result 319 states and 539 transitions. [2019-11-19 23:41:36,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:36,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-19 23:41:36,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:36,270 INFO L225 Difference]: With dead ends: 319 [2019-11-19 23:41:36,270 INFO L226 Difference]: Without dead ends: 161 [2019-11-19 23:41:36,277 INFO L630 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-19 23:41:36,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-19 23:41:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2019-11-19 23:41:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 222 transitions. [2019-11-19 23:41:36,339 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 222 transitions. Word has length 42 [2019-11-19 23:41:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:36,340 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 222 transitions. [2019-11-19 23:41:36,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 222 transitions. [2019-11-19 23:41:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-19 23:41:36,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:36,343 INFO L410 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] [2019-11-19 23:41:36,343 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:36,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:36,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1301055948, now seen corresponding path program 1 times [2019-11-19 23:41:36,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:36,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276790997] [2019-11-19 23:41:36,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:36,494 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-19 23:41:36,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276790997] [2019-11-19 23:41:36,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:36,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:36,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806767991] [2019-11-19 23:41:36,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:36,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:36,498 INFO L87 Difference]: Start difference. First operand 144 states and 222 transitions. Second operand 4 states. [2019-11-19 23:41:36,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:36,871 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-19 23:41:36,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:36,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-11-19 23:41:36,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:36,873 INFO L225 Difference]: With dead ends: 286 [2019-11-19 23:41:36,873 INFO L226 Difference]: Without dead ends: 161 [2019-11-19 23:41:36,875 INFO L630 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-19 23:41:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-19 23:41:36,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 144. [2019-11-19 23:41:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 221 transitions. [2019-11-19 23:41:36,890 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 221 transitions. Word has length 55 [2019-11-19 23:41:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:36,891 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 221 transitions. [2019-11-19 23:41:36,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 221 transitions. [2019-11-19 23:41:36,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:41:36,897 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:36,899 INFO L410 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] [2019-11-19 23:41:36,899 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:36,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1060532474, now seen corresponding path program 1 times [2019-11-19 23:41:36,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:36,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758241854] [2019-11-19 23:41:36,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:36,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:37,007 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-19 23:41:37,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758241854] [2019-11-19 23:41:37,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:37,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:37,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583242801] [2019-11-19 23:41:37,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:37,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:37,009 INFO L87 Difference]: Start difference. First operand 144 states and 221 transitions. Second operand 4 states. [2019-11-19 23:41:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:37,384 INFO L93 Difference]: Finished difference Result 285 states and 433 transitions. [2019-11-19 23:41:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:37,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-19 23:41:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:37,387 INFO L225 Difference]: With dead ends: 285 [2019-11-19 23:41:37,387 INFO L226 Difference]: Without dead ends: 160 [2019-11-19 23:41:37,389 INFO L630 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-19 23:41:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-19 23:41:37,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 144. [2019-11-19 23:41:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:37,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 220 transitions. [2019-11-19 23:41:37,408 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 220 transitions. Word has length 56 [2019-11-19 23:41:37,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:37,409 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 220 transitions. [2019-11-19 23:41:37,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:37,409 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 220 transitions. [2019-11-19 23:41:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:41:37,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:37,415 INFO L410 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] [2019-11-19 23:41:37,415 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:37,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:37,416 INFO L82 PathProgramCache]: Analyzing trace with hash 198008687, now seen corresponding path program 1 times [2019-11-19 23:41:37,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:37,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357837811] [2019-11-19 23:41:37,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:37,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:37,547 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-19 23:41:37,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357837811] [2019-11-19 23:41:37,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:37,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:37,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943469880] [2019-11-19 23:41:37,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:37,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:37,552 INFO L87 Difference]: Start difference. First operand 144 states and 220 transitions. Second operand 4 states. [2019-11-19 23:41:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:37,955 INFO L93 Difference]: Finished difference Result 283 states and 430 transitions. [2019-11-19 23:41:37,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:37,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-19 23:41:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:37,957 INFO L225 Difference]: With dead ends: 283 [2019-11-19 23:41:37,957 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 23:41:37,958 INFO L630 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-19 23:41:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 23:41:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2019-11-19 23:41:37,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 219 transitions. [2019-11-19 23:41:37,967 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 219 transitions. Word has length 56 [2019-11-19 23:41:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:37,967 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 219 transitions. [2019-11-19 23:41:37,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:37,968 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 219 transitions. [2019-11-19 23:41:37,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:41:37,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:37,969 INFO L410 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] [2019-11-19 23:41:37,969 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:37,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:37,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1122844625, now seen corresponding path program 1 times [2019-11-19 23:41:37,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:37,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718234989] [2019-11-19 23:41:37,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:38,056 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-19 23:41:38,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718234989] [2019-11-19 23:41:38,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:38,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:38,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648411373] [2019-11-19 23:41:38,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:38,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:38,059 INFO L87 Difference]: Start difference. First operand 144 states and 219 transitions. Second operand 4 states. [2019-11-19 23:41:38,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:38,387 INFO L93 Difference]: Finished difference Result 282 states and 428 transitions. [2019-11-19 23:41:38,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:38,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-19 23:41:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:38,389 INFO L225 Difference]: With dead ends: 282 [2019-11-19 23:41:38,389 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 23:41:38,390 INFO L630 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-19 23:41:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 23:41:38,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-19 23:41:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:38,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 218 transitions. [2019-11-19 23:41:38,397 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 218 transitions. Word has length 56 [2019-11-19 23:41:38,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:38,398 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 218 transitions. [2019-11-19 23:41:38,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:38,398 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 218 transitions. [2019-11-19 23:41:38,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 23:41:38,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:38,399 INFO L410 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] [2019-11-19 23:41:38,400 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:38,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:38,400 INFO L82 PathProgramCache]: Analyzing trace with hash 13021670, now seen corresponding path program 1 times [2019-11-19 23:41:38,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:38,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151608453] [2019-11-19 23:41:38,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:38,462 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-19 23:41:38,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151608453] [2019-11-19 23:41:38,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:38,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:38,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098433410] [2019-11-19 23:41:38,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:38,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:38,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:38,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:38,464 INFO L87 Difference]: Start difference. First operand 144 states and 218 transitions. Second operand 4 states. [2019-11-19 23:41:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:38,773 INFO L93 Difference]: Finished difference Result 282 states and 427 transitions. [2019-11-19 23:41:38,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:38,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-11-19 23:41:38,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:38,775 INFO L225 Difference]: With dead ends: 282 [2019-11-19 23:41:38,776 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 23:41:38,776 INFO L630 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-19 23:41:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 23:41:38,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-19 23:41:38,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 217 transitions. [2019-11-19 23:41:38,782 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 217 transitions. Word has length 56 [2019-11-19 23:41:38,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:38,782 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 217 transitions. [2019-11-19 23:41:38,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:38,783 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 217 transitions. [2019-11-19 23:41:38,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 23:41:38,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:38,783 INFO L410 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] [2019-11-19 23:41:38,786 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:38,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1751285277, now seen corresponding path program 1 times [2019-11-19 23:41:38,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:38,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280433303] [2019-11-19 23:41:38,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:38,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:38,866 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-19 23:41:38,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280433303] [2019-11-19 23:41:38,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:38,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:38,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115374376] [2019-11-19 23:41:38,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:38,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:38,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:38,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:38,868 INFO L87 Difference]: Start difference. First operand 144 states and 217 transitions. Second operand 4 states. [2019-11-19 23:41:39,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:39,178 INFO L93 Difference]: Finished difference Result 282 states and 426 transitions. [2019-11-19 23:41:39,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:39,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-19 23:41:39,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:39,179 INFO L225 Difference]: With dead ends: 282 [2019-11-19 23:41:39,179 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 23:41:39,180 INFO L630 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-19 23:41:39,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 23:41:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-19 23:41:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-11-19 23:41:39,185 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 57 [2019-11-19 23:41:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:39,185 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-11-19 23:41:39,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-11-19 23:41:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 23:41:39,186 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:39,187 INFO L410 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] [2019-11-19 23:41:39,187 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 2062972321, now seen corresponding path program 1 times [2019-11-19 23:41:39,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:39,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543818001] [2019-11-19 23:41:39,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:39,243 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-19 23:41:39,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543818001] [2019-11-19 23:41:39,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:39,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:39,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227899355] [2019-11-19 23:41:39,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:39,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:39,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:39,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:39,245 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 4 states. [2019-11-19 23:41:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:39,562 INFO L93 Difference]: Finished difference Result 282 states and 425 transitions. [2019-11-19 23:41:39,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:39,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 23:41:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:39,564 INFO L225 Difference]: With dead ends: 282 [2019-11-19 23:41:39,565 INFO L226 Difference]: Without dead ends: 157 [2019-11-19 23:41:39,565 INFO L630 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-19 23:41:39,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-19 23:41:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 144. [2019-11-19 23:41:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:39,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2019-11-19 23:41:39,570 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 58 [2019-11-19 23:41:39,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:39,570 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2019-11-19 23:41:39,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2019-11-19 23:41:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 23:41:39,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:39,571 INFO L410 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] [2019-11-19 23:41:39,571 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:39,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:39,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1575895618, now seen corresponding path program 1 times [2019-11-19 23:41:39,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:39,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365990197] [2019-11-19 23:41:39,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:39,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:39,627 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-19 23:41:39,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365990197] [2019-11-19 23:41:39,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:39,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:39,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615205947] [2019-11-19 23:41:39,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:39,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:39,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:39,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:39,629 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand 4 states. [2019-11-19 23:41:39,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:39,912 INFO L93 Difference]: Finished difference Result 272 states and 411 transitions. [2019-11-19 23:41:39,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:39,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 23:41:39,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:39,914 INFO L225 Difference]: With dead ends: 272 [2019-11-19 23:41:39,914 INFO L226 Difference]: Without dead ends: 147 [2019-11-19 23:41:39,915 INFO L630 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-19 23:41:39,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-19 23:41:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2019-11-19 23:41:39,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-19 23:41:39,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2019-11-19 23:41:39,919 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 59 [2019-11-19 23:41:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:39,919 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 214 transitions. [2019-11-19 23:41:39,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:39,920 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 214 transitions. [2019-11-19 23:41:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-19 23:41:39,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:39,920 INFO L410 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] [2019-11-19 23:41:39,921 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash -902896810, now seen corresponding path program 1 times [2019-11-19 23:41:39,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:39,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521393966] [2019-11-19 23:41:39,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:39,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:39,975 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-19 23:41:39,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521393966] [2019-11-19 23:41:39,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:39,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:39,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460376856] [2019-11-19 23:41:39,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:39,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:39,978 INFO L87 Difference]: Start difference. First operand 144 states and 214 transitions. Second operand 4 states. [2019-11-19 23:41:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:40,384 INFO L93 Difference]: Finished difference Result 312 states and 472 transitions. [2019-11-19 23:41:40,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:40,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-11-19 23:41:40,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:40,386 INFO L225 Difference]: With dead ends: 312 [2019-11-19 23:41:40,386 INFO L226 Difference]: Without dead ends: 187 [2019-11-19 23:41:40,387 INFO L630 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-19 23:41:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-19 23:41:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2019-11-19 23:41:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2019-11-19 23:41:40,393 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 59 [2019-11-19 23:41:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:40,393 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2019-11-19 23:41:40,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2019-11-19 23:41:40,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 23:41:40,395 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:40,395 INFO L410 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] [2019-11-19 23:41:40,395 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:40,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:40,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1928780576, now seen corresponding path program 1 times [2019-11-19 23:41:40,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:40,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049111457] [2019-11-19 23:41:40,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:40,447 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-19 23:41:40,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049111457] [2019-11-19 23:41:40,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:40,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:40,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219960303] [2019-11-19 23:41:40,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:40,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:40,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:40,449 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand 4 states. [2019-11-19 23:41:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:40,855 INFO L93 Difference]: Finished difference Result 334 states and 509 transitions. [2019-11-19 23:41:40,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:40,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-11-19 23:41:40,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:40,857 INFO L225 Difference]: With dead ends: 334 [2019-11-19 23:41:40,857 INFO L226 Difference]: Without dead ends: 187 [2019-11-19 23:41:40,858 INFO L630 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-19 23:41:40,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-19 23:41:40,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 166. [2019-11-19 23:41:40,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 251 transitions. [2019-11-19 23:41:40,865 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 251 transitions. Word has length 72 [2019-11-19 23:41:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:40,865 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 251 transitions. [2019-11-19 23:41:40,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 251 transitions. [2019-11-19 23:41:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 23:41:40,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:40,867 INFO L410 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] [2019-11-19 23:41:40,867 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:40,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash -954840538, now seen corresponding path program 1 times [2019-11-19 23:41:40,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:40,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449864793] [2019-11-19 23:41:40,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:40,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:40,922 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-19 23:41:40,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449864793] [2019-11-19 23:41:40,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:40,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:40,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127290231] [2019-11-19 23:41:40,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:40,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:40,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:40,925 INFO L87 Difference]: Start difference. First operand 166 states and 251 transitions. Second operand 4 states. [2019-11-19 23:41:41,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:41,317 INFO L93 Difference]: Finished difference Result 333 states and 506 transitions. [2019-11-19 23:41:41,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:41,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-19 23:41:41,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:41,319 INFO L225 Difference]: With dead ends: 333 [2019-11-19 23:41:41,320 INFO L226 Difference]: Without dead ends: 186 [2019-11-19 23:41:41,320 INFO L630 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-19 23:41:41,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-19 23:41:41,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 166. [2019-11-19 23:41:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 250 transitions. [2019-11-19 23:41:41,354 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 250 transitions. Word has length 73 [2019-11-19 23:41:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:41,355 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 250 transitions. [2019-11-19 23:41:41,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 250 transitions. [2019-11-19 23:41:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 23:41:41,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:41,356 INFO L410 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] [2019-11-19 23:41:41,356 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1817364325, now seen corresponding path program 1 times [2019-11-19 23:41:41,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:41,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216890498] [2019-11-19 23:41:41,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:41,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:41,416 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-19 23:41:41,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216890498] [2019-11-19 23:41:41,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:41,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:41,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827103627] [2019-11-19 23:41:41,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:41,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:41,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:41,418 INFO L87 Difference]: Start difference. First operand 166 states and 250 transitions. Second operand 4 states. [2019-11-19 23:41:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:41,800 INFO L93 Difference]: Finished difference Result 331 states and 502 transitions. [2019-11-19 23:41:41,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:41,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-19 23:41:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:41,802 INFO L225 Difference]: With dead ends: 331 [2019-11-19 23:41:41,802 INFO L226 Difference]: Without dead ends: 184 [2019-11-19 23:41:41,803 INFO L630 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-19 23:41:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-19 23:41:41,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2019-11-19 23:41:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 249 transitions. [2019-11-19 23:41:41,808 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 249 transitions. Word has length 73 [2019-11-19 23:41:41,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:41,808 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 249 transitions. [2019-11-19 23:41:41,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 249 transitions. [2019-11-19 23:41:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 23:41:41,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:41,809 INFO L410 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] [2019-11-19 23:41:41,810 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:41,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:41,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1156749659, now seen corresponding path program 1 times [2019-11-19 23:41:41,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:41,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149292231] [2019-11-19 23:41:41,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:41,857 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-19 23:41:41,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149292231] [2019-11-19 23:41:41,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:41,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:41,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031555671] [2019-11-19 23:41:41,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:41,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:41,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:41,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:41,859 INFO L87 Difference]: Start difference. First operand 166 states and 249 transitions. Second operand 4 states. [2019-11-19 23:41:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:42,214 INFO L93 Difference]: Finished difference Result 330 states and 499 transitions. [2019-11-19 23:41:42,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:42,214 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-19 23:41:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:42,216 INFO L225 Difference]: With dead ends: 330 [2019-11-19 23:41:42,216 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 23:41:42,217 INFO L630 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-19 23:41:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 23:41:42,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-19 23:41:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 248 transitions. [2019-11-19 23:41:42,222 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 248 transitions. Word has length 73 [2019-11-19 23:41:42,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:42,222 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 248 transitions. [2019-11-19 23:41:42,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:42,222 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 248 transitions. [2019-11-19 23:41:42,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 23:41:42,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:42,223 INFO L410 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] [2019-11-19 23:41:42,223 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:42,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2002351342, now seen corresponding path program 1 times [2019-11-19 23:41:42,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:42,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573264035] [2019-11-19 23:41:42,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:42,270 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-19 23:41:42,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573264035] [2019-11-19 23:41:42,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:42,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:42,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389802574] [2019-11-19 23:41:42,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:42,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:42,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:42,272 INFO L87 Difference]: Start difference. First operand 166 states and 248 transitions. Second operand 4 states. [2019-11-19 23:41:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:42,656 INFO L93 Difference]: Finished difference Result 330 states and 497 transitions. [2019-11-19 23:41:42,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:42,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-11-19 23:41:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:42,658 INFO L225 Difference]: With dead ends: 330 [2019-11-19 23:41:42,658 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 23:41:42,659 INFO L630 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-19 23:41:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 23:41:42,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-19 23:41:42,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 247 transitions. [2019-11-19 23:41:42,664 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 247 transitions. Word has length 73 [2019-11-19 23:41:42,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:42,664 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 247 transitions. [2019-11-19 23:41:42,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:42,664 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 247 transitions. [2019-11-19 23:41:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-19 23:41:42,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:42,665 INFO L410 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] [2019-11-19 23:41:42,665 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:42,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:42,666 INFO L82 PathProgramCache]: Analyzing trace with hash 196660791, now seen corresponding path program 1 times [2019-11-19 23:41:42,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:42,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702665723] [2019-11-19 23:41:42,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:42,704 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-19 23:41:42,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702665723] [2019-11-19 23:41:42,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:42,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:42,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17552929] [2019-11-19 23:41:42,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:42,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:42,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:42,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:42,706 INFO L87 Difference]: Start difference. First operand 166 states and 247 transitions. Second operand 4 states. [2019-11-19 23:41:43,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:43,070 INFO L93 Difference]: Finished difference Result 330 states and 495 transitions. [2019-11-19 23:41:43,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:43,071 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-19 23:41:43,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:43,072 INFO L225 Difference]: With dead ends: 330 [2019-11-19 23:41:43,072 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 23:41:43,073 INFO L630 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-19 23:41:43,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 23:41:43,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-19 23:41:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 246 transitions. [2019-11-19 23:41:43,078 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 246 transitions. Word has length 74 [2019-11-19 23:41:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:43,079 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 246 transitions. [2019-11-19 23:41:43,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 246 transitions. [2019-11-19 23:41:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-19 23:41:43,079 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:43,080 INFO L410 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] [2019-11-19 23:41:43,080 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:43,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1975209011, now seen corresponding path program 1 times [2019-11-19 23:41:43,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:43,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959938122] [2019-11-19 23:41:43,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:43,121 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-19 23:41:43,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959938122] [2019-11-19 23:41:43,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:43,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:43,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905618647] [2019-11-19 23:41:43,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:43,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:43,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:43,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:43,123 INFO L87 Difference]: Start difference. First operand 166 states and 246 transitions. Second operand 4 states. [2019-11-19 23:41:43,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:43,500 INFO L93 Difference]: Finished difference Result 330 states and 493 transitions. [2019-11-19 23:41:43,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:43,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-19 23:41:43,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:43,502 INFO L225 Difference]: With dead ends: 330 [2019-11-19 23:41:43,502 INFO L226 Difference]: Without dead ends: 183 [2019-11-19 23:41:43,503 INFO L630 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-19 23:41:43,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-11-19 23:41:43,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2019-11-19 23:41:43,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:43,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 245 transitions. [2019-11-19 23:41:43,507 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 245 transitions. Word has length 75 [2019-11-19 23:41:43,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:43,508 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 245 transitions. [2019-11-19 23:41:43,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:43,508 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 245 transitions. [2019-11-19 23:41:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-19 23:41:43,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:43,509 INFO L410 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] [2019-11-19 23:41:43,509 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:43,509 INFO L82 PathProgramCache]: Analyzing trace with hash 2089501970, now seen corresponding path program 1 times [2019-11-19 23:41:43,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:43,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885918187] [2019-11-19 23:41:43,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:43,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:43,569 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-19 23:41:43,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885918187] [2019-11-19 23:41:43,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:43,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:43,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429072324] [2019-11-19 23:41:43,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:43,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:43,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:43,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:43,571 INFO L87 Difference]: Start difference. First operand 166 states and 245 transitions. Second operand 4 states. [2019-11-19 23:41:43,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:43,918 INFO L93 Difference]: Finished difference Result 320 states and 478 transitions. [2019-11-19 23:41:43,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:43,919 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-19 23:41:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:43,920 INFO L225 Difference]: With dead ends: 320 [2019-11-19 23:41:43,920 INFO L226 Difference]: Without dead ends: 173 [2019-11-19 23:41:43,921 INFO L630 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-19 23:41:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-19 23:41:43,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 166. [2019-11-19 23:41:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-19 23:41:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 244 transitions. [2019-11-19 23:41:43,925 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 244 transitions. Word has length 76 [2019-11-19 23:41:43,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:43,926 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 244 transitions. [2019-11-19 23:41:43,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:43,926 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 244 transitions. [2019-11-19 23:41:43,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 23:41:43,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:43,927 INFO L410 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] [2019-11-19 23:41:43,927 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:43,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:43,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2003727820, now seen corresponding path program 1 times [2019-11-19 23:41:43,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:43,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599660808] [2019-11-19 23:41:43,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:44,019 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-19 23:41:44,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599660808] [2019-11-19 23:41:44,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:44,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:44,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717177312] [2019-11-19 23:41:44,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:44,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:44,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:44,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:44,022 INFO L87 Difference]: Start difference. First operand 166 states and 244 transitions. Second operand 4 states. [2019-11-19 23:41:44,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:44,533 INFO L93 Difference]: Finished difference Result 419 states and 629 transitions. [2019-11-19 23:41:44,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:44,534 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-19 23:41:44,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:44,535 INFO L225 Difference]: With dead ends: 419 [2019-11-19 23:41:44,536 INFO L226 Difference]: Without dead ends: 272 [2019-11-19 23:41:44,536 INFO L630 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-19 23:41:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-11-19 23:41:44,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 207. [2019-11-19 23:41:44,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-19 23:41:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 318 transitions. [2019-11-19 23:41:44,543 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 318 transitions. Word has length 81 [2019-11-19 23:41:44,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:44,543 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 318 transitions. [2019-11-19 23:41:44,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:44,543 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 318 transitions. [2019-11-19 23:41:44,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 23:41:44,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:44,545 INFO L410 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] [2019-11-19 23:41:44,545 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:44,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash 631920522, now seen corresponding path program 1 times [2019-11-19 23:41:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414518630] [2019-11-19 23:41:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:44,605 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-19 23:41:44,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414518630] [2019-11-19 23:41:44,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:44,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:44,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227016209] [2019-11-19 23:41:44,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:44,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:44,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:44,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:44,608 INFO L87 Difference]: Start difference. First operand 207 states and 318 transitions. Second operand 4 states. [2019-11-19 23:41:45,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:45,030 INFO L93 Difference]: Finished difference Result 444 states and 689 transitions. [2019-11-19 23:41:45,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:45,031 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-19 23:41:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:45,032 INFO L225 Difference]: With dead ends: 444 [2019-11-19 23:41:45,033 INFO L226 Difference]: Without dead ends: 256 [2019-11-19 23:41:45,033 INFO L630 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-19 23:41:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-11-19 23:41:45,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 231. [2019-11-19 23:41:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-11-19 23:41:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 360 transitions. [2019-11-19 23:41:45,041 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 360 transitions. Word has length 81 [2019-11-19 23:41:45,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:45,042 INFO L462 AbstractCegarLoop]: Abstraction has 231 states and 360 transitions. [2019-11-19 23:41:45,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:45,042 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 360 transitions. [2019-11-19 23:41:45,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 23:41:45,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:45,043 INFO L410 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] [2019-11-19 23:41:45,044 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:45,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:45,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1783613674, now seen corresponding path program 1 times [2019-11-19 23:41:45,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:45,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745794281] [2019-11-19 23:41:45,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:45,142 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-19 23:41:45,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745794281] [2019-11-19 23:41:45,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:45,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:45,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730689921] [2019-11-19 23:41:45,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:45,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:45,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:45,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:45,147 INFO L87 Difference]: Start difference. First operand 231 states and 360 transitions. Second operand 4 states. [2019-11-19 23:41:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:45,670 INFO L93 Difference]: Finished difference Result 501 states and 777 transitions. [2019-11-19 23:41:45,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:45,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-19 23:41:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:45,673 INFO L225 Difference]: With dead ends: 501 [2019-11-19 23:41:45,673 INFO L226 Difference]: Without dead ends: 289 [2019-11-19 23:41:45,674 INFO L630 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-19 23:41:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-19 23:41:45,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 232. [2019-11-19 23:41:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:41:45,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 361 transitions. [2019-11-19 23:41:45,682 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 361 transitions. Word has length 82 [2019-11-19 23:41:45,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:45,682 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 361 transitions. [2019-11-19 23:41:45,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:45,682 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 361 transitions. [2019-11-19 23:41:45,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:41:45,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:45,684 INFO L410 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] [2019-11-19 23:41:45,684 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:45,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash 491747434, now seen corresponding path program 1 times [2019-11-19 23:41:45,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:45,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940258752] [2019-11-19 23:41:45,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:45,760 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-19 23:41:45,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940258752] [2019-11-19 23:41:45,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:45,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:45,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274217108] [2019-11-19 23:41:45,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:45,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:45,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:45,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:45,762 INFO L87 Difference]: Start difference. First operand 232 states and 361 transitions. Second operand 4 states. [2019-11-19 23:41:46,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:46,213 INFO L93 Difference]: Finished difference Result 502 states and 777 transitions. [2019-11-19 23:41:46,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:46,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-19 23:41:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:46,217 INFO L225 Difference]: With dead ends: 502 [2019-11-19 23:41:46,217 INFO L226 Difference]: Without dead ends: 289 [2019-11-19 23:41:46,218 INFO L630 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-19 23:41:46,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-19 23:41:46,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 232. [2019-11-19 23:41:46,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:41:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 360 transitions. [2019-11-19 23:41:46,225 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 360 transitions. Word has length 94 [2019-11-19 23:41:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:46,225 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 360 transitions. [2019-11-19 23:41:46,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 360 transitions. [2019-11-19 23:41:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-19 23:41:46,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:46,226 INFO L410 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] [2019-11-19 23:41:46,227 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:46,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:46,227 INFO L82 PathProgramCache]: Analyzing trace with hash 935648108, now seen corresponding path program 1 times [2019-11-19 23:41:46,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:46,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472648447] [2019-11-19 23:41:46,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:46,285 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-19 23:41:46,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472648447] [2019-11-19 23:41:46,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:46,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:46,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11386653] [2019-11-19 23:41:46,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:46,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:46,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:46,287 INFO L87 Difference]: Start difference. First operand 232 states and 360 transitions. Second operand 4 states. [2019-11-19 23:41:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:46,596 INFO L93 Difference]: Finished difference Result 470 states and 730 transitions. [2019-11-19 23:41:46,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:46,597 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-11-19 23:41:46,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:46,598 INFO L225 Difference]: With dead ends: 470 [2019-11-19 23:41:46,599 INFO L226 Difference]: Without dead ends: 257 [2019-11-19 23:41:46,599 INFO L630 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-19 23:41:46,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-11-19 23:41:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 232. [2019-11-19 23:41:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:41:46,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 359 transitions. [2019-11-19 23:41:46,606 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 359 transitions. Word has length 94 [2019-11-19 23:41:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:46,606 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 359 transitions. [2019-11-19 23:41:46,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:46,606 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 359 transitions. [2019-11-19 23:41:46,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:41:46,607 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:46,607 INFO L410 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] [2019-11-19 23:41:46,607 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1741772316, now seen corresponding path program 1 times [2019-11-19 23:41:46,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:46,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517954722] [2019-11-19 23:41:46,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:46,679 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-19 23:41:46,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517954722] [2019-11-19 23:41:46,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:46,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:46,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039726042] [2019-11-19 23:41:46,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:46,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:46,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:46,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:46,682 INFO L87 Difference]: Start difference. First operand 232 states and 359 transitions. Second operand 4 states. [2019-11-19 23:41:47,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:47,071 INFO L93 Difference]: Finished difference Result 501 states and 772 transitions. [2019-11-19 23:41:47,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:47,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:41:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:47,073 INFO L225 Difference]: With dead ends: 501 [2019-11-19 23:41:47,074 INFO L226 Difference]: Without dead ends: 288 [2019-11-19 23:41:47,074 INFO L630 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-19 23:41:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-11-19 23:41:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 232. [2019-11-19 23:41:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:41:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 358 transitions. [2019-11-19 23:41:47,081 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 358 transitions. Word has length 95 [2019-11-19 23:41:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:47,082 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 358 transitions. [2019-11-19 23:41:47,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 358 transitions. [2019-11-19 23:41:47,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:41:47,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:47,083 INFO L410 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] [2019-11-19 23:41:47,084 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:47,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:47,084 INFO L82 PathProgramCache]: Analyzing trace with hash 879248529, now seen corresponding path program 1 times [2019-11-19 23:41:47,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:47,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740806266] [2019-11-19 23:41:47,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:47,145 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-19 23:41:47,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740806266] [2019-11-19 23:41:47,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:47,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:47,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519447172] [2019-11-19 23:41:47,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:47,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:47,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:47,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:47,147 INFO L87 Difference]: Start difference. First operand 232 states and 358 transitions. Second operand 4 states. [2019-11-19 23:41:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:47,629 INFO L93 Difference]: Finished difference Result 499 states and 768 transitions. [2019-11-19 23:41:47,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:47,630 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:41:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:47,632 INFO L225 Difference]: With dead ends: 499 [2019-11-19 23:41:47,632 INFO L226 Difference]: Without dead ends: 286 [2019-11-19 23:41:47,632 INFO L630 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-19 23:41:47,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-19 23:41:47,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 232. [2019-11-19 23:41:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:41:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 357 transitions. [2019-11-19 23:41:47,638 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 357 transitions. Word has length 95 [2019-11-19 23:41:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:47,638 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 357 transitions. [2019-11-19 23:41:47,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 357 transitions. [2019-11-19 23:41:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:41:47,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:47,640 INFO L410 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] [2019-11-19 23:41:47,640 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash -441604783, now seen corresponding path program 1 times [2019-11-19 23:41:47,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:47,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059601956] [2019-11-19 23:41:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:47,698 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-19 23:41:47,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059601956] [2019-11-19 23:41:47,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:47,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:47,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379778334] [2019-11-19 23:41:47,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:47,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:47,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:47,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:47,701 INFO L87 Difference]: Start difference. First operand 232 states and 357 transitions. Second operand 4 states. [2019-11-19 23:41:48,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:48,078 INFO L93 Difference]: Finished difference Result 498 states and 765 transitions. [2019-11-19 23:41:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:48,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:41:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:48,080 INFO L225 Difference]: With dead ends: 498 [2019-11-19 23:41:48,080 INFO L226 Difference]: Without dead ends: 285 [2019-11-19 23:41:48,081 INFO L630 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-19 23:41:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-19 23:41:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 232. [2019-11-19 23:41:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-11-19 23:41:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 356 transitions. [2019-11-19 23:41:48,090 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 356 transitions. Word has length 95 [2019-11-19 23:41:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:48,090 INFO L462 AbstractCegarLoop]: Abstraction has 232 states and 356 transitions. [2019-11-19 23:41:48,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 356 transitions. [2019-11-19 23:41:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:41:48,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:48,092 INFO L410 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] [2019-11-19 23:41:48,092 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:48,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash 694261512, now seen corresponding path program 1 times [2019-11-19 23:41:48,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:48,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177948260] [2019-11-19 23:41:48,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:48,171 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-19 23:41:48,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177948260] [2019-11-19 23:41:48,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:48,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:41:48,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164061624] [2019-11-19 23:41:48,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:41:48,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:48,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:41:48,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:41:48,173 INFO L87 Difference]: Start difference. First operand 232 states and 356 transitions. Second operand 5 states. [2019-11-19 23:41:48,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:48,707 INFO L93 Difference]: Finished difference Result 466 states and 720 transitions. [2019-11-19 23:41:48,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:41:48,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-19 23:41:48,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:48,709 INFO L225 Difference]: With dead ends: 466 [2019-11-19 23:41:48,709 INFO L226 Difference]: Without dead ends: 253 [2019-11-19 23:41:48,709 INFO L630 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-19 23:41:48,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-19 23:41:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2019-11-19 23:41:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:48,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 382 transitions. [2019-11-19 23:41:48,746 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 382 transitions. Word has length 95 [2019-11-19 23:41:48,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:48,746 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 382 transitions. [2019-11-19 23:41:48,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:41:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 382 transitions. [2019-11-19 23:41:48,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:41:48,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:48,748 INFO L410 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] [2019-11-19 23:41:48,748 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:48,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:48,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1755267535, now seen corresponding path program 1 times [2019-11-19 23:41:48,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:48,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937689595] [2019-11-19 23:41:48,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:48,809 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-19 23:41:48,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937689595] [2019-11-19 23:41:48,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:48,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:48,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899403770] [2019-11-19 23:41:48,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:48,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:48,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:48,811 INFO L87 Difference]: Start difference. First operand 252 states and 382 transitions. Second operand 4 states. [2019-11-19 23:41:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:49,099 INFO L93 Difference]: Finished difference Result 507 states and 770 transitions. [2019-11-19 23:41:49,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:49,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:41:49,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:49,101 INFO L225 Difference]: With dead ends: 507 [2019-11-19 23:41:49,101 INFO L226 Difference]: Without dead ends: 274 [2019-11-19 23:41:49,102 INFO L630 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-19 23:41:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-11-19 23:41:49,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 252. [2019-11-19 23:41:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 381 transitions. [2019-11-19 23:41:49,109 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 381 transitions. Word has length 95 [2019-11-19 23:41:49,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:49,109 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 381 transitions. [2019-11-19 23:41:49,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 381 transitions. [2019-11-19 23:41:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-19 23:41:49,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:49,111 INFO L410 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] [2019-11-19 23:41:49,111 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:49,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:49,111 INFO L82 PathProgramCache]: Analyzing trace with hash 434414223, now seen corresponding path program 1 times [2019-11-19 23:41:49,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:49,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680052500] [2019-11-19 23:41:49,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:49,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:49,163 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-19 23:41:49,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680052500] [2019-11-19 23:41:49,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:49,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:49,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343332866] [2019-11-19 23:41:49,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:49,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:49,165 INFO L87 Difference]: Start difference. First operand 252 states and 381 transitions. Second operand 4 states. [2019-11-19 23:41:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:49,457 INFO L93 Difference]: Finished difference Result 506 states and 767 transitions. [2019-11-19 23:41:49,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:49,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-19 23:41:49,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:49,459 INFO L225 Difference]: With dead ends: 506 [2019-11-19 23:41:49,459 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 23:41:49,459 INFO L630 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-19 23:41:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 23:41:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 23:41:49,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:49,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 380 transitions. [2019-11-19 23:41:49,466 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 380 transitions. Word has length 95 [2019-11-19 23:41:49,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:49,467 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 380 transitions. [2019-11-19 23:41:49,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:49,467 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 380 transitions. [2019-11-19 23:41:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 23:41:49,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:49,468 INFO L410 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] [2019-11-19 23:41:49,468 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash 407531758, now seen corresponding path program 1 times [2019-11-19 23:41:49,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:49,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139500680] [2019-11-19 23:41:49,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:49,525 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-19 23:41:49,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139500680] [2019-11-19 23:41:49,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:49,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:49,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669590830] [2019-11-19 23:41:49,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:49,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:49,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:49,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:49,527 INFO L87 Difference]: Start difference. First operand 252 states and 380 transitions. Second operand 4 states. [2019-11-19 23:41:50,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:50,012 INFO L93 Difference]: Finished difference Result 538 states and 810 transitions. [2019-11-19 23:41:50,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:50,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-19 23:41:50,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:50,015 INFO L225 Difference]: With dead ends: 538 [2019-11-19 23:41:50,015 INFO L226 Difference]: Without dead ends: 305 [2019-11-19 23:41:50,015 INFO L630 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-19 23:41:50,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-19 23:41:50,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2019-11-19 23:41:50,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:50,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 379 transitions. [2019-11-19 23:41:50,022 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 379 transitions. Word has length 96 [2019-11-19 23:41:50,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:50,022 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 379 transitions. [2019-11-19 23:41:50,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:50,022 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 379 transitions. [2019-11-19 23:41:50,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 23:41:50,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:50,023 INFO L410 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] [2019-11-19 23:41:50,023 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:50,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:50,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1794317168, now seen corresponding path program 1 times [2019-11-19 23:41:50,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:50,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129597344] [2019-11-19 23:41:50,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:50,075 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-19 23:41:50,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129597344] [2019-11-19 23:41:50,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:50,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:50,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002464299] [2019-11-19 23:41:50,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:50,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:50,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:50,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:50,077 INFO L87 Difference]: Start difference. First operand 252 states and 379 transitions. Second operand 4 states. [2019-11-19 23:41:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:50,472 INFO L93 Difference]: Finished difference Result 506 states and 763 transitions. [2019-11-19 23:41:50,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:50,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-19 23:41:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:50,474 INFO L225 Difference]: With dead ends: 506 [2019-11-19 23:41:50,474 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 23:41:50,475 INFO L630 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-19 23:41:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 23:41:50,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 23:41:50,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:50,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 378 transitions. [2019-11-19 23:41:50,482 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 378 transitions. Word has length 96 [2019-11-19 23:41:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:50,482 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 378 transitions. [2019-11-19 23:41:50,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:50,483 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 378 transitions. [2019-11-19 23:41:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 23:41:50,484 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:50,484 INFO L410 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] [2019-11-19 23:41:50,484 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:50,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:50,485 INFO L82 PathProgramCache]: Analyzing trace with hash -553515499, now seen corresponding path program 1 times [2019-11-19 23:41:50,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:50,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321434784] [2019-11-19 23:41:50,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:50,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:50,539 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-19 23:41:50,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321434784] [2019-11-19 23:41:50,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:50,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:50,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080531209] [2019-11-19 23:41:50,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:50,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:50,541 INFO L87 Difference]: Start difference. First operand 252 states and 378 transitions. Second operand 4 states. [2019-11-19 23:41:50,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:50,952 INFO L93 Difference]: Finished difference Result 538 states and 806 transitions. [2019-11-19 23:41:50,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:50,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 23:41:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:50,954 INFO L225 Difference]: With dead ends: 538 [2019-11-19 23:41:50,954 INFO L226 Difference]: Without dead ends: 305 [2019-11-19 23:41:50,954 INFO L630 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-19 23:41:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-19 23:41:50,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2019-11-19 23:41:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:50,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2019-11-19 23:41:50,962 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 97 [2019-11-19 23:41:50,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:50,962 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2019-11-19 23:41:50,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:50,962 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2019-11-19 23:41:50,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-19 23:41:50,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:50,963 INFO L410 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] [2019-11-19 23:41:50,963 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:50,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:50,964 INFO L82 PathProgramCache]: Analyzing trace with hash -512840749, now seen corresponding path program 1 times [2019-11-19 23:41:50,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:50,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221715699] [2019-11-19 23:41:50,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:51,026 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-19 23:41:51,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221715699] [2019-11-19 23:41:51,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:51,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:51,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342273824] [2019-11-19 23:41:51,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:51,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:51,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:51,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:51,028 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand 4 states. [2019-11-19 23:41:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:51,402 INFO L93 Difference]: Finished difference Result 506 states and 759 transitions. [2019-11-19 23:41:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:51,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-19 23:41:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:51,404 INFO L225 Difference]: With dead ends: 506 [2019-11-19 23:41:51,404 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 23:41:51,405 INFO L630 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-19 23:41:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 23:41:51,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 23:41:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 376 transitions. [2019-11-19 23:41:51,411 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 376 transitions. Word has length 97 [2019-11-19 23:41:51,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:51,413 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 376 transitions. [2019-11-19 23:41:51,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 376 transitions. [2019-11-19 23:41:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:41:51,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:51,415 INFO L410 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] [2019-11-19 23:41:51,415 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:51,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:51,415 INFO L82 PathProgramCache]: Analyzing trace with hash 983553299, now seen corresponding path program 1 times [2019-11-19 23:41:51,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:51,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471901565] [2019-11-19 23:41:51,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:51,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:51,467 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-19 23:41:51,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471901565] [2019-11-19 23:41:51,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:51,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:51,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136593691] [2019-11-19 23:41:51,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:51,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:51,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:51,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:51,469 INFO L87 Difference]: Start difference. First operand 252 states and 376 transitions. Second operand 4 states. [2019-11-19 23:41:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:51,863 INFO L93 Difference]: Finished difference Result 538 states and 802 transitions. [2019-11-19 23:41:51,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:51,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:41:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:51,865 INFO L225 Difference]: With dead ends: 538 [2019-11-19 23:41:51,865 INFO L226 Difference]: Without dead ends: 305 [2019-11-19 23:41:51,866 INFO L630 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-19 23:41:51,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-19 23:41:51,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 252. [2019-11-19 23:41:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 375 transitions. [2019-11-19 23:41:51,873 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 375 transitions. Word has length 98 [2019-11-19 23:41:51,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:51,873 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 375 transitions. [2019-11-19 23:41:51,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 375 transitions. [2019-11-19 23:41:51,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:41:51,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:51,875 INFO L410 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] [2019-11-19 23:41:51,875 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:51,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:51,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2050496747, now seen corresponding path program 1 times [2019-11-19 23:41:51,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:51,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148024832] [2019-11-19 23:41:51,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:51,931 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-19 23:41:51,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148024832] [2019-11-19 23:41:51,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:51,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:51,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467802611] [2019-11-19 23:41:51,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:51,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:51,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:51,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:51,933 INFO L87 Difference]: Start difference. First operand 252 states and 375 transitions. Second operand 4 states. [2019-11-19 23:41:52,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:52,299 INFO L93 Difference]: Finished difference Result 506 states and 755 transitions. [2019-11-19 23:41:52,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:52,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:41:52,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:52,301 INFO L225 Difference]: With dead ends: 506 [2019-11-19 23:41:52,301 INFO L226 Difference]: Without dead ends: 273 [2019-11-19 23:41:52,302 INFO L630 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-19 23:41:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-11-19 23:41:52,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 252. [2019-11-19 23:41:52,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:52,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 374 transitions. [2019-11-19 23:41:52,310 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 374 transitions. Word has length 98 [2019-11-19 23:41:52,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:52,310 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 374 transitions. [2019-11-19 23:41:52,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:52,310 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 374 transitions. [2019-11-19 23:41:52,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:41:52,311 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:52,312 INFO L410 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] [2019-11-19 23:41:52,312 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:52,313 INFO L82 PathProgramCache]: Analyzing trace with hash -1642158822, now seen corresponding path program 1 times [2019-11-19 23:41:52,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:52,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057502783] [2019-11-19 23:41:52,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:52,381 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-19 23:41:52,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057502783] [2019-11-19 23:41:52,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:52,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:52,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728990801] [2019-11-19 23:41:52,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:52,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:52,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:52,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:52,383 INFO L87 Difference]: Start difference. First operand 252 states and 374 transitions. Second operand 4 states. [2019-11-19 23:41:52,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:52,832 INFO L93 Difference]: Finished difference Result 528 states and 786 transitions. [2019-11-19 23:41:52,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:52,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 23:41:52,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:52,834 INFO L225 Difference]: With dead ends: 528 [2019-11-19 23:41:52,834 INFO L226 Difference]: Without dead ends: 295 [2019-11-19 23:41:52,834 INFO L630 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-19 23:41:52,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-19 23:41:52,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 252. [2019-11-19 23:41:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:52,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 373 transitions. [2019-11-19 23:41:52,842 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 373 transitions. Word has length 99 [2019-11-19 23:41:52,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:52,842 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 373 transitions. [2019-11-19 23:41:52,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 373 transitions. [2019-11-19 23:41:52,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 23:41:52,843 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:52,844 INFO L410 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] [2019-11-19 23:41:52,844 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:52,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:52,844 INFO L82 PathProgramCache]: Analyzing trace with hash -1208429736, now seen corresponding path program 1 times [2019-11-19 23:41:52,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:52,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210612146] [2019-11-19 23:41:52,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:52,909 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-19 23:41:52,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210612146] [2019-11-19 23:41:52,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:52,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:52,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338449971] [2019-11-19 23:41:52,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:52,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:52,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:52,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:52,913 INFO L87 Difference]: Start difference. First operand 252 states and 373 transitions. Second operand 4 states. [2019-11-19 23:41:53,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:53,258 INFO L93 Difference]: Finished difference Result 496 states and 739 transitions. [2019-11-19 23:41:53,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:53,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-11-19 23:41:53,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:53,260 INFO L225 Difference]: With dead ends: 496 [2019-11-19 23:41:53,260 INFO L226 Difference]: Without dead ends: 263 [2019-11-19 23:41:53,261 INFO L630 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-19 23:41:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-19 23:41:53,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 252. [2019-11-19 23:41:53,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:53,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 372 transitions. [2019-11-19 23:41:53,269 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 372 transitions. Word has length 99 [2019-11-19 23:41:53,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:53,269 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 372 transitions. [2019-11-19 23:41:53,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:53,270 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 372 transitions. [2019-11-19 23:41:53,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 23:41:53,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:53,271 INFO L410 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] [2019-11-19 23:41:53,271 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:53,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:53,272 INFO L82 PathProgramCache]: Analyzing trace with hash -232302130, now seen corresponding path program 1 times [2019-11-19 23:41:53,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:53,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169379645] [2019-11-19 23:41:53,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:53,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:53,329 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-19 23:41:53,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169379645] [2019-11-19 23:41:53,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:53,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:53,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122223768] [2019-11-19 23:41:53,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:53,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:53,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:53,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:53,332 INFO L87 Difference]: Start difference. First operand 252 states and 372 transitions. Second operand 4 states. [2019-11-19 23:41:53,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:53,793 INFO L93 Difference]: Finished difference Result 528 states and 782 transitions. [2019-11-19 23:41:53,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:53,793 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 23:41:53,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:53,795 INFO L225 Difference]: With dead ends: 528 [2019-11-19 23:41:53,795 INFO L226 Difference]: Without dead ends: 295 [2019-11-19 23:41:53,796 INFO L630 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-19 23:41:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-11-19 23:41:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 252. [2019-11-19 23:41:53,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-19 23:41:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 371 transitions. [2019-11-19 23:41:53,808 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 371 transitions. Word has length 103 [2019-11-19 23:41:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:53,808 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 371 transitions. [2019-11-19 23:41:53,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 371 transitions. [2019-11-19 23:41:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 23:41:53,809 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:53,810 INFO L410 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] [2019-11-19 23:41:53,810 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:53,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:53,810 INFO L82 PathProgramCache]: Analyzing trace with hash 446970124, now seen corresponding path program 1 times [2019-11-19 23:41:53,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:53,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385181538] [2019-11-19 23:41:53,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:53,873 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-19 23:41:53,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385181538] [2019-11-19 23:41:53,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:53,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:41:53,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152974311] [2019-11-19 23:41:53,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:41:53,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:41:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:41:53,875 INFO L87 Difference]: Start difference. First operand 252 states and 371 transitions. Second operand 3 states. [2019-11-19 23:41:53,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:53,925 INFO L93 Difference]: Finished difference Result 716 states and 1068 transitions. [2019-11-19 23:41:53,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:41:53,925 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-11-19 23:41:53,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:53,928 INFO L225 Difference]: With dead ends: 716 [2019-11-19 23:41:53,928 INFO L226 Difference]: Without dead ends: 483 [2019-11-19 23:41:53,929 INFO L630 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-19 23:41:53,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-19 23:41:53,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2019-11-19 23:41:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-11-19 23:41:53,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 714 transitions. [2019-11-19 23:41:53,942 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 714 transitions. Word has length 103 [2019-11-19 23:41:53,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:53,943 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 714 transitions. [2019-11-19 23:41:53,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:41:53,943 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 714 transitions. [2019-11-19 23:41:53,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-19 23:41:53,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:53,944 INFO L410 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] [2019-11-19 23:41:53,945 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:53,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:53,945 INFO L82 PathProgramCache]: Analyzing trace with hash -965755464, now seen corresponding path program 1 times [2019-11-19 23:41:53,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:53,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283459320] [2019-11-19 23:41:53,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:54,001 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-19 23:41:54,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283459320] [2019-11-19 23:41:54,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:54,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:41:54,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882456067] [2019-11-19 23:41:54,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:41:54,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:54,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:41:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:41:54,004 INFO L87 Difference]: Start difference. First operand 483 states and 714 transitions. Second operand 3 states. [2019-11-19 23:41:54,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:54,063 INFO L93 Difference]: Finished difference Result 1178 states and 1754 transitions. [2019-11-19 23:41:54,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:41:54,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-19 23:41:54,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:54,067 INFO L225 Difference]: With dead ends: 1178 [2019-11-19 23:41:54,067 INFO L226 Difference]: Without dead ends: 714 [2019-11-19 23:41:54,068 INFO L630 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-19 23:41:54,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2019-11-19 23:41:54,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2019-11-19 23:41:54,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-11-19 23:41:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1058 transitions. [2019-11-19 23:41:54,089 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1058 transitions. Word has length 122 [2019-11-19 23:41:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 714 states and 1058 transitions. [2019-11-19 23:41:54,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:41:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1058 transitions. [2019-11-19 23:41:54,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-19 23:41:54,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:54,092 INFO L410 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] [2019-11-19 23:41:54,092 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:54,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1452035124, now seen corresponding path program 1 times [2019-11-19 23:41:54,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:54,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636566671] [2019-11-19 23:41:54,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:54,171 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-19 23:41:54,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636566671] [2019-11-19 23:41:54,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:54,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:41:54,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100418616] [2019-11-19 23:41:54,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:41:54,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:54,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:41:54,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:41:54,173 INFO L87 Difference]: Start difference. First operand 714 states and 1058 transitions. Second operand 3 states. [2019-11-19 23:41:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:54,258 INFO L93 Difference]: Finished difference Result 1635 states and 2435 transitions. [2019-11-19 23:41:54,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:41:54,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-19 23:41:54,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:54,264 INFO L225 Difference]: With dead ends: 1635 [2019-11-19 23:41:54,264 INFO L226 Difference]: Without dead ends: 940 [2019-11-19 23:41:54,265 INFO L630 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-19 23:41:54,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2019-11-19 23:41:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 940. [2019-11-19 23:41:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 940 states. [2019-11-19 23:41:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1392 transitions. [2019-11-19 23:41:54,294 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1392 transitions. Word has length 165 [2019-11-19 23:41:54,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:54,294 INFO L462 AbstractCegarLoop]: Abstraction has 940 states and 1392 transitions. [2019-11-19 23:41:54,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:41:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1392 transitions. [2019-11-19 23:41:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-19 23:41:54,297 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:54,298 INFO L410 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] [2019-11-19 23:41:54,298 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 962270157, now seen corresponding path program 1 times [2019-11-19 23:41:54,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:54,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377084367] [2019-11-19 23:41:54,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:54,394 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-19 23:41:54,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377084367] [2019-11-19 23:41:54,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:54,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:41:54,395 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678554377] [2019-11-19 23:41:54,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:41:54,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:54,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:41:54,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:41:54,396 INFO L87 Difference]: Start difference. First operand 940 states and 1392 transitions. Second operand 3 states. [2019-11-19 23:41:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:54,469 INFO L93 Difference]: Finished difference Result 2092 states and 3110 transitions. [2019-11-19 23:41:54,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:41:54,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 204 [2019-11-19 23:41:54,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:54,476 INFO L225 Difference]: With dead ends: 2092 [2019-11-19 23:41:54,476 INFO L226 Difference]: Without dead ends: 1171 [2019-11-19 23:41:54,477 INFO L630 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-19 23:41:54,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2019-11-19 23:41:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 1171. [2019-11-19 23:41:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1171 states. [2019-11-19 23:41:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1171 states to 1171 states and 1738 transitions. [2019-11-19 23:41:54,509 INFO L78 Accepts]: Start accepts. Automaton has 1171 states and 1738 transitions. Word has length 204 [2019-11-19 23:41:54,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:54,509 INFO L462 AbstractCegarLoop]: Abstraction has 1171 states and 1738 transitions. [2019-11-19 23:41:54,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:41:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1738 transitions. [2019-11-19 23:41:54,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-11-19 23:41:54,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:54,513 INFO L410 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] [2019-11-19 23:41:54,513 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:54,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:54,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1282881610, now seen corresponding path program 1 times [2019-11-19 23:41:54,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:54,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402534597] [2019-11-19 23:41:54,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:54,643 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-19 23:41:54,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402534597] [2019-11-19 23:41:54,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:54,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:41:54,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933754268] [2019-11-19 23:41:54,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:41:54,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:54,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:41:54,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:41:54,648 INFO L87 Difference]: Start difference. First operand 1171 states and 1738 transitions. Second operand 3 states. [2019-11-19 23:41:54,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:54,712 INFO L93 Difference]: Finished difference Result 1404 states and 2087 transitions. [2019-11-19 23:41:54,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:41:54,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-11-19 23:41:54,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:54,720 INFO L225 Difference]: With dead ends: 1404 [2019-11-19 23:41:54,720 INFO L226 Difference]: Without dead ends: 1402 [2019-11-19 23:41:54,721 INFO L630 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-19 23:41:54,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2019-11-19 23:41:54,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1402. [2019-11-19 23:41:54,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1402 states. [2019-11-19 23:41:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1402 states to 1402 states and 2085 transitions. [2019-11-19 23:41:54,791 INFO L78 Accepts]: Start accepts. Automaton has 1402 states and 2085 transitions. Word has length 246 [2019-11-19 23:41:54,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:54,792 INFO L462 AbstractCegarLoop]: Abstraction has 1402 states and 2085 transitions. [2019-11-19 23:41:54,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:41:54,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states and 2085 transitions. [2019-11-19 23:41:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-19 23:41:54,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:54,799 INFO L410 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] [2019-11-19 23:41:54,799 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:54,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:54,799 INFO L82 PathProgramCache]: Analyzing trace with hash 72434664, now seen corresponding path program 1 times [2019-11-19 23:41:54,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:54,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539539403] [2019-11-19 23:41:54,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:54,977 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-19 23:41:54,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539539403] [2019-11-19 23:41:54,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:54,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:41:54,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699605551] [2019-11-19 23:41:54,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:41:54,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:54,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:41:54,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:41:54,982 INFO L87 Difference]: Start difference. First operand 1402 states and 2085 transitions. Second operand 4 states. [2019-11-19 23:41:55,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:55,535 INFO L93 Difference]: Finished difference Result 3390 states and 5071 transitions. [2019-11-19 23:41:55,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:41:55,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 290 [2019-11-19 23:41:55,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:55,545 INFO L225 Difference]: With dead ends: 3390 [2019-11-19 23:41:55,545 INFO L226 Difference]: Without dead ends: 2007 [2019-11-19 23:41:55,547 INFO L630 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-19 23:41:55,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2019-11-19 23:41:55,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1648. [2019-11-19 23:41:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-11-19 23:41:55,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2535 transitions. [2019-11-19 23:41:55,594 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2535 transitions. Word has length 290 [2019-11-19 23:41:55,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:55,595 INFO L462 AbstractCegarLoop]: Abstraction has 1648 states and 2535 transitions. [2019-11-19 23:41:55,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:41:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2535 transitions. [2019-11-19 23:41:55,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-19 23:41:55,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:55,600 INFO L410 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] [2019-11-19 23:41:55,601 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:55,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:55,601 INFO L82 PathProgramCache]: Analyzing trace with hash -357223642, now seen corresponding path program 1 times [2019-11-19 23:41:55,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:55,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196291920] [2019-11-19 23:41:55,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:55,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 508 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2019-11-19 23:41:55,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196291920] [2019-11-19 23:41:55,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:41:55,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:41:55,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761241750] [2019-11-19 23:41:55,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:41:55,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:55,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:41:55,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:41:55,893 INFO L87 Difference]: Start difference. First operand 1648 states and 2535 transitions. Second operand 5 states. [2019-11-19 23:41:56,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:41:56,759 INFO L93 Difference]: Finished difference Result 4871 states and 7518 transitions. [2019-11-19 23:41:56,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:41:56,759 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 290 [2019-11-19 23:41:56,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:41:56,775 INFO L225 Difference]: With dead ends: 4871 [2019-11-19 23:41:56,775 INFO L226 Difference]: Without dead ends: 3242 [2019-11-19 23:41:56,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:41:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2019-11-19 23:41:56,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3114. [2019-11-19 23:41:56,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3114 states. [2019-11-19 23:41:56,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 4837 transitions. [2019-11-19 23:41:56,865 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 4837 transitions. Word has length 290 [2019-11-19 23:41:56,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:41:56,866 INFO L462 AbstractCegarLoop]: Abstraction has 3114 states and 4837 transitions. [2019-11-19 23:41:56,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:41:56,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 4837 transitions. [2019-11-19 23:41:56,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-19 23:41:56,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:41:56,873 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 23:41:56,873 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:41:56,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:41:56,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2014493224, now seen corresponding path program 1 times [2019-11-19 23:41:56,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:41:56,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208904251] [2019-11-19 23:41:56,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:41:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 500 proven. 70 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-19 23:41:57,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208904251] [2019-11-19 23:41:57,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551744741] [2019-11-19 23:41:57,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:41:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:41:57,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:41:57,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:41:57,992 INFO L377 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-19 23:41:57,993 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:41:57,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:41:57,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:41:57,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:41:58,029 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_158|], 2=[|v_#memory_int_179|]} [2019-11-19 23:41:58,032 INFO L377 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-19 23:41:58,033 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-19 23:41:58,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:41:58,042 INFO L377 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-19 23:41:58,043 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-19 23:41:58,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:41:58,072 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:41:58,073 INFO L377 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-19 23:41:58,073 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:41:58,106 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-19 23:41:58,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:41:58,111 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-19 23:41:58,112 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-19 23:41:58,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:41:58,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:41:58,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:41:58,196 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:41:58,196 INFO L377 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-19 23:41:58,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:41:58,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:41:58,207 INFO L377 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-19 23:41:58,207 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:41:58,273 INFO L567 ElimStorePlain]: treesize reduction 44, result has 57.7 percent of original size [2019-11-19 23:41:58,275 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-19 23:41:58,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-19 23:41:58,428 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:41:58,428 INFO L377 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-19 23:41:58,428 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:41:58,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:41:58,431 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-19 23:41:58,431 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:41:58,586 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-19 23:41:58,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:41:58,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2019-11-19 23:41:58,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559484833] [2019-11-19 23:41:58,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:41:58,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:41:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:41:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:41:58,589 INFO L87 Difference]: Start difference. First operand 3114 states and 4837 transitions. Second operand 8 states. [2019-11-19 23:42:01,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:01,579 INFO L93 Difference]: Finished difference Result 9589 states and 14854 transitions. [2019-11-19 23:42:01,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:42:01,580 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 290 [2019-11-19 23:42:01,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:01,634 INFO L225 Difference]: With dead ends: 9589 [2019-11-19 23:42:01,634 INFO L226 Difference]: Without dead ends: 6494 [2019-11-19 23:42:01,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:42:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6494 states. [2019-11-19 23:42:01,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6494 to 4614. [2019-11-19 23:42:01,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4614 states. [2019-11-19 23:42:01,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4614 states to 4614 states and 7492 transitions. [2019-11-19 23:42:01,834 INFO L78 Accepts]: Start accepts. Automaton has 4614 states and 7492 transitions. Word has length 290 [2019-11-19 23:42:01,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:01,834 INFO L462 AbstractCegarLoop]: Abstraction has 4614 states and 7492 transitions. [2019-11-19 23:42:01,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:42:01,835 INFO L276 IsEmpty]: Start isEmpty. Operand 4614 states and 7492 transitions. [2019-11-19 23:42:01,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-19 23:42:01,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:01,846 INFO L410 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:02,060 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:42:02,061 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:02,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:02,061 INFO L82 PathProgramCache]: Analyzing trace with hash 514655940, now seen corresponding path program 1 times [2019-11-19 23:42:02,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:02,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470130872] [2019-11-19 23:42:02,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2019-11-19 23:42:02,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470130872] [2019-11-19 23:42:02,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:02,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:02,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072041397] [2019-11-19 23:42:02,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:02,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:02,369 INFO L87 Difference]: Start difference. First operand 4614 states and 7492 transitions. Second operand 4 states. [2019-11-19 23:42:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:03,127 INFO L93 Difference]: Finished difference Result 9892 states and 15854 transitions. [2019-11-19 23:42:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:03,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 291 [2019-11-19 23:42:03,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:03,138 INFO L225 Difference]: With dead ends: 9892 [2019-11-19 23:42:03,139 INFO L226 Difference]: Without dead ends: 5297 [2019-11-19 23:42:03,145 INFO L630 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-19 23:42:03,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2019-11-19 23:42:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 4626. [2019-11-19 23:42:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4626 states. [2019-11-19 23:42:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 7504 transitions. [2019-11-19 23:42:03,281 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 7504 transitions. Word has length 291 [2019-11-19 23:42:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:03,282 INFO L462 AbstractCegarLoop]: Abstraction has 4626 states and 7504 transitions. [2019-11-19 23:42:03,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 7504 transitions. [2019-11-19 23:42:03,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-11-19 23:42:03,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:03,294 INFO L410 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, 5, 4, 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-19 23:42:03,294 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1932810758, now seen corresponding path program 1 times [2019-11-19 23:42:03,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:03,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818448786] [2019-11-19 23:42:03,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:03,853 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 503 proven. 71 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-19 23:42:03,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818448786] [2019-11-19 23:42:03,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463598930] [2019-11-19 23:42:03,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:42:04,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:04,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 23:42:04,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:42:04,203 INFO L377 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-19 23:42:04,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:04,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:04,206 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:04,206 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-19 23:42:04,238 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_182|]} [2019-11-19 23:42:04,242 INFO L377 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 19 [2019-11-19 23:42:04,243 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-19 23:42:04,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:04,259 INFO L377 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 19 treesize of output 13 [2019-11-19 23:42:04,259 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-19 23:42:04,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:04,298 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:04,298 INFO L377 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-19 23:42:04,299 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:04,335 INFO L567 ElimStorePlain]: treesize reduction 22, result has 58.5 percent of original size [2019-11-19 23:42:04,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:42:04,337 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-19 23:42:04,337 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:41, output treesize:31 [2019-11-19 23:42:04,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:42:04,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:42:04,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:04,417 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:04,418 INFO L377 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-19 23:42:04,418 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:04,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:04,425 INFO L377 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-19 23:42:04,426 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:04,466 INFO L567 ElimStorePlain]: treesize reduction 35, result has 63.2 percent of original size [2019-11-19 23:42:04,466 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-19 23:42:04,467 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:39 [2019-11-19 23:42:04,616 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:42:04,616 INFO L377 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-19 23:42:04,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:04,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:04,619 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-19 23:42:04,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:42:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 719 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-19 23:42:04,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:42:04,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2019-11-19 23:42:04,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695971248] [2019-11-19 23:42:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:42:04,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:04,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:42:04,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-19 23:42:04,742 INFO L87 Difference]: Start difference. First operand 4626 states and 7504 transitions. Second operand 8 states. [2019-11-19 23:42:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:07,247 INFO L93 Difference]: Finished difference Result 11035 states and 17383 transitions. [2019-11-19 23:42:07,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 23:42:07,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 291 [2019-11-19 23:42:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:07,262 INFO L225 Difference]: With dead ends: 11035 [2019-11-19 23:42:07,262 INFO L226 Difference]: Without dead ends: 6428 [2019-11-19 23:42:07,268 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 291 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-11-19 23:42:07,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6428 states. [2019-11-19 23:42:07,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6428 to 4466. [2019-11-19 23:42:07,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-11-19 23:42:07,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 7229 transitions. [2019-11-19 23:42:07,425 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 7229 transitions. Word has length 291 [2019-11-19 23:42:07,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:07,425 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 7229 transitions. [2019-11-19 23:42:07,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:42:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 7229 transitions. [2019-11-19 23:42:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-19 23:42:07,437 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:07,437 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:07,642 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:42:07,642 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:07,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:07,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1396334824, now seen corresponding path program 1 times [2019-11-19 23:42:07,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:07,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050688338] [2019-11-19 23:42:07,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:07,818 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 465 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:07,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050688338] [2019-11-19 23:42:07,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:07,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:07,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990268799] [2019-11-19 23:42:07,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:07,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:07,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:07,821 INFO L87 Difference]: Start difference. First operand 4466 states and 7229 transitions. Second operand 4 states. [2019-11-19 23:42:08,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:08,422 INFO L93 Difference]: Finished difference Result 9557 states and 15268 transitions. [2019-11-19 23:42:08,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:08,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 305 [2019-11-19 23:42:08,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:08,434 INFO L225 Difference]: With dead ends: 9557 [2019-11-19 23:42:08,434 INFO L226 Difference]: Without dead ends: 5110 [2019-11-19 23:42:08,440 INFO L630 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-19 23:42:08,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5110 states. [2019-11-19 23:42:08,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5110 to 4466. [2019-11-19 23:42:08,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4466 states. [2019-11-19 23:42:08,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4466 states to 4466 states and 7195 transitions. [2019-11-19 23:42:08,581 INFO L78 Accepts]: Start accepts. Automaton has 4466 states and 7195 transitions. Word has length 305 [2019-11-19 23:42:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:08,581 INFO L462 AbstractCegarLoop]: Abstraction has 4466 states and 7195 transitions. [2019-11-19 23:42:08,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4466 states and 7195 transitions. [2019-11-19 23:42:08,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-19 23:42:08,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:08,591 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:08,591 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:08,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:08,591 INFO L82 PathProgramCache]: Analyzing trace with hash 944420676, now seen corresponding path program 1 times [2019-11-19 23:42:08,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:08,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598061852] [2019-11-19 23:42:08,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:08,888 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 534 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-19 23:42:08,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598061852] [2019-11-19 23:42:08,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:08,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:42:08,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429866038] [2019-11-19 23:42:08,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:42:08,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:08,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:42:08,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:42:08,890 INFO L87 Difference]: Start difference. First operand 4466 states and 7195 transitions. Second operand 5 states. [2019-11-19 23:42:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:09,456 INFO L93 Difference]: Finished difference Result 10199 states and 16358 transitions. [2019-11-19 23:42:09,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:09,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 305 [2019-11-19 23:42:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:09,470 INFO L225 Difference]: With dead ends: 10199 [2019-11-19 23:42:09,470 INFO L226 Difference]: Without dead ends: 5752 [2019-11-19 23:42:09,476 INFO L630 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-19 23:42:09,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5752 states. [2019-11-19 23:42:09,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5752 to 4934. [2019-11-19 23:42:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2019-11-19 23:42:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 8035 transitions. [2019-11-19 23:42:09,619 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 8035 transitions. Word has length 305 [2019-11-19 23:42:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:09,619 INFO L462 AbstractCegarLoop]: Abstraction has 4934 states and 8035 transitions. [2019-11-19 23:42:09,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:42:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 8035 transitions. [2019-11-19 23:42:09,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-19 23:42:09,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:09,632 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:09,633 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:09,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:09,633 INFO L82 PathProgramCache]: Analyzing trace with hash -356508303, now seen corresponding path program 1 times [2019-11-19 23:42:09,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:09,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053631132] [2019-11-19 23:42:09,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:09,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053631132] [2019-11-19 23:42:09,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:09,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:09,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763246833] [2019-11-19 23:42:09,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:09,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:09,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:09,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:09,785 INFO L87 Difference]: Start difference. First operand 4934 states and 8035 transitions. Second operand 4 states. [2019-11-19 23:42:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:10,364 INFO L93 Difference]: Finished difference Result 10493 states and 16880 transitions. [2019-11-19 23:42:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:10,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-11-19 23:42:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:10,374 INFO L225 Difference]: With dead ends: 10493 [2019-11-19 23:42:10,374 INFO L226 Difference]: Without dead ends: 5578 [2019-11-19 23:42:10,380 INFO L630 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-19 23:42:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5578 states. [2019-11-19 23:42:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5578 to 4934. [2019-11-19 23:42:10,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4934 states. [2019-11-19 23:42:10,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4934 states to 4934 states and 8001 transitions. [2019-11-19 23:42:10,511 INFO L78 Accepts]: Start accepts. Automaton has 4934 states and 8001 transitions. Word has length 306 [2019-11-19 23:42:10,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:10,511 INFO L462 AbstractCegarLoop]: Abstraction has 4934 states and 8001 transitions. [2019-11-19 23:42:10,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:10,513 INFO L276 IsEmpty]: Start isEmpty. Operand 4934 states and 8001 transitions. [2019-11-19 23:42:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-19 23:42:10,521 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:10,521 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:10,521 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:10,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:10,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1174667158, now seen corresponding path program 1 times [2019-11-19 23:42:10,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:10,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709679895] [2019-11-19 23:42:10,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-11-19 23:42:10,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709679895] [2019-11-19 23:42:10,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:10,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:42:10,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904872250] [2019-11-19 23:42:10,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:42:10,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:42:10,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:42:10,736 INFO L87 Difference]: Start difference. First operand 4934 states and 8001 transitions. Second operand 5 states. [2019-11-19 23:42:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:11,460 INFO L93 Difference]: Finished difference Result 11003 states and 17778 transitions. [2019-11-19 23:42:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:11,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 306 [2019-11-19 23:42:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:11,467 INFO L225 Difference]: With dead ends: 11003 [2019-11-19 23:42:11,468 INFO L226 Difference]: Without dead ends: 6088 [2019-11-19 23:42:11,473 INFO L630 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-19 23:42:11,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6088 states. [2019-11-19 23:42:11,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6088 to 4818. [2019-11-19 23:42:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4818 states. [2019-11-19 23:42:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 7793 transitions. [2019-11-19 23:42:11,638 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 7793 transitions. Word has length 306 [2019-11-19 23:42:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:11,639 INFO L462 AbstractCegarLoop]: Abstraction has 4818 states and 7793 transitions. [2019-11-19 23:42:11,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:42:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 7793 transitions. [2019-11-19 23:42:11,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-19 23:42:11,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:11,648 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:11,648 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:11,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:11,649 INFO L82 PathProgramCache]: Analyzing trace with hash 2048595853, now seen corresponding path program 1 times [2019-11-19 23:42:11,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:11,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893814301] [2019-11-19 23:42:11,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:11,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893814301] [2019-11-19 23:42:11,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:11,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:11,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782599043] [2019-11-19 23:42:11,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:11,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:11,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:11,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:11,902 INFO L87 Difference]: Start difference. First operand 4818 states and 7793 transitions. Second operand 4 states. [2019-11-19 23:42:12,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:12,468 INFO L93 Difference]: Finished difference Result 10205 states and 16328 transitions. [2019-11-19 23:42:12,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:12,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 307 [2019-11-19 23:42:12,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:12,475 INFO L225 Difference]: With dead ends: 10205 [2019-11-19 23:42:12,475 INFO L226 Difference]: Without dead ends: 5406 [2019-11-19 23:42:12,481 INFO L630 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-19 23:42:12,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5406 states. [2019-11-19 23:42:12,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5406 to 4818. [2019-11-19 23:42:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4818 states. [2019-11-19 23:42:12,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 7759 transitions. [2019-11-19 23:42:12,620 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 7759 transitions. Word has length 307 [2019-11-19 23:42:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:12,620 INFO L462 AbstractCegarLoop]: Abstraction has 4818 states and 7759 transitions. [2019-11-19 23:42:12,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 7759 transitions. [2019-11-19 23:42:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-19 23:42:12,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:12,628 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:12,629 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:12,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:12,629 INFO L82 PathProgramCache]: Analyzing trace with hash 206079606, now seen corresponding path program 1 times [2019-11-19 23:42:12,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:12,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627818734] [2019-11-19 23:42:12,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 489 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:12,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627818734] [2019-11-19 23:42:12,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:12,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:12,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721192003] [2019-11-19 23:42:12,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:12,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:12,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:12,785 INFO L87 Difference]: Start difference. First operand 4818 states and 7759 transitions. Second operand 4 states. [2019-11-19 23:42:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:13,399 INFO L93 Difference]: Finished difference Result 10145 states and 16188 transitions. [2019-11-19 23:42:13,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:13,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-11-19 23:42:13,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:13,406 INFO L225 Difference]: With dead ends: 10145 [2019-11-19 23:42:13,406 INFO L226 Difference]: Without dead ends: 5346 [2019-11-19 23:42:13,411 INFO L630 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-19 23:42:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2019-11-19 23:42:13,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 4818. [2019-11-19 23:42:13,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4818 states. [2019-11-19 23:42:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 7725 transitions. [2019-11-19 23:42:13,565 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 7725 transitions. Word has length 308 [2019-11-19 23:42:13,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:13,566 INFO L462 AbstractCegarLoop]: Abstraction has 4818 states and 7725 transitions. [2019-11-19 23:42:13,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 7725 transitions. [2019-11-19 23:42:13,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-19 23:42:13,575 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:13,575 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:13,575 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash 305172060, now seen corresponding path program 1 times [2019-11-19 23:42:13,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:13,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602990422] [2019-11-19 23:42:13,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:13,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:13,752 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 547 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:13,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602990422] [2019-11-19 23:42:13,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:13,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:13,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274682324] [2019-11-19 23:42:13,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:13,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:13,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:13,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:13,754 INFO L87 Difference]: Start difference. First operand 4818 states and 7725 transitions. Second operand 4 states. [2019-11-19 23:42:14,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:14,349 INFO L93 Difference]: Finished difference Result 10145 states and 16120 transitions. [2019-11-19 23:42:14,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:14,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2019-11-19 23:42:14,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:14,354 INFO L225 Difference]: With dead ends: 10145 [2019-11-19 23:42:14,355 INFO L226 Difference]: Without dead ends: 5346 [2019-11-19 23:42:14,359 INFO L630 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-19 23:42:14,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5346 states. [2019-11-19 23:42:14,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5346 to 4818. [2019-11-19 23:42:14,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4818 states. [2019-11-19 23:42:14,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 7701 transitions. [2019-11-19 23:42:14,539 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 7701 transitions. Word has length 312 [2019-11-19 23:42:14,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:14,539 INFO L462 AbstractCegarLoop]: Abstraction has 4818 states and 7701 transitions. [2019-11-19 23:42:14,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:14,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 7701 transitions. [2019-11-19 23:42:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2019-11-19 23:42:14,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:14,547 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 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, 1, 1] [2019-11-19 23:42:14,547 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:14,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1987048362, now seen corresponding path program 1 times [2019-11-19 23:42:14,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:14,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626429320] [2019-11-19 23:42:14,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 546 proven. 82 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-11-19 23:42:14,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626429320] [2019-11-19 23:42:14,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479442841] [2019-11-19 23:42:14,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:42:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:15,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 1056 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:42:15,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:42:15,139 INFO L377 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-19 23:42:15,140 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:15,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:15,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:15,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-19 23:42:15,172 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-11-19 23:42:15,172 INFO L377 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-19 23:42:15,173 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:15,178 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:15,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:15,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:19 [2019-11-19 23:42:15,199 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:42:15,200 INFO L377 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-19 23:42:15,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:15,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:15,208 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-19 23:42:15,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:42:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 857 backedges. 523 proven. 46 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-19 23:42:15,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:42:15,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-19 23:42:15,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860584176] [2019-11-19 23:42:15,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 23:42:15,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:15,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 23:42:15,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:42:15,307 INFO L87 Difference]: Start difference. First operand 4818 states and 7701 transitions. Second operand 11 states. [2019-11-19 23:42:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:17,030 INFO L93 Difference]: Finished difference Result 11845 states and 18664 transitions. [2019-11-19 23:42:17,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:42:17,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 312 [2019-11-19 23:42:17,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:17,037 INFO L225 Difference]: With dead ends: 11845 [2019-11-19 23:42:17,037 INFO L226 Difference]: Without dead ends: 7046 [2019-11-19 23:42:17,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 310 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-19 23:42:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7046 states. [2019-11-19 23:42:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7046 to 5334. [2019-11-19 23:42:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5334 states. [2019-11-19 23:42:17,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 8541 transitions. [2019-11-19 23:42:17,188 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 8541 transitions. Word has length 312 [2019-11-19 23:42:17,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:17,188 INFO L462 AbstractCegarLoop]: Abstraction has 5334 states and 8541 transitions. [2019-11-19 23:42:17,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 23:42:17,188 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8541 transitions. [2019-11-19 23:42:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-11-19 23:42:17,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:17,194 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 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, 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-19 23:42:17,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:42:17,395 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:17,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1283111277, now seen corresponding path program 1 times [2019-11-19 23:42:17,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:17,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306434296] [2019-11-19 23:42:17,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 856 backedges. 553 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:17,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306434296] [2019-11-19 23:42:17,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:17,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:17,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559978792] [2019-11-19 23:42:17,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:17,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:17,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:17,567 INFO L87 Difference]: Start difference. First operand 5334 states and 8541 transitions. Second operand 4 states. [2019-11-19 23:42:18,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:18,147 INFO L93 Difference]: Finished difference Result 11129 states and 17682 transitions. [2019-11-19 23:42:18,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:18,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2019-11-19 23:42:18,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:18,153 INFO L225 Difference]: With dead ends: 11129 [2019-11-19 23:42:18,154 INFO L226 Difference]: Without dead ends: 5814 [2019-11-19 23:42:18,158 INFO L630 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-19 23:42:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5814 states. [2019-11-19 23:42:18,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5814 to 5334. [2019-11-19 23:42:18,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5334 states. [2019-11-19 23:42:18,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5334 states to 5334 states and 8517 transitions. [2019-11-19 23:42:18,351 INFO L78 Accepts]: Start accepts. Automaton has 5334 states and 8517 transitions. Word has length 313 [2019-11-19 23:42:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:18,351 INFO L462 AbstractCegarLoop]: Abstraction has 5334 states and 8517 transitions. [2019-11-19 23:42:18,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 5334 states and 8517 transitions. [2019-11-19 23:42:18,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-11-19 23:42:18,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:18,356 INFO L410 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:18,356 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:18,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:18,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1517486763, now seen corresponding path program 1 times [2019-11-19 23:42:18,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:18,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791827262] [2019-11-19 23:42:18,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-11-19 23:42:18,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791827262] [2019-11-19 23:42:18,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:18,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:18,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032969834] [2019-11-19 23:42:18,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:18,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:18,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:18,526 INFO L87 Difference]: Start difference. First operand 5334 states and 8517 transitions. Second operand 4 states. [2019-11-19 23:42:19,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:19,175 INFO L93 Difference]: Finished difference Result 11045 states and 17616 transitions. [2019-11-19 23:42:19,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:19,176 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 316 [2019-11-19 23:42:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:19,183 INFO L225 Difference]: With dead ends: 11045 [2019-11-19 23:42:19,183 INFO L226 Difference]: Without dead ends: 5730 [2019-11-19 23:42:19,188 INFO L630 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-19 23:42:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2019-11-19 23:42:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5514. [2019-11-19 23:42:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2019-11-19 23:42:19,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 8829 transitions. [2019-11-19 23:42:19,343 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 8829 transitions. Word has length 316 [2019-11-19 23:42:19,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:19,344 INFO L462 AbstractCegarLoop]: Abstraction has 5514 states and 8829 transitions. [2019-11-19 23:42:19,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 8829 transitions. [2019-11-19 23:42:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-19 23:42:19,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:19,349 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:19,349 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash 553905408, now seen corresponding path program 1 times [2019-11-19 23:42:19,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:19,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051552799] [2019-11-19 23:42:19,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:19,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:19,517 INFO L134 CoverageAnalysis]: Checked inductivity of 862 backedges. 537 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-11-19 23:42:19,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051552799] [2019-11-19 23:42:19,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:19,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:19,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443059825] [2019-11-19 23:42:19,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:19,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:19,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:19,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:19,519 INFO L87 Difference]: Start difference. First operand 5514 states and 8829 transitions. Second operand 4 states. [2019-11-19 23:42:20,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:20,213 INFO L93 Difference]: Finished difference Result 11489 states and 18258 transitions. [2019-11-19 23:42:20,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:20,213 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-19 23:42:20,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:20,218 INFO L225 Difference]: With dead ends: 11489 [2019-11-19 23:42:20,218 INFO L226 Difference]: Without dead ends: 5994 [2019-11-19 23:42:20,221 INFO L630 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-19 23:42:20,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5994 states. [2019-11-19 23:42:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5994 to 5514. [2019-11-19 23:42:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2019-11-19 23:42:20,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 8795 transitions. [2019-11-19 23:42:20,331 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 8795 transitions. Word has length 319 [2019-11-19 23:42:20,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:20,331 INFO L462 AbstractCegarLoop]: Abstraction has 5514 states and 8795 transitions. [2019-11-19 23:42:20,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:20,331 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 8795 transitions. [2019-11-19 23:42:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-19 23:42:20,335 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:20,336 INFO L410 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, 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, 1] [2019-11-19 23:42:20,336 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1029152169, now seen corresponding path program 1 times [2019-11-19 23:42:20,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:20,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544061552] [2019-11-19 23:42:20,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 602 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2019-11-19 23:42:20,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544061552] [2019-11-19 23:42:20,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:20,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:20,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30010610] [2019-11-19 23:42:20,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:20,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:20,515 INFO L87 Difference]: Start difference. First operand 5514 states and 8795 transitions. Second operand 4 states. [2019-11-19 23:42:21,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:21,006 INFO L93 Difference]: Finished difference Result 11453 states and 18142 transitions. [2019-11-19 23:42:21,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:21,006 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 319 [2019-11-19 23:42:21,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:21,011 INFO L225 Difference]: With dead ends: 11453 [2019-11-19 23:42:21,012 INFO L226 Difference]: Without dead ends: 5958 [2019-11-19 23:42:21,014 INFO L630 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-19 23:42:21,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5958 states. [2019-11-19 23:42:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5958 to 4830. [2019-11-19 23:42:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4830 states. [2019-11-19 23:42:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4830 states to 4830 states and 7753 transitions. [2019-11-19 23:42:21,225 INFO L78 Accepts]: Start accepts. Automaton has 4830 states and 7753 transitions. Word has length 319 [2019-11-19 23:42:21,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:21,226 INFO L462 AbstractCegarLoop]: Abstraction has 4830 states and 7753 transitions. [2019-11-19 23:42:21,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4830 states and 7753 transitions. [2019-11-19 23:42:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-11-19 23:42:21,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:21,230 INFO L410 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, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:21,230 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:21,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1907341665, now seen corresponding path program 1 times [2019-11-19 23:42:21,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:21,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251360120] [2019-11-19 23:42:21,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:22,032 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2019-11-19 23:42:22,616 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 513 proven. 209 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-11-19 23:42:22,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251360120] [2019-11-19 23:42:22,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920377263] [2019-11-19 23:42:22,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:42:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:22,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 1068 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-19 23:42:22,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:42:22,934 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:22,934 INFO L377 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-19 23:42:22,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:22,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:22,997 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_163|], 2=[|v_#memory_$Pointer$.base_161|, |v_#memory_$Pointer$.base_160|]} [2019-11-19 23:42:23,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,009 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,013 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,055 INFO L377 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-19 23:42:23,056 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,083 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,090 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,101 INFO L377 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-19 23:42:23,102 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,151 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:42:23,151 INFO L377 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-19 23:42:23,152 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,174 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-19 23:42:23,174 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-11-19 23:42:23,230 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:42:23,231 INFO L377 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-19 23:42:23,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,239 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,239 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,239 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:42:23,275 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-11-19 23:42:23,276 INFO L377 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-19 23:42:23,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,289 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-11-19 23:42:23,301 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_162|], 12=[|v_#memory_$Pointer$.base_166|]} [2019-11-19 23:42:23,305 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-19 23:42:23,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,371 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-11-19 23:42:23,371 INFO L377 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-19 23:42:23,372 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-11-19 23:42:23,429 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_185|], 12=[|v_#memory_$Pointer$.base_167|]} [2019-11-19 23:42:23,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,438 INFO L377 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-19 23:42:23,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,465 INFO L377 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-19 23:42:23,466 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,477 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:72 [2019-11-19 23:42:23,515 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_186|], 12=[|v_#memory_$Pointer$.base_168|]} [2019-11-19 23:42:23,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,531 INFO L377 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-19 23:42:23,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,582 INFO L377 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-19 23:42:23,583 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,598 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,598 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:104, output treesize:81 [2019-11-19 23:42:23,645 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_160|], 6=[|v_#memory_$Pointer$.base_169|], 12=[|v_#memory_int_187|]} [2019-11-19 23:42:23,652 INFO L377 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-19 23:42:23,653 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-19 23:42:23,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:42:23,690 INFO L377 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-19 23:42:23,690 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-19 23:42:23,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,711 INFO L343 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-19 23:42:23,711 INFO L377 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-19 23:42:23,712 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,720 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:29 [2019-11-19 23:42:23,771 INFO L343 Elim1Store]: treesize reduction 120, result has 13.7 percent of original size [2019-11-19 23:42:23,771 INFO L377 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-19 23:42:23,771 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,777 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:29 [2019-11-19 23:42:23,807 INFO L377 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-19 23:42:23,821 INFO L343 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-19 23:42:23,822 INFO L377 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-19 23:42:23,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:42:23,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-19 23:42:23,831 INFO L567 ElimStorePlain]: treesize reduction 21, result has 16.0 percent of original size [2019-11-19 23:42:23,832 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:23,836 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:23,836 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-19 23:42:23,836 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:4 [2019-11-19 23:42:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 513 proven. 64 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-19 23:42:24,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:42:24,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2019-11-19 23:42:24,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956489930] [2019-11-19 23:42:24,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 23:42:24,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:24,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 23:42:24,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-11-19 23:42:24,160 INFO L87 Difference]: Start difference. First operand 4830 states and 7753 transitions. Second operand 22 states. [2019-11-19 23:42:38,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:38,704 INFO L93 Difference]: Finished difference Result 42203 states and 65642 transitions. [2019-11-19 23:42:38,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-11-19 23:42:38,705 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 319 [2019-11-19 23:42:38,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:38,737 INFO L225 Difference]: With dead ends: 42203 [2019-11-19 23:42:38,738 INFO L226 Difference]: Without dead ends: 37368 [2019-11-19 23:42:38,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 331 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3800 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1769, Invalid=8533, Unknown=0, NotChecked=0, Total=10302 [2019-11-19 23:42:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37368 states. [2019-11-19 23:42:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37368 to 25888. [2019-11-19 23:42:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25888 states. [2019-11-19 23:42:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25888 states to 25888 states and 41667 transitions. [2019-11-19 23:42:39,486 INFO L78 Accepts]: Start accepts. Automaton has 25888 states and 41667 transitions. Word has length 319 [2019-11-19 23:42:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:39,486 INFO L462 AbstractCegarLoop]: Abstraction has 25888 states and 41667 transitions. [2019-11-19 23:42:39,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 23:42:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 25888 states and 41667 transitions. [2019-11-19 23:42:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-19 23:42:39,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:39,504 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1] [2019-11-19 23:42:39,709 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:42:39,709 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:39,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:39,710 INFO L82 PathProgramCache]: Analyzing trace with hash -63842989, now seen corresponding path program 1 times [2019-11-19 23:42:39,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:39,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735127621] [2019-11-19 23:42:39,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:39,853 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 439 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-19 23:42:39,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735127621] [2019-11-19 23:42:39,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:39,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:39,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280074812] [2019-11-19 23:42:39,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:39,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:39,855 INFO L87 Difference]: Start difference. First operand 25888 states and 41667 transitions. Second operand 4 states. [2019-11-19 23:42:40,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:40,997 INFO L93 Difference]: Finished difference Result 44437 states and 71144 transitions. [2019-11-19 23:42:40,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:40,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 335 [2019-11-19 23:42:40,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:41,023 INFO L225 Difference]: With dead ends: 44437 [2019-11-19 23:42:41,024 INFO L226 Difference]: Without dead ends: 28278 [2019-11-19 23:42:41,037 INFO L630 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-19 23:42:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28278 states. [2019-11-19 23:42:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28278 to 26224. [2019-11-19 23:42:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26224 states. [2019-11-19 23:42:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26224 states to 26224 states and 42137 transitions. [2019-11-19 23:42:41,707 INFO L78 Accepts]: Start accepts. Automaton has 26224 states and 42137 transitions. Word has length 335 [2019-11-19 23:42:41,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:41,707 INFO L462 AbstractCegarLoop]: Abstraction has 26224 states and 42137 transitions. [2019-11-19 23:42:41,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 26224 states and 42137 transitions. [2019-11-19 23:42:41,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-19 23:42:41,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:41,730 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:41,730 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:41,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:41,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1904112786, now seen corresponding path program 1 times [2019-11-19 23:42:41,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:41,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907056330] [2019-11-19 23:42:41,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-19 23:42:41,852 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907056330] [2019-11-19 23:42:41,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:41,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:41,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529556039] [2019-11-19 23:42:41,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:41,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:41,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:41,854 INFO L87 Difference]: Start difference. First operand 26224 states and 42137 transitions. Second operand 4 states. [2019-11-19 23:42:42,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:42,883 INFO L93 Difference]: Finished difference Result 44629 states and 71382 transitions. [2019-11-19 23:42:42,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:42,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2019-11-19 23:42:42,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:42,910 INFO L225 Difference]: With dead ends: 44629 [2019-11-19 23:42:42,910 INFO L226 Difference]: Without dead ends: 28278 [2019-11-19 23:42:42,922 INFO L630 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-19 23:42:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28278 states. [2019-11-19 23:42:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28278 to 26252. [2019-11-19 23:42:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26252 states. [2019-11-19 23:42:43,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26252 states to 26252 states and 42159 transitions. [2019-11-19 23:42:43,741 INFO L78 Accepts]: Start accepts. Automaton has 26252 states and 42159 transitions. Word has length 336 [2019-11-19 23:42:43,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:43,741 INFO L462 AbstractCegarLoop]: Abstraction has 26252 states and 42159 transitions. [2019-11-19 23:42:43,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 26252 states and 42159 transitions. [2019-11-19 23:42:43,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-11-19 23:42:43,758 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:43,759 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:43,759 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:43,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:43,759 INFO L82 PathProgramCache]: Analyzing trace with hash 2070887608, now seen corresponding path program 1 times [2019-11-19 23:42:43,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:43,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364534971] [2019-11-19 23:42:43,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-19 23:42:43,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364534971] [2019-11-19 23:42:43,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:43,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:43,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731804148] [2019-11-19 23:42:43,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:43,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:43,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:43,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:43,910 INFO L87 Difference]: Start difference. First operand 26252 states and 42159 transitions. Second operand 4 states. [2019-11-19 23:42:44,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:44,929 INFO L93 Difference]: Finished difference Result 44645 states and 71364 transitions. [2019-11-19 23:42:44,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:44,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 337 [2019-11-19 23:42:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:44,960 INFO L225 Difference]: With dead ends: 44645 [2019-11-19 23:42:44,961 INFO L226 Difference]: Without dead ends: 28278 [2019-11-19 23:42:44,971 INFO L630 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-19 23:42:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28278 states. [2019-11-19 23:42:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28278 to 26280. [2019-11-19 23:42:45,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26280 states. [2019-11-19 23:42:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26280 states to 26280 states and 42181 transitions. [2019-11-19 23:42:45,633 INFO L78 Accepts]: Start accepts. Automaton has 26280 states and 42181 transitions. Word has length 337 [2019-11-19 23:42:45,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:45,633 INFO L462 AbstractCegarLoop]: Abstraction has 26280 states and 42181 transitions. [2019-11-19 23:42:45,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:45,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26280 states and 42181 transitions. [2019-11-19 23:42:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-19 23:42:45,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:45,648 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:45,648 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:45,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:45,648 INFO L82 PathProgramCache]: Analyzing trace with hash -2059339561, now seen corresponding path program 1 times [2019-11-19 23:42:45,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:45,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26545892] [2019-11-19 23:42:45,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2019-11-19 23:42:45,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26545892] [2019-11-19 23:42:45,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:45,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:45,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953295622] [2019-11-19 23:42:45,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:45,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:45,803 INFO L87 Difference]: Start difference. First operand 26280 states and 42181 transitions. Second operand 4 states. [2019-11-19 23:42:47,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:47,244 INFO L93 Difference]: Finished difference Result 44541 states and 71202 transitions. [2019-11-19 23:42:47,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:47,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 338 [2019-11-19 23:42:47,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:47,274 INFO L225 Difference]: With dead ends: 44541 [2019-11-19 23:42:47,274 INFO L226 Difference]: Without dead ends: 28158 [2019-11-19 23:42:47,284 INFO L630 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-19 23:42:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28158 states. [2019-11-19 23:42:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28158 to 26308. [2019-11-19 23:42:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26308 states. [2019-11-19 23:42:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26308 states to 26308 states and 42203 transitions. [2019-11-19 23:42:48,001 INFO L78 Accepts]: Start accepts. Automaton has 26308 states and 42203 transitions. Word has length 338 [2019-11-19 23:42:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:48,002 INFO L462 AbstractCegarLoop]: Abstraction has 26308 states and 42203 transitions. [2019-11-19 23:42:48,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 26308 states and 42203 transitions. [2019-11-19 23:42:48,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-11-19 23:42:48,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:48,019 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:48,019 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:48,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:48,020 INFO L82 PathProgramCache]: Analyzing trace with hash 607480877, now seen corresponding path program 1 times [2019-11-19 23:42:48,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:48,020 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100121574] [2019-11-19 23:42:48,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 995 backedges. 659 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-19 23:42:48,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100121574] [2019-11-19 23:42:48,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:48,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:42:48,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232978978] [2019-11-19 23:42:48,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:42:48,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:48,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:42:48,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:42:48,262 INFO L87 Difference]: Start difference. First operand 26308 states and 42203 transitions. Second operand 5 states. [2019-11-19 23:42:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:50,065 INFO L93 Difference]: Finished difference Result 59048 states and 94292 transitions. [2019-11-19 23:42:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:50,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 339 [2019-11-19 23:42:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:50,094 INFO L225 Difference]: With dead ends: 59048 [2019-11-19 23:42:50,095 INFO L226 Difference]: Without dead ends: 32759 [2019-11-19 23:42:50,108 INFO L630 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-19 23:42:50,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32759 states. [2019-11-19 23:42:51,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32759 to 29083. [2019-11-19 23:42:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29083 states. [2019-11-19 23:42:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29083 states to 29083 states and 46888 transitions. [2019-11-19 23:42:51,087 INFO L78 Accepts]: Start accepts. Automaton has 29083 states and 46888 transitions. Word has length 339 [2019-11-19 23:42:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:51,087 INFO L462 AbstractCegarLoop]: Abstraction has 29083 states and 46888 transitions. [2019-11-19 23:42:51,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:42:51,087 INFO L276 IsEmpty]: Start isEmpty. Operand 29083 states and 46888 transitions. [2019-11-19 23:42:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-11-19 23:42:51,106 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:51,107 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:51,107 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:51,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:51,107 INFO L82 PathProgramCache]: Analyzing trace with hash 739487859, now seen corresponding path program 1 times [2019-11-19 23:42:51,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:51,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435527831] [2019-11-19 23:42:51,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:51,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:51,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2019-11-19 23:42:51,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435527831] [2019-11-19 23:42:51,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:51,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:42:51,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793604318] [2019-11-19 23:42:51,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:42:51,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:51,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:42:51,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:42:51,350 INFO L87 Difference]: Start difference. First operand 29083 states and 46888 transitions. Second operand 5 states. [2019-11-19 23:42:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:52,923 INFO L93 Difference]: Finished difference Result 60793 states and 97343 transitions. [2019-11-19 23:42:52,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:52,924 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 340 [2019-11-19 23:42:52,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:52,954 INFO L225 Difference]: With dead ends: 60793 [2019-11-19 23:42:52,954 INFO L226 Difference]: Without dead ends: 31729 [2019-11-19 23:42:52,969 INFO L630 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-19 23:42:52,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31729 states. [2019-11-19 23:42:53,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31729 to 28959. [2019-11-19 23:42:53,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28959 states. [2019-11-19 23:42:53,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28959 states to 28959 states and 46470 transitions. [2019-11-19 23:42:53,747 INFO L78 Accepts]: Start accepts. Automaton has 28959 states and 46470 transitions. Word has length 340 [2019-11-19 23:42:53,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:53,748 INFO L462 AbstractCegarLoop]: Abstraction has 28959 states and 46470 transitions. [2019-11-19 23:42:53,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:42:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 28959 states and 46470 transitions. [2019-11-19 23:42:53,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-19 23:42:53,771 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:53,771 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1] [2019-11-19 23:42:53,771 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1966343475, now seen corresponding path program 1 times [2019-11-19 23:42:53,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:53,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887338714] [2019-11-19 23:42:53,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 500 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-11-19 23:42:53,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887338714] [2019-11-19 23:42:53,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:53,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:53,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078625210] [2019-11-19 23:42:53,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:53,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:53,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:53,966 INFO L87 Difference]: Start difference. First operand 28959 states and 46470 transitions. Second operand 4 states. [2019-11-19 23:42:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:55,528 INFO L93 Difference]: Finished difference Result 59693 states and 95610 transitions. [2019-11-19 23:42:55,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:55,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 348 [2019-11-19 23:42:55,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:55,554 INFO L225 Difference]: With dead ends: 59693 [2019-11-19 23:42:55,554 INFO L226 Difference]: Without dead ends: 30753 [2019-11-19 23:42:55,567 INFO L630 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-19 23:42:55,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30753 states. [2019-11-19 23:42:56,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30753 to 28987. [2019-11-19 23:42:56,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28987 states. [2019-11-19 23:42:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28987 states to 28987 states and 46492 transitions. [2019-11-19 23:42:56,242 INFO L78 Accepts]: Start accepts. Automaton has 28987 states and 46492 transitions. Word has length 348 [2019-11-19 23:42:56,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:56,242 INFO L462 AbstractCegarLoop]: Abstraction has 28987 states and 46492 transitions. [2019-11-19 23:42:56,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:56,243 INFO L276 IsEmpty]: Start isEmpty. Operand 28987 states and 46492 transitions. [2019-11-19 23:42:56,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-19 23:42:56,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:56,264 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 10, 10, 10, 10, 10, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 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, 1] [2019-11-19 23:42:56,264 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:56,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:56,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2146732206, now seen corresponding path program 2 times [2019-11-19 23:42:56,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:56,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815530774] [2019-11-19 23:42:56,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:56,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 509 proven. 0 refuted. 0 times theorem prover too weak. 557 trivial. 0 not checked. [2019-11-19 23:42:56,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815530774] [2019-11-19 23:42:56,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:42:56,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:42:56,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980023445] [2019-11-19 23:42:56,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:42:56,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:56,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:42:56,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:42:56,395 INFO L87 Difference]: Start difference. First operand 28987 states and 46492 transitions. Second operand 4 states. [2019-11-19 23:42:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:42:57,516 INFO L93 Difference]: Finished difference Result 59685 states and 95562 transitions. [2019-11-19 23:42:57,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:42:57,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 349 [2019-11-19 23:42:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:42:57,543 INFO L225 Difference]: With dead ends: 59685 [2019-11-19 23:42:57,543 INFO L226 Difference]: Without dead ends: 30717 [2019-11-19 23:42:57,556 INFO L630 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-19 23:42:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30717 states. [2019-11-19 23:42:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30717 to 29015. [2019-11-19 23:42:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29015 states. [2019-11-19 23:42:58,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29015 states to 29015 states and 46514 transitions. [2019-11-19 23:42:58,769 INFO L78 Accepts]: Start accepts. Automaton has 29015 states and 46514 transitions. Word has length 349 [2019-11-19 23:42:58,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:42:58,769 INFO L462 AbstractCegarLoop]: Abstraction has 29015 states and 46514 transitions. [2019-11-19 23:42:58,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:42:58,769 INFO L276 IsEmpty]: Start isEmpty. Operand 29015 states and 46514 transitions. [2019-11-19 23:42:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-11-19 23:42:58,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:42:58,789 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:42:58,789 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:42:58,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:42:58,790 INFO L82 PathProgramCache]: Analyzing trace with hash 719203398, now seen corresponding path program 1 times [2019-11-19 23:42:58,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:42:58,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61497322] [2019-11-19 23:42:58,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:42:58,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 657 proven. 28 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-11-19 23:42:58,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61497322] [2019-11-19 23:42:58,961 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071813596] [2019-11-19 23:42:58,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:42:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:42:59,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 1166 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:42:59,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:42:59,270 INFO L377 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-19 23:42:59,270 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:59,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:59,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:59,278 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-19 23:42:59,283 INFO L377 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 74 treesize of output 50 [2019-11-19 23:42:59,283 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-19 23:42:59,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:59,289 INFO L377 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 50 treesize of output 38 [2019-11-19 23:42:59,289 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-19 23:42:59,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:59,343 INFO L343 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-19 23:42:59,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-19 23:42:59,344 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:59,376 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-19 23:42:59,377 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:42:59,377 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-19 23:42:59,396 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:42:59,397 INFO L377 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-19 23:42:59,397 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:42:59,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:42:59,399 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-19 23:42:59,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:42:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1079 backedges. 657 proven. 28 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2019-11-19 23:42:59,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:42:59,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-19 23:42:59,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979217026] [2019-11-19 23:42:59,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:42:59,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:42:59,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:42:59,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:42:59,473 INFO L87 Difference]: Start difference. First operand 29015 states and 46514 transitions. Second operand 8 states. [2019-11-19 23:43:01,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:01,114 INFO L93 Difference]: Finished difference Result 48580 states and 77402 transitions. [2019-11-19 23:43:01,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:43:01,115 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 349 [2019-11-19 23:43:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:01,140 INFO L225 Difference]: With dead ends: 48580 [2019-11-19 23:43:01,140 INFO L226 Difference]: Without dead ends: 30374 [2019-11-19 23:43:01,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:43:01,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30374 states. [2019-11-19 23:43:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30374 to 29015. [2019-11-19 23:43:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29015 states. [2019-11-19 23:43:01,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29015 states to 29015 states and 46131 transitions. [2019-11-19 23:43:01,841 INFO L78 Accepts]: Start accepts. Automaton has 29015 states and 46131 transitions. Word has length 349 [2019-11-19 23:43:01,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:01,842 INFO L462 AbstractCegarLoop]: Abstraction has 29015 states and 46131 transitions. [2019-11-19 23:43:01,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:43:01,842 INFO L276 IsEmpty]: Start isEmpty. Operand 29015 states and 46131 transitions. [2019-11-19 23:43:01,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-11-19 23:43:01,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:01,862 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:02,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:02,063 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:02,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:02,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1190595609, now seen corresponding path program 1 times [2019-11-19 23:43:02,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:02,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692408294] [2019-11-19 23:43:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 663 proven. 26 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-11-19 23:43:02,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692408294] [2019-11-19 23:43:02,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455430304] [2019-11-19 23:43:02,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:02,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:43:02,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:43:02,496 INFO L377 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-19 23:43:02,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:02,499 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-19 23:43:02,506 INFO L377 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 74 treesize of output 62 [2019-11-19 23:43:02,506 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-19 23:43:02,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:02,591 INFO L343 Elim1Store]: treesize reduction 77, result has 55.0 percent of original size [2019-11-19 23:43:02,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 103 [2019-11-19 23:43:02,592 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,642 INFO L567 ElimStorePlain]: treesize reduction 34, result has 67.0 percent of original size [2019-11-19 23:43:02,647 INFO L377 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 15 treesize of output 9 [2019-11-19 23:43:02,647 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:43:02,652 INFO L377 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 17 treesize of output 11 [2019-11-19 23:43:02,652 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,666 INFO L377 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 17 treesize of output 11 [2019-11-19 23:43:02,666 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:02,681 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,681 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-19 23:43:02,701 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:43:02,702 INFO L377 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-19 23:43:02,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:02,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:02,704 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-19 23:43:02,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:43:02,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 663 proven. 26 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2019-11-19 23:43:02,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:43:02,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-19 23:43:02,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109602144] [2019-11-19 23:43:02,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:43:02,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:02,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:43:02,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:43:02,820 INFO L87 Difference]: Start difference. First operand 29015 states and 46131 transitions. Second operand 8 states. [2019-11-19 23:43:05,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:05,245 INFO L93 Difference]: Finished difference Result 48580 states and 76787 transitions. [2019-11-19 23:43:05,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:43:05,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 350 [2019-11-19 23:43:05,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:05,272 INFO L225 Difference]: With dead ends: 48580 [2019-11-19 23:43:05,272 INFO L226 Difference]: Without dead ends: 30374 [2019-11-19 23:43:05,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:43:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30374 states. [2019-11-19 23:43:05,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30374 to 29015. [2019-11-19 23:43:05,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29015 states. [2019-11-19 23:43:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29015 states to 29015 states and 45748 transitions. [2019-11-19 23:43:05,976 INFO L78 Accepts]: Start accepts. Automaton has 29015 states and 45748 transitions. Word has length 350 [2019-11-19 23:43:05,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:05,977 INFO L462 AbstractCegarLoop]: Abstraction has 29015 states and 45748 transitions. [2019-11-19 23:43:05,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:43:05,977 INFO L276 IsEmpty]: Start isEmpty. Operand 29015 states and 45748 transitions. [2019-11-19 23:43:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-11-19 23:43:05,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:05,998 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:06,198 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:06,198 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:06,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:06,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1022734785, now seen corresponding path program 1 times [2019-11-19 23:43:06,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:06,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842226108] [2019-11-19 23:43:06,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 669 proven. 24 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-19 23:43:06,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842226108] [2019-11-19 23:43:06,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853256783] [2019-11-19 23:43:06,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:06,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:43:06,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:43:06,683 INFO L377 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-19 23:43:06,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:06,686 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:06,686 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:43:06,686 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-19 23:43:06,692 INFO L377 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 74 treesize of output 62 [2019-11-19 23:43:06,692 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-19 23:43:06,695 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:06,697 INFO L377 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 62 treesize of output 38 [2019-11-19 23:43:06,697 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-19 23:43:06,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:06,749 INFO L343 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-19 23:43:06,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-19 23:43:06,750 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:06,783 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-19 23:43:06,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:43:06,784 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-19 23:43:06,803 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:43:06,803 INFO L377 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-19 23:43:06,804 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:06,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:06,805 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-19 23:43:06,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:43:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 669 proven. 24 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-11-19 23:43:06,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:43:06,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-19 23:43:06,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882632309] [2019-11-19 23:43:06,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:43:06,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:06,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:43:06,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:43:06,881 INFO L87 Difference]: Start difference. First operand 29015 states and 45748 transitions. Second operand 8 states. [2019-11-19 23:43:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:08,575 INFO L93 Difference]: Finished difference Result 48580 states and 76172 transitions. [2019-11-19 23:43:08,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:43:08,575 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 351 [2019-11-19 23:43:08,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:08,605 INFO L225 Difference]: With dead ends: 48580 [2019-11-19 23:43:08,605 INFO L226 Difference]: Without dead ends: 30374 [2019-11-19 23:43:08,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:43:08,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30374 states. [2019-11-19 23:43:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30374 to 29015. [2019-11-19 23:43:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29015 states. [2019-11-19 23:43:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29015 states to 29015 states and 45365 transitions. [2019-11-19 23:43:09,835 INFO L78 Accepts]: Start accepts. Automaton has 29015 states and 45365 transitions. Word has length 351 [2019-11-19 23:43:09,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:09,835 INFO L462 AbstractCegarLoop]: Abstraction has 29015 states and 45365 transitions. [2019-11-19 23:43:09,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:43:09,835 INFO L276 IsEmpty]: Start isEmpty. Operand 29015 states and 45365 transitions. [2019-11-19 23:43:09,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-11-19 23:43:09,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:09,857 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:10,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:10,058 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1782100940, now seen corresponding path program 1 times [2019-11-19 23:43:10,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:10,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803552875] [2019-11-19 23:43:10,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:10,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 675 proven. 22 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-19 23:43:10,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803552875] [2019-11-19 23:43:10,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793961409] [2019-11-19 23:43:10,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:10,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 1175 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:43:10,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:43:10,545 INFO L377 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-19 23:43:10,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:10,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:10,547 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:43:10,547 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-19 23:43:10,553 INFO L377 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 74 treesize of output 62 [2019-11-19 23:43:10,554 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-19 23:43:10,557 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:10,558 INFO L377 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 62 treesize of output 38 [2019-11-19 23:43:10,559 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-19 23:43:10,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:10,612 INFO L343 Elim1Store]: treesize reduction 59, result has 52.0 percent of original size [2019-11-19 23:43:10,613 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 73 [2019-11-19 23:43:10,613 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:10,645 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.9 percent of original size [2019-11-19 23:43:10,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:43:10,646 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:19 [2019-11-19 23:43:10,670 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-11-19 23:43:10,670 INFO L377 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-19 23:43:10,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:43:10,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:43:10,673 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-19 23:43:10,673 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2019-11-19 23:43:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1109 backedges. 675 proven. 22 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2019-11-19 23:43:10,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:43:10,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2019-11-19 23:43:10,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021396959] [2019-11-19 23:43:10,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 23:43:10,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:10,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 23:43:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:43:10,779 INFO L87 Difference]: Start difference. First operand 29015 states and 45365 transitions. Second operand 8 states. [2019-11-19 23:43:12,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:12,328 INFO L93 Difference]: Finished difference Result 48340 states and 75269 transitions. [2019-11-19 23:43:12,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 23:43:12,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 352 [2019-11-19 23:43:12,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:12,353 INFO L225 Difference]: With dead ends: 48340 [2019-11-19 23:43:12,353 INFO L226 Difference]: Without dead ends: 30134 [2019-11-19 23:43:12,363 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 353 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:43:12,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30134 states. [2019-11-19 23:43:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30134 to 29015. [2019-11-19 23:43:13,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29015 states. [2019-11-19 23:43:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29015 states to 29015 states and 44982 transitions. [2019-11-19 23:43:13,083 INFO L78 Accepts]: Start accepts. Automaton has 29015 states and 44982 transitions. Word has length 352 [2019-11-19 23:43:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:13,084 INFO L462 AbstractCegarLoop]: Abstraction has 29015 states and 44982 transitions. [2019-11-19 23:43:13,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 23:43:13,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29015 states and 44982 transitions. [2019-11-19 23:43:13,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2019-11-19 23:43:13,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:13,101 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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-19 23:43:13,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:43:13,302 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:13,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:13,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1622571135, now seen corresponding path program 1 times [2019-11-19 23:43:13,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:13,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278153815] [2019-11-19 23:43:13,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:13,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1251 backedges. 558 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:13,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278153815] [2019-11-19 23:43:13,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:13,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:13,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97705636] [2019-11-19 23:43:13,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:13,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:13,434 INFO L87 Difference]: Start difference. First operand 29015 states and 44982 transitions. Second operand 4 states. [2019-11-19 23:43:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:14,522 INFO L93 Difference]: Finished difference Result 59685 states and 92458 transitions. [2019-11-19 23:43:14,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:14,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2019-11-19 23:43:14,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:14,562 INFO L225 Difference]: With dead ends: 59685 [2019-11-19 23:43:14,563 INFO L226 Difference]: Without dead ends: 30689 [2019-11-19 23:43:14,577 INFO L630 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-19 23:43:14,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30689 states. [2019-11-19 23:43:15,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30689 to 29043. [2019-11-19 23:43:15,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29043 states. [2019-11-19 23:43:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29043 states to 29043 states and 45004 transitions. [2019-11-19 23:43:15,822 INFO L78 Accepts]: Start accepts. Automaton has 29043 states and 45004 transitions. Word has length 362 [2019-11-19 23:43:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:15,822 INFO L462 AbstractCegarLoop]: Abstraction has 29043 states and 45004 transitions. [2019-11-19 23:43:15,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 29043 states and 45004 transitions. [2019-11-19 23:43:15,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-11-19 23:43:15,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:15,842 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:15,843 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:15,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1205214744, now seen corresponding path program 1 times [2019-11-19 23:43:15,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:15,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516725053] [2019-11-19 23:43:15,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1328 backedges. 635 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:15,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516725053] [2019-11-19 23:43:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:15,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722707474] [2019-11-19 23:43:15,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:15,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:15,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:15,973 INFO L87 Difference]: Start difference. First operand 29043 states and 45004 transitions. Second operand 4 states. [2019-11-19 23:43:17,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:17,065 INFO L93 Difference]: Finished difference Result 59677 states and 92392 transitions. [2019-11-19 23:43:17,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:17,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-11-19 23:43:17,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:17,091 INFO L225 Difference]: With dead ends: 59677 [2019-11-19 23:43:17,091 INFO L226 Difference]: Without dead ends: 30653 [2019-11-19 23:43:17,104 INFO L630 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-19 23:43:17,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30653 states. [2019-11-19 23:43:17,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30653 to 29295. [2019-11-19 23:43:17,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29295 states. [2019-11-19 23:43:17,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29295 states to 29295 states and 45446 transitions. [2019-11-19 23:43:17,829 INFO L78 Accepts]: Start accepts. Automaton has 29295 states and 45446 transitions. Word has length 377 [2019-11-19 23:43:17,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:17,829 INFO L462 AbstractCegarLoop]: Abstraction has 29295 states and 45446 transitions. [2019-11-19 23:43:17,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:17,829 INFO L276 IsEmpty]: Start isEmpty. Operand 29295 states and 45446 transitions. [2019-11-19 23:43:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2019-11-19 23:43:17,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:17,851 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:17,851 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:17,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:17,851 INFO L82 PathProgramCache]: Analyzing trace with hash -814001707, now seen corresponding path program 1 times [2019-11-19 23:43:17,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:17,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882821541] [2019-11-19 23:43:17,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:17,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 788 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2019-11-19 23:43:17,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882821541] [2019-11-19 23:43:17,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:17,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:17,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888268064] [2019-11-19 23:43:17,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:17,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:17,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:17,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:17,989 INFO L87 Difference]: Start difference. First operand 29295 states and 45446 transitions. Second operand 4 states. [2019-11-19 23:43:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:19,226 INFO L93 Difference]: Finished difference Result 60427 states and 93294 transitions. [2019-11-19 23:43:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:19,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 377 [2019-11-19 23:43:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:19,252 INFO L225 Difference]: With dead ends: 60427 [2019-11-19 23:43:19,253 INFO L226 Difference]: Without dead ends: 31151 [2019-11-19 23:43:19,266 INFO L630 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-19 23:43:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31151 states. [2019-11-19 23:43:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31151 to 29295. [2019-11-19 23:43:19,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29295 states. [2019-11-19 23:43:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29295 states to 29295 states and 45371 transitions. [2019-11-19 23:43:19,997 INFO L78 Accepts]: Start accepts. Automaton has 29295 states and 45371 transitions. Word has length 377 [2019-11-19 23:43:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:19,997 INFO L462 AbstractCegarLoop]: Abstraction has 29295 states and 45371 transitions. [2019-11-19 23:43:19,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 29295 states and 45371 transitions. [2019-11-19 23:43:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-19 23:43:20,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:20,020 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:20,020 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1497182654, now seen corresponding path program 1 times [2019-11-19 23:43:20,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:20,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254102042] [2019-11-19 23:43:20,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:20,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254102042] [2019-11-19 23:43:20,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:20,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:20,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360842495] [2019-11-19 23:43:20,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:20,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:20,148 INFO L87 Difference]: Start difference. First operand 29295 states and 45371 transitions. Second operand 4 states. [2019-11-19 23:43:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:21,661 INFO L93 Difference]: Finished difference Result 60461 states and 93260 transitions. [2019-11-19 23:43:21,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:21,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2019-11-19 23:43:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:21,689 INFO L225 Difference]: With dead ends: 60461 [2019-11-19 23:43:21,689 INFO L226 Difference]: Without dead ends: 31185 [2019-11-19 23:43:21,703 INFO L630 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-19 23:43:21,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31185 states. [2019-11-19 23:43:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31185 to 29295. [2019-11-19 23:43:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29295 states. [2019-11-19 23:43:22,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29295 states to 29295 states and 45303 transitions. [2019-11-19 23:43:22,449 INFO L78 Accepts]: Start accepts. Automaton has 29295 states and 45303 transitions. Word has length 378 [2019-11-19 23:43:22,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:22,449 INFO L462 AbstractCegarLoop]: Abstraction has 29295 states and 45303 transitions. [2019-11-19 23:43:22,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:22,449 INFO L276 IsEmpty]: Start isEmpty. Operand 29295 states and 45303 transitions. [2019-11-19 23:43:22,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-19 23:43:22,470 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:22,470 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:22,470 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash -830737218, now seen corresponding path program 1 times [2019-11-19 23:43:22,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:22,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608621239] [2019-11-19 23:43:22,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 789 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-19 23:43:22,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608621239] [2019-11-19 23:43:22,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:22,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:22,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245715553] [2019-11-19 23:43:22,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:22,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:22,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:22,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:22,602 INFO L87 Difference]: Start difference. First operand 29295 states and 45303 transitions. Second operand 4 states. [2019-11-19 23:43:23,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:23,700 INFO L93 Difference]: Finished difference Result 60643 states and 93709 transitions. [2019-11-19 23:43:23,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:23,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2019-11-19 23:43:23,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:23,728 INFO L225 Difference]: With dead ends: 60643 [2019-11-19 23:43:23,728 INFO L226 Difference]: Without dead ends: 31367 [2019-11-19 23:43:23,743 INFO L630 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-19 23:43:23,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31367 states. [2019-11-19 23:43:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31367 to 30428. [2019-11-19 23:43:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30428 states. [2019-11-19 23:43:24,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30428 states to 30428 states and 47087 transitions. [2019-11-19 23:43:24,502 INFO L78 Accepts]: Start accepts. Automaton has 30428 states and 47087 transitions. Word has length 378 [2019-11-19 23:43:24,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:24,503 INFO L462 AbstractCegarLoop]: Abstraction has 30428 states and 47087 transitions. [2019-11-19 23:43:24,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:24,503 INFO L276 IsEmpty]: Start isEmpty. Operand 30428 states and 47087 transitions. [2019-11-19 23:43:24,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-11-19 23:43:24,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:24,525 INFO L410 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, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:24,525 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -716934071, now seen corresponding path program 1 times [2019-11-19 23:43:24,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:24,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060092456] [2019-11-19 23:43:24,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:24,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:24,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060092456] [2019-11-19 23:43:24,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:24,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:24,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360722916] [2019-11-19 23:43:24,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:24,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:24,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:24,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:24,674 INFO L87 Difference]: Start difference. First operand 30428 states and 47087 transitions. Second operand 4 states. [2019-11-19 23:43:26,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:26,059 INFO L93 Difference]: Finished difference Result 62195 states and 96082 transitions. [2019-11-19 23:43:26,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:26,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 378 [2019-11-19 23:43:26,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:26,083 INFO L225 Difference]: With dead ends: 62195 [2019-11-19 23:43:26,083 INFO L226 Difference]: Without dead ends: 31786 [2019-11-19 23:43:26,093 INFO L630 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-19 23:43:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31786 states. [2019-11-19 23:43:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31786 to 30456. [2019-11-19 23:43:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30456 states. [2019-11-19 23:43:26,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30456 states to 30456 states and 47109 transitions. [2019-11-19 23:43:26,825 INFO L78 Accepts]: Start accepts. Automaton has 30456 states and 47109 transitions. Word has length 378 [2019-11-19 23:43:26,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:26,825 INFO L462 AbstractCegarLoop]: Abstraction has 30456 states and 47109 transitions. [2019-11-19 23:43:26,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:26,825 INFO L276 IsEmpty]: Start isEmpty. Operand 30456 states and 47109 transitions. [2019-11-19 23:43:26,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-19 23:43:26,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:26,846 INFO L410 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, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:26,846 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:26,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:26,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1356325206, now seen corresponding path program 1 times [2019-11-19 23:43:26,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:26,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052674416] [2019-11-19 23:43:26,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1344 backedges. 651 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:26,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052674416] [2019-11-19 23:43:26,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:26,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:26,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678323530] [2019-11-19 23:43:26,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:26,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:26,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:26,964 INFO L87 Difference]: Start difference. First operand 30456 states and 47109 transitions. Second operand 4 states. [2019-11-19 23:43:28,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:28,014 INFO L93 Difference]: Finished difference Result 62079 states and 95836 transitions. [2019-11-19 23:43:28,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:28,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-19 23:43:28,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:28,040 INFO L225 Difference]: With dead ends: 62079 [2019-11-19 23:43:28,041 INFO L226 Difference]: Without dead ends: 31642 [2019-11-19 23:43:28,053 INFO L630 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-19 23:43:28,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31642 states. [2019-11-19 23:43:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31642 to 30484. [2019-11-19 23:43:28,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30484 states. [2019-11-19 23:43:28,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30484 states to 30484 states and 47131 transitions. [2019-11-19 23:43:28,806 INFO L78 Accepts]: Start accepts. Automaton has 30484 states and 47131 transitions. Word has length 379 [2019-11-19 23:43:28,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:28,806 INFO L462 AbstractCegarLoop]: Abstraction has 30484 states and 47131 transitions. [2019-11-19 23:43:28,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:28,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30484 states and 47131 transitions. [2019-11-19 23:43:28,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-19 23:43:28,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:28,828 INFO L410 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, 7, 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, 1, 1] [2019-11-19 23:43:28,828 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:28,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:28,829 INFO L82 PathProgramCache]: Analyzing trace with hash 33214564, now seen corresponding path program 1 times [2019-11-19 23:43:28,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:28,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545138044] [2019-11-19 23:43:28,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:28,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1374 backedges. 681 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:28,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545138044] [2019-11-19 23:43:28,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:28,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:28,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64504149] [2019-11-19 23:43:28,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:28,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:28,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:28,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:28,983 INFO L87 Difference]: Start difference. First operand 30484 states and 47131 transitions. Second operand 4 states. [2019-11-19 23:43:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:30,076 INFO L93 Difference]: Finished difference Result 62107 states and 95824 transitions. [2019-11-19 23:43:30,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:30,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-19 23:43:30,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:30,103 INFO L225 Difference]: With dead ends: 62107 [2019-11-19 23:43:30,103 INFO L226 Difference]: Without dead ends: 31642 [2019-11-19 23:43:30,117 INFO L630 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-19 23:43:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31642 states. [2019-11-19 23:43:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31642 to 30596. [2019-11-19 23:43:31,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30596 states. [2019-11-19 23:43:31,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30596 states to 30596 states and 47309 transitions. [2019-11-19 23:43:31,049 INFO L78 Accepts]: Start accepts. Automaton has 30596 states and 47309 transitions. Word has length 379 [2019-11-19 23:43:31,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:31,049 INFO L462 AbstractCegarLoop]: Abstraction has 30596 states and 47309 transitions. [2019-11-19 23:43:31,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 30596 states and 47309 transitions. [2019-11-19 23:43:31,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-19 23:43:31,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:31,071 INFO L410 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, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:31,071 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:31,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:31,071 INFO L82 PathProgramCache]: Analyzing trace with hash -206548541, now seen corresponding path program 1 times [2019-11-19 23:43:31,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:31,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761299796] [2019-11-19 23:43:31,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:31,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:31,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 844 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-19 23:43:31,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761299796] [2019-11-19 23:43:31,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:31,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:31,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782462513] [2019-11-19 23:43:31,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:31,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:31,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:31,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:31,216 INFO L87 Difference]: Start difference. First operand 30596 states and 47309 transitions. Second operand 4 states. [2019-11-19 23:43:32,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:32,469 INFO L93 Difference]: Finished difference Result 63029 states and 97020 transitions. [2019-11-19 23:43:32,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:32,469 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-19 23:43:32,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:32,498 INFO L225 Difference]: With dead ends: 63029 [2019-11-19 23:43:32,498 INFO L226 Difference]: Without dead ends: 32452 [2019-11-19 23:43:32,513 INFO L630 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-19 23:43:32,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32452 states. [2019-11-19 23:43:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32452 to 30596. [2019-11-19 23:43:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30596 states. [2019-11-19 23:43:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30596 states to 30596 states and 47234 transitions. [2019-11-19 23:43:33,280 INFO L78 Accepts]: Start accepts. Automaton has 30596 states and 47234 transitions. Word has length 379 [2019-11-19 23:43:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:33,280 INFO L462 AbstractCegarLoop]: Abstraction has 30596 states and 47234 transitions. [2019-11-19 23:43:33,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 30596 states and 47234 transitions. [2019-11-19 23:43:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-11-19 23:43:33,302 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:33,303 INFO L410 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, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:33,303 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:33,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:33,303 INFO L82 PathProgramCache]: Analyzing trace with hash 877250571, now seen corresponding path program 1 times [2019-11-19 23:43:33,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:33,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620716254] [2019-11-19 23:43:33,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:33,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 436 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:33,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620716254] [2019-11-19 23:43:33,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:33,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:33,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346405570] [2019-11-19 23:43:33,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:33,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:33,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:33,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:33,435 INFO L87 Difference]: Start difference. First operand 30596 states and 47234 transitions. Second operand 4 states. [2019-11-19 23:43:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:34,642 INFO L93 Difference]: Finished difference Result 63063 states and 96986 transitions. [2019-11-19 23:43:34,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:34,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 379 [2019-11-19 23:43:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:34,670 INFO L225 Difference]: With dead ends: 63063 [2019-11-19 23:43:34,670 INFO L226 Difference]: Without dead ends: 32486 [2019-11-19 23:43:34,685 INFO L630 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-19 23:43:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32486 states. [2019-11-19 23:43:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32486 to 30596. [2019-11-19 23:43:35,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30596 states. [2019-11-19 23:43:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30596 states to 30596 states and 47166 transitions. [2019-11-19 23:43:35,456 INFO L78 Accepts]: Start accepts. Automaton has 30596 states and 47166 transitions. Word has length 379 [2019-11-19 23:43:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:35,456 INFO L462 AbstractCegarLoop]: Abstraction has 30596 states and 47166 transitions. [2019-11-19 23:43:35,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:35,457 INFO L276 IsEmpty]: Start isEmpty. Operand 30596 states and 47166 transitions. [2019-11-19 23:43:35,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-19 23:43:35,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:35,481 INFO L410 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, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:35,481 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:35,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1355419012, now seen corresponding path program 1 times [2019-11-19 23:43:35,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:35,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185743918] [2019-11-19 23:43:35,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 444 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:35,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185743918] [2019-11-19 23:43:35,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:35,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:35,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643229320] [2019-11-19 23:43:35,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:35,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:35,770 INFO L87 Difference]: Start difference. First operand 30596 states and 47166 transitions. Second operand 4 states. [2019-11-19 23:43:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:36,891 INFO L93 Difference]: Finished difference Result 62796 states and 96413 transitions. [2019-11-19 23:43:36,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:36,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-11-19 23:43:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:36,918 INFO L225 Difference]: With dead ends: 62796 [2019-11-19 23:43:36,918 INFO L226 Difference]: Without dead ends: 32219 [2019-11-19 23:43:36,933 INFO L630 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-19 23:43:36,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32219 states. [2019-11-19 23:43:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32219 to 30596. [2019-11-19 23:43:37,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30596 states. [2019-11-19 23:43:37,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30596 states to 30596 states and 47098 transitions. [2019-11-19 23:43:37,697 INFO L78 Accepts]: Start accepts. Automaton has 30596 states and 47098 transitions. Word has length 380 [2019-11-19 23:43:37,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:37,698 INFO L462 AbstractCegarLoop]: Abstraction has 30596 states and 47098 transitions. [2019-11-19 23:43:37,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:37,698 INFO L276 IsEmpty]: Start isEmpty. Operand 30596 states and 47098 transitions. [2019-11-19 23:43:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-19 23:43:37,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:37,719 INFO L410 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, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:37,719 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:37,719 INFO L82 PathProgramCache]: Analyzing trace with hash -868616514, now seen corresponding path program 1 times [2019-11-19 23:43:37,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:37,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663502612] [2019-11-19 23:43:37,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:37,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663502612] [2019-11-19 23:43:37,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:37,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:37,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108248374] [2019-11-19 23:43:37,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:37,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:37,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:37,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:37,850 INFO L87 Difference]: Start difference. First operand 30596 states and 47098 transitions. Second operand 4 states. [2019-11-19 23:43:39,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:39,014 INFO L93 Difference]: Finished difference Result 62796 states and 96277 transitions. [2019-11-19 23:43:39,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:39,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-11-19 23:43:39,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:39,043 INFO L225 Difference]: With dead ends: 62796 [2019-11-19 23:43:39,043 INFO L226 Difference]: Without dead ends: 32219 [2019-11-19 23:43:39,058 INFO L630 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-19 23:43:39,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32219 states. [2019-11-19 23:43:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32219 to 30596. [2019-11-19 23:43:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30596 states. [2019-11-19 23:43:39,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30596 states to 30596 states and 47030 transitions. [2019-11-19 23:43:39,850 INFO L78 Accepts]: Start accepts. Automaton has 30596 states and 47030 transitions. Word has length 380 [2019-11-19 23:43:39,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:39,850 INFO L462 AbstractCegarLoop]: Abstraction has 30596 states and 47030 transitions. [2019-11-19 23:43:39,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 30596 states and 47030 transitions. [2019-11-19 23:43:39,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-19 23:43:39,871 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:39,872 INFO L410 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, 7, 7, 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, 1, 1] [2019-11-19 23:43:39,872 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:39,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:39,872 INFO L82 PathProgramCache]: Analyzing trace with hash 215074366, now seen corresponding path program 1 times [2019-11-19 23:43:39,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:39,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803725722] [2019-11-19 23:43:39,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1380 backedges. 687 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:40,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803725722] [2019-11-19 23:43:40,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:40,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:40,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139277009] [2019-11-19 23:43:40,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:40,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:40,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:40,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:40,016 INFO L87 Difference]: Start difference. First operand 30596 states and 47030 transitions. Second operand 4 states. [2019-11-19 23:43:41,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:41,183 INFO L93 Difference]: Finished difference Result 62107 states and 95270 transitions. [2019-11-19 23:43:41,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:41,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-11-19 23:43:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:41,207 INFO L225 Difference]: With dead ends: 62107 [2019-11-19 23:43:41,207 INFO L226 Difference]: Without dead ends: 31530 [2019-11-19 23:43:41,217 INFO L630 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-19 23:43:41,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31530 states. [2019-11-19 23:43:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31530 to 30624. [2019-11-19 23:43:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30624 states. [2019-11-19 23:43:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30624 states to 30624 states and 47052 transitions. [2019-11-19 23:43:41,984 INFO L78 Accepts]: Start accepts. Automaton has 30624 states and 47052 transitions. Word has length 380 [2019-11-19 23:43:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:41,985 INFO L462 AbstractCegarLoop]: Abstraction has 30624 states and 47052 transitions. [2019-11-19 23:43:41,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:41,985 INFO L276 IsEmpty]: Start isEmpty. Operand 30624 states and 47052 transitions. [2019-11-19 23:43:42,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-19 23:43:42,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:42,007 INFO L410 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, 7, 7, 7, 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, 1] [2019-11-19 23:43:42,007 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:42,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:42,008 INFO L82 PathProgramCache]: Analyzing trace with hash -678085108, now seen corresponding path program 1 times [2019-11-19 23:43:42,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:42,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023841529] [2019-11-19 23:43:42,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:42,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1386 backedges. 693 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:42,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023841529] [2019-11-19 23:43:42,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:42,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:42,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644758375] [2019-11-19 23:43:42,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:42,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:42,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:42,136 INFO L87 Difference]: Start difference. First operand 30624 states and 47052 transitions. Second operand 4 states. [2019-11-19 23:43:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:43,206 INFO L93 Difference]: Finished difference Result 62135 states and 95258 transitions. [2019-11-19 23:43:43,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:43,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-11-19 23:43:43,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:43,232 INFO L225 Difference]: With dead ends: 62135 [2019-11-19 23:43:43,233 INFO L226 Difference]: Without dead ends: 31530 [2019-11-19 23:43:43,246 INFO L630 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-19 23:43:43,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31530 states. [2019-11-19 23:43:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31530 to 30652. [2019-11-19 23:43:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30652 states. [2019-11-19 23:43:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30652 states to 30652 states and 47074 transitions. [2019-11-19 23:43:44,018 INFO L78 Accepts]: Start accepts. Automaton has 30652 states and 47074 transitions. Word has length 380 [2019-11-19 23:43:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:44,018 INFO L462 AbstractCegarLoop]: Abstraction has 30652 states and 47074 transitions. [2019-11-19 23:43:44,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 30652 states and 47074 transitions. [2019-11-19 23:43:44,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-19 23:43:44,040 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:44,040 INFO L410 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, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:44,040 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:44,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:44,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1087209856, now seen corresponding path program 1 times [2019-11-19 23:43:44,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:44,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65197219] [2019-11-19 23:43:44,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:44,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 852 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-19 23:43:44,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65197219] [2019-11-19 23:43:44,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:44,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:44,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894124224] [2019-11-19 23:43:44,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:44,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:44,182 INFO L87 Difference]: Start difference. First operand 30652 states and 47074 transitions. Second operand 4 states. [2019-11-19 23:43:45,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:45,368 INFO L93 Difference]: Finished difference Result 62818 states and 96022 transitions. [2019-11-19 23:43:45,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:45,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-11-19 23:43:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:45,404 INFO L225 Difference]: With dead ends: 62818 [2019-11-19 23:43:45,404 INFO L226 Difference]: Without dead ends: 32185 [2019-11-19 23:43:45,418 INFO L630 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-19 23:43:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32185 states. [2019-11-19 23:43:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32185 to 30652. [2019-11-19 23:43:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30652 states. [2019-11-19 23:43:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30652 states to 30652 states and 46999 transitions. [2019-11-19 23:43:46,342 INFO L78 Accepts]: Start accepts. Automaton has 30652 states and 46999 transitions. Word has length 380 [2019-11-19 23:43:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:46,342 INFO L462 AbstractCegarLoop]: Abstraction has 30652 states and 46999 transitions. [2019-11-19 23:43:46,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 30652 states and 46999 transitions. [2019-11-19 23:43:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-11-19 23:43:46,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:46,363 INFO L410 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, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1] [2019-11-19 23:43:46,364 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash -844195654, now seen corresponding path program 1 times [2019-11-19 23:43:46,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:46,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957532056] [2019-11-19 23:43:46,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:46,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:46,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 791 proven. 0 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2019-11-19 23:43:46,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957532056] [2019-11-19 23:43:46,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:46,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:46,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882129563] [2019-11-19 23:43:46,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:46,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:46,483 INFO L87 Difference]: Start difference. First operand 30652 states and 46999 transitions. Second operand 4 states. [2019-11-19 23:43:47,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:47,513 INFO L93 Difference]: Finished difference Result 63242 states and 96823 transitions. [2019-11-19 23:43:47,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:47,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 380 [2019-11-19 23:43:47,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:47,542 INFO L225 Difference]: With dead ends: 63242 [2019-11-19 23:43:47,542 INFO L226 Difference]: Without dead ends: 32609 [2019-11-19 23:43:47,557 INFO L630 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-19 23:43:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32609 states. [2019-11-19 23:43:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32609 to 32227. [2019-11-19 23:43:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-11-19 23:43:48,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 49324 transitions. [2019-11-19 23:43:48,365 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 49324 transitions. Word has length 380 [2019-11-19 23:43:48,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:48,365 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 49324 transitions. [2019-11-19 23:43:48,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 49324 transitions. [2019-11-19 23:43:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-19 23:43:48,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:48,389 INFO L410 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, 7, 7, 7, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:48,389 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:48,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -198493938, now seen corresponding path program 1 times [2019-11-19 23:43:48,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:48,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078779105] [2019-11-19 23:43:48,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:48,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:48,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078779105] [2019-11-19 23:43:48,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:48,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:48,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756888726] [2019-11-19 23:43:48,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:48,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:48,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:48,566 INFO L87 Difference]: Start difference. First operand 32227 states and 49324 transitions. Second operand 4 states. [2019-11-19 23:43:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:49,792 INFO L93 Difference]: Finished difference Result 66058 states and 100729 transitions. [2019-11-19 23:43:49,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:49,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-19 23:43:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:49,820 INFO L225 Difference]: With dead ends: 66058 [2019-11-19 23:43:49,821 INFO L226 Difference]: Without dead ends: 33850 [2019-11-19 23:43:49,835 INFO L630 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-19 23:43:49,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33850 states. [2019-11-19 23:43:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33850 to 32227. [2019-11-19 23:43:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32227 states. [2019-11-19 23:43:50,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32227 states to 32227 states and 49256 transitions. [2019-11-19 23:43:50,648 INFO L78 Accepts]: Start accepts. Automaton has 32227 states and 49256 transitions. Word has length 381 [2019-11-19 23:43:50,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:50,648 INFO L462 AbstractCegarLoop]: Abstraction has 32227 states and 49256 transitions. [2019-11-19 23:43:50,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:50,648 INFO L276 IsEmpty]: Start isEmpty. Operand 32227 states and 49256 transitions. [2019-11-19 23:43:50,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-19 23:43:50,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:50,671 INFO L410 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, 7, 7, 7, 7, 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, 1] [2019-11-19 23:43:50,671 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:50,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:50,671 INFO L82 PathProgramCache]: Analyzing trace with hash 507034642, now seen corresponding path program 1 times [2019-11-19 23:43:50,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:50,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034946572] [2019-11-19 23:43:50,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 699 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2019-11-19 23:43:50,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034946572] [2019-11-19 23:43:50,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:50,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:50,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68169013] [2019-11-19 23:43:50,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:50,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:50,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:50,930 INFO L87 Difference]: Start difference. First operand 32227 states and 49256 transitions. Second operand 4 states. [2019-11-19 23:43:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:52,014 INFO L93 Difference]: Finished difference Result 65257 states and 99554 transitions. [2019-11-19 23:43:52,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:52,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-19 23:43:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:52,042 INFO L225 Difference]: With dead ends: 65257 [2019-11-19 23:43:52,042 INFO L226 Difference]: Without dead ends: 33049 [2019-11-19 23:43:52,056 INFO L630 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-19 23:43:52,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33049 states. [2019-11-19 23:43:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33049 to 32255. [2019-11-19 23:43:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32255 states. [2019-11-19 23:43:52,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32255 states to 32255 states and 49278 transitions. [2019-11-19 23:43:52,861 INFO L78 Accepts]: Start accepts. Automaton has 32255 states and 49278 transitions. Word has length 381 [2019-11-19 23:43:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:52,861 INFO L462 AbstractCegarLoop]: Abstraction has 32255 states and 49278 transitions. [2019-11-19 23:43:52,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 32255 states and 49278 transitions. [2019-11-19 23:43:52,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-19 23:43:52,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:52,885 INFO L410 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, 7, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:52,885 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:52,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:52,885 INFO L82 PathProgramCache]: Analyzing trace with hash -784507290, now seen corresponding path program 1 times [2019-11-19 23:43:52,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:52,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068350895] [2019-11-19 23:43:52,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:53,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1376 backedges. 882 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-19 23:43:53,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068350895] [2019-11-19 23:43:53,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:53,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:53,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548219066] [2019-11-19 23:43:53,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:53,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:53,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:53,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:53,039 INFO L87 Difference]: Start difference. First operand 32255 states and 49278 transitions. Second operand 4 states. [2019-11-19 23:43:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:54,280 INFO L93 Difference]: Finished difference Result 66024 states and 100430 transitions. [2019-11-19 23:43:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:54,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-19 23:43:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:54,310 INFO L225 Difference]: With dead ends: 66024 [2019-11-19 23:43:54,310 INFO L226 Difference]: Without dead ends: 33788 [2019-11-19 23:43:54,325 INFO L630 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-19 23:43:54,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33788 states. [2019-11-19 23:43:55,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33788 to 32255. [2019-11-19 23:43:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32255 states. [2019-11-19 23:43:55,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32255 states to 32255 states and 49203 transitions. [2019-11-19 23:43:55,147 INFO L78 Accepts]: Start accepts. Automaton has 32255 states and 49203 transitions. Word has length 381 [2019-11-19 23:43:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:55,147 INFO L462 AbstractCegarLoop]: Abstraction has 32255 states and 49203 transitions. [2019-11-19 23:43:55,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 32255 states and 49203 transitions. [2019-11-19 23:43:55,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-11-19 23:43:55,171 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:55,171 INFO L410 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, 7, 7, 7, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1] [2019-11-19 23:43:55,171 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:55,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1408889926, now seen corresponding path program 1 times [2019-11-19 23:43:55,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:55,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979254237] [2019-11-19 23:43:55,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:55,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1388 backedges. 894 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-19 23:43:55,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979254237] [2019-11-19 23:43:55,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:55,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:55,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915567959] [2019-11-19 23:43:55,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:55,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:55,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:55,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:55,350 INFO L87 Difference]: Start difference. First operand 32255 states and 49203 transitions. Second operand 4 states. [2019-11-19 23:43:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:56,669 INFO L93 Difference]: Finished difference Result 66024 states and 100280 transitions. [2019-11-19 23:43:56,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:56,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 381 [2019-11-19 23:43:56,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:56,695 INFO L225 Difference]: With dead ends: 66024 [2019-11-19 23:43:56,696 INFO L226 Difference]: Without dead ends: 33788 [2019-11-19 23:43:56,709 INFO L630 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-19 23:43:56,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33788 states. [2019-11-19 23:43:57,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33788 to 32255. [2019-11-19 23:43:57,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32255 states. [2019-11-19 23:43:57,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32255 states to 32255 states and 49128 transitions. [2019-11-19 23:43:57,531 INFO L78 Accepts]: Start accepts. Automaton has 32255 states and 49128 transitions. Word has length 381 [2019-11-19 23:43:57,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:57,531 INFO L462 AbstractCegarLoop]: Abstraction has 32255 states and 49128 transitions. [2019-11-19 23:43:57,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:57,531 INFO L276 IsEmpty]: Start isEmpty. Operand 32255 states and 49128 transitions. [2019-11-19 23:43:57,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-19 23:43:57,553 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:57,553 INFO L410 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, 7, 7, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:57,554 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:57,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:57,554 INFO L82 PathProgramCache]: Analyzing trace with hash -113617044, now seen corresponding path program 1 times [2019-11-19 23:43:57,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:57,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924534487] [2019-11-19 23:43:57,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:57,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:57,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 480 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:57,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924534487] [2019-11-19 23:43:57,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:57,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:57,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813330663] [2019-11-19 23:43:57,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:57,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:57,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:57,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:57,717 INFO L87 Difference]: Start difference. First operand 32255 states and 49128 transitions. Second operand 4 states. [2019-11-19 23:43:58,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:43:58,913 INFO L93 Difference]: Finished difference Result 65842 states and 99997 transitions. [2019-11-19 23:43:58,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:43:58,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-11-19 23:43:58,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:43:58,943 INFO L225 Difference]: With dead ends: 65842 [2019-11-19 23:43:58,943 INFO L226 Difference]: Without dead ends: 33606 [2019-11-19 23:43:58,958 INFO L630 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-19 23:43:58,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33606 states. [2019-11-19 23:43:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33606 to 32255. [2019-11-19 23:43:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32255 states. [2019-11-19 23:43:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32255 states to 32255 states and 49060 transitions. [2019-11-19 23:43:59,823 INFO L78 Accepts]: Start accepts. Automaton has 32255 states and 49060 transitions. Word has length 382 [2019-11-19 23:43:59,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:43:59,824 INFO L462 AbstractCegarLoop]: Abstraction has 32255 states and 49060 transitions. [2019-11-19 23:43:59,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:43:59,824 INFO L276 IsEmpty]: Start isEmpty. Operand 32255 states and 49060 transitions. [2019-11-19 23:43:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-19 23:43:59,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:43:59,847 INFO L410 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, 7, 7, 7, 7, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:43:59,847 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:43:59,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:43:59,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1490534932, now seen corresponding path program 1 times [2019-11-19 23:43:59,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:43:59,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652022170] [2019-11-19 23:43:59,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:43:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:43:59,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 492 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2019-11-19 23:43:59,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652022170] [2019-11-19 23:43:59,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:43:59,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:43:59,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507114449] [2019-11-19 23:43:59,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:43:59,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:43:59,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:43:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:43:59,981 INFO L87 Difference]: Start difference. First operand 32255 states and 49060 transitions. Second operand 4 states. [2019-11-19 23:44:01,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:01,151 INFO L93 Difference]: Finished difference Result 65706 states and 99725 transitions. [2019-11-19 23:44:01,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:01,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-11-19 23:44:01,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:01,180 INFO L225 Difference]: With dead ends: 65706 [2019-11-19 23:44:01,180 INFO L226 Difference]: Without dead ends: 33470 [2019-11-19 23:44:01,195 INFO L630 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-19 23:44:01,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33470 states. [2019-11-19 23:44:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33470 to 32157. [2019-11-19 23:44:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32157 states. [2019-11-19 23:44:02,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32157 states to 32157 states and 48894 transitions. [2019-11-19 23:44:02,159 INFO L78 Accepts]: Start accepts. Automaton has 32157 states and 48894 transitions. Word has length 382 [2019-11-19 23:44:02,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:02,159 INFO L462 AbstractCegarLoop]: Abstraction has 32157 states and 48894 transitions. [2019-11-19 23:44:02,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 32157 states and 48894 transitions. [2019-11-19 23:44:02,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-19 23:44:02,182 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:02,182 INFO L410 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, 7, 7, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:02,182 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:02,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:02,182 INFO L82 PathProgramCache]: Analyzing trace with hash 714517224, now seen corresponding path program 1 times [2019-11-19 23:44:02,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:02,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20389744] [2019-11-19 23:44:02,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:02,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1382 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-19 23:44:02,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20389744] [2019-11-19 23:44:02,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:02,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:02,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968882150] [2019-11-19 23:44:02,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:02,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:02,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:02,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:02,379 INFO L87 Difference]: Start difference. First operand 32157 states and 48894 transitions. Second operand 4 states. [2019-11-19 23:44:03,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:03,629 INFO L93 Difference]: Finished difference Result 65528 states and 99287 transitions. [2019-11-19 23:44:03,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:03,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-11-19 23:44:03,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:03,659 INFO L225 Difference]: With dead ends: 65528 [2019-11-19 23:44:03,659 INFO L226 Difference]: Without dead ends: 33390 [2019-11-19 23:44:03,674 INFO L630 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-19 23:44:03,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33390 states. [2019-11-19 23:44:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33390 to 32157. [2019-11-19 23:44:04,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32157 states. [2019-11-19 23:44:04,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32157 states to 32157 states and 48819 transitions. [2019-11-19 23:44:04,510 INFO L78 Accepts]: Start accepts. Automaton has 32157 states and 48819 transitions. Word has length 382 [2019-11-19 23:44:04,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:04,511 INFO L462 AbstractCegarLoop]: Abstraction has 32157 states and 48819 transitions. [2019-11-19 23:44:04,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:04,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32157 states and 48819 transitions. [2019-11-19 23:44:04,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-11-19 23:44:04,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:04,534 INFO L410 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, 7, 7, 7, 7, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1] [2019-11-19 23:44:04,534 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash 429396328, now seen corresponding path program 1 times [2019-11-19 23:44:04,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:04,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757181464] [2019-11-19 23:44:04,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 900 proven. 0 refuted. 0 times theorem prover too weak. 494 trivial. 0 not checked. [2019-11-19 23:44:04,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757181464] [2019-11-19 23:44:04,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:04,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:04,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029437508] [2019-11-19 23:44:04,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:04,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:04,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:04,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:04,685 INFO L87 Difference]: Start difference. First operand 32157 states and 48819 transitions. Second operand 4 states. [2019-11-19 23:44:05,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:05,839 INFO L93 Difference]: Finished difference Result 63723 states and 96354 transitions. [2019-11-19 23:44:05,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:05,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 382 [2019-11-19 23:44:05,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:05,865 INFO L225 Difference]: With dead ends: 63723 [2019-11-19 23:44:05,865 INFO L226 Difference]: Without dead ends: 31585 [2019-11-19 23:44:05,880 INFO L630 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-19 23:44:05,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31585 states. [2019-11-19 23:44:06,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31585 to 30260. [2019-11-19 23:44:06,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:06,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45803 transitions. [2019-11-19 23:44:06,831 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45803 transitions. Word has length 382 [2019-11-19 23:44:06,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45803 transitions. [2019-11-19 23:44:06,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45803 transitions. [2019-11-19 23:44:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2019-11-19 23:44:06,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:06,853 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1] [2019-11-19 23:44:06,853 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:06,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:06,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1309710463, now seen corresponding path program 1 times [2019-11-19 23:44:06,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:06,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756489082] [2019-11-19 23:44:06,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 660 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:44:07,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756489082] [2019-11-19 23:44:07,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:07,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:07,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903507099] [2019-11-19 23:44:07,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:07,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:07,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:07,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:07,010 INFO L87 Difference]: Start difference. First operand 30260 states and 45803 transitions. Second operand 4 states. [2019-11-19 23:44:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:08,271 INFO L93 Difference]: Finished difference Result 61295 states and 92592 transitions. [2019-11-19 23:44:08,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:08,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 384 [2019-11-19 23:44:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:08,298 INFO L225 Difference]: With dead ends: 61295 [2019-11-19 23:44:08,298 INFO L226 Difference]: Without dead ends: 31054 [2019-11-19 23:44:08,313 INFO L630 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-19 23:44:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2019-11-19 23:44:09,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 30260. [2019-11-19 23:44:09,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45769 transitions. [2019-11-19 23:44:09,106 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45769 transitions. Word has length 384 [2019-11-19 23:44:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:09,106 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45769 transitions. [2019-11-19 23:44:09,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:09,106 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45769 transitions. [2019-11-19 23:44:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-11-19 23:44:09,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:09,127 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1] [2019-11-19 23:44:09,127 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:09,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:09,127 INFO L82 PathProgramCache]: Analyzing trace with hash -353233310, now seen corresponding path program 1 times [2019-11-19 23:44:09,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:09,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136660181] [2019-11-19 23:44:09,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:09,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:09,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1452 backedges. 668 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:44:09,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136660181] [2019-11-19 23:44:09,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:09,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:09,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847000913] [2019-11-19 23:44:09,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:09,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:09,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:09,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:09,288 INFO L87 Difference]: Start difference. First operand 30260 states and 45769 transitions. Second operand 4 states. [2019-11-19 23:44:10,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:10,371 INFO L93 Difference]: Finished difference Result 61183 states and 92384 transitions. [2019-11-19 23:44:10,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:10,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 385 [2019-11-19 23:44:10,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:10,399 INFO L225 Difference]: With dead ends: 61183 [2019-11-19 23:44:10,399 INFO L226 Difference]: Without dead ends: 30942 [2019-11-19 23:44:10,414 INFO L630 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-19 23:44:10,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30942 states. [2019-11-19 23:44:11,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30942 to 30260. [2019-11-19 23:44:11,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:11,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45735 transitions. [2019-11-19 23:44:11,198 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45735 transitions. Word has length 385 [2019-11-19 23:44:11,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:11,198 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45735 transitions. [2019-11-19 23:44:11,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:11,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45735 transitions. [2019-11-19 23:44:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-11-19 23:44:11,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:11,219 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:11,220 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1602915915, now seen corresponding path program 1 times [2019-11-19 23:44:11,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:11,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769626872] [2019-11-19 23:44:11,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-11-19 23:44:11,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769626872] [2019-11-19 23:44:11,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:11,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:11,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096418624] [2019-11-19 23:44:11,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:11,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:11,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:11,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:11,375 INFO L87 Difference]: Start difference. First operand 30260 states and 45735 transitions. Second operand 4 states. [2019-11-19 23:44:12,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:12,670 INFO L93 Difference]: Finished difference Result 60969 states and 92084 transitions. [2019-11-19 23:44:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:12,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 386 [2019-11-19 23:44:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:12,694 INFO L225 Difference]: With dead ends: 60969 [2019-11-19 23:44:12,695 INFO L226 Difference]: Without dead ends: 30728 [2019-11-19 23:44:12,704 INFO L630 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-19 23:44:12,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30728 states. [2019-11-19 23:44:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30728 to 30260. [2019-11-19 23:44:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45717 transitions. [2019-11-19 23:44:13,487 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45717 transitions. Word has length 386 [2019-11-19 23:44:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:13,487 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45717 transitions. [2019-11-19 23:44:13,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45717 transitions. [2019-11-19 23:44:13,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-19 23:44:13,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:13,509 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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] [2019-11-19 23:44:13,509 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:13,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:13,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1811842840, now seen corresponding path program 1 times [2019-11-19 23:44:13,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:13,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994733827] [2019-11-19 23:44:13,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1447 backedges. 886 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-11-19 23:44:13,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994733827] [2019-11-19 23:44:13,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:13,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:13,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507957228] [2019-11-19 23:44:13,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:13,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:13,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:13,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:13,676 INFO L87 Difference]: Start difference. First operand 30260 states and 45717 transitions. Second operand 4 states. [2019-11-19 23:44:14,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:14,849 INFO L93 Difference]: Finished difference Result 61584 states and 92783 transitions. [2019-11-19 23:44:14,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:14,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-11-19 23:44:14,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:14,875 INFO L225 Difference]: With dead ends: 61584 [2019-11-19 23:44:14,875 INFO L226 Difference]: Without dead ends: 31343 [2019-11-19 23:44:14,888 INFO L630 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-19 23:44:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31343 states. [2019-11-19 23:44:15,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31343 to 30260. [2019-11-19 23:44:15,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:15,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45642 transitions. [2019-11-19 23:44:15,676 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45642 transitions. Word has length 387 [2019-11-19 23:44:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:15,677 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45642 transitions. [2019-11-19 23:44:15,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45642 transitions. [2019-11-19 23:44:15,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-19 23:44:15,697 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:15,698 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:15,698 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:15,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:15,698 INFO L82 PathProgramCache]: Analyzing trace with hash -308797864, now seen corresponding path program 1 times [2019-11-19 23:44:15,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:15,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241122387] [2019-11-19 23:44:15,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:15,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:15,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1465 backedges. 835 proven. 0 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2019-11-19 23:44:15,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241122387] [2019-11-19 23:44:15,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:15,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:15,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133461943] [2019-11-19 23:44:15,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:15,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:15,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:15,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:15,818 INFO L87 Difference]: Start difference. First operand 30260 states and 45642 transitions. Second operand 4 states. [2019-11-19 23:44:16,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:16,942 INFO L93 Difference]: Finished difference Result 60933 states and 91862 transitions. [2019-11-19 23:44:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:16,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-11-19 23:44:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:16,967 INFO L225 Difference]: With dead ends: 60933 [2019-11-19 23:44:16,967 INFO L226 Difference]: Without dead ends: 30692 [2019-11-19 23:44:16,982 INFO L630 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-19 23:44:17,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30692 states. [2019-11-19 23:44:17,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30692 to 30260. [2019-11-19 23:44:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:17,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45624 transitions. [2019-11-19 23:44:17,930 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45624 transitions. Word has length 387 [2019-11-19 23:44:17,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:17,930 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45624 transitions. [2019-11-19 23:44:17,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45624 transitions. [2019-11-19 23:44:17,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-11-19 23:44:17,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:17,951 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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] [2019-11-19 23:44:17,951 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:17,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:17,952 INFO L82 PathProgramCache]: Analyzing trace with hash 619601338, now seen corresponding path program 1 times [2019-11-19 23:44:17,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:17,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159678806] [2019-11-19 23:44:17,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:18,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-11-19 23:44:18,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159678806] [2019-11-19 23:44:18,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:18,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:18,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723180041] [2019-11-19 23:44:18,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:18,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:18,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:18,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:18,125 INFO L87 Difference]: Start difference. First operand 30260 states and 45624 transitions. Second operand 4 states. [2019-11-19 23:44:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:19,393 INFO L93 Difference]: Finished difference Result 61584 states and 92597 transitions. [2019-11-19 23:44:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:19,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 388 [2019-11-19 23:44:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:19,420 INFO L225 Difference]: With dead ends: 61584 [2019-11-19 23:44:19,420 INFO L226 Difference]: Without dead ends: 31343 [2019-11-19 23:44:19,434 INFO L630 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-19 23:44:19,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31343 states. [2019-11-19 23:44:20,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31343 to 30260. [2019-11-19 23:44:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:20,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45549 transitions. [2019-11-19 23:44:20,252 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45549 transitions. Word has length 388 [2019-11-19 23:44:20,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:20,253 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45549 transitions. [2019-11-19 23:44:20,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:20,253 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45549 transitions. [2019-11-19 23:44:20,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-11-19 23:44:20,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:20,274 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 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, 1, 1, 1] [2019-11-19 23:44:20,274 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:20,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:20,274 INFO L82 PathProgramCache]: Analyzing trace with hash -2127944728, now seen corresponding path program 1 times [2019-11-19 23:44:20,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:20,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219106943] [2019-11-19 23:44:20,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:20,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1492 backedges. 708 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:44:20,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219106943] [2019-11-19 23:44:20,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:20,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:20,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171796957] [2019-11-19 23:44:20,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:20,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:20,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:20,390 INFO L87 Difference]: Start difference. First operand 30260 states and 45549 transitions. Second operand 4 states. [2019-11-19 23:44:21,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:21,456 INFO L93 Difference]: Finished difference Result 61183 states and 91944 transitions. [2019-11-19 23:44:21,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:21,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-11-19 23:44:21,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:21,482 INFO L225 Difference]: With dead ends: 61183 [2019-11-19 23:44:21,482 INFO L226 Difference]: Without dead ends: 30942 [2019-11-19 23:44:21,495 INFO L630 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-19 23:44:21,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30942 states. [2019-11-19 23:44:22,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30942 to 30260. [2019-11-19 23:44:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45515 transitions. [2019-11-19 23:44:22,325 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45515 transitions. Word has length 389 [2019-11-19 23:44:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:22,325 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45515 transitions. [2019-11-19 23:44:22,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:22,325 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45515 transitions. [2019-11-19 23:44:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2019-11-19 23:44:22,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:22,347 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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] [2019-11-19 23:44:22,347 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:22,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:22,347 INFO L82 PathProgramCache]: Analyzing trace with hash 274702365, now seen corresponding path program 1 times [2019-11-19 23:44:22,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:22,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397705899] [2019-11-19 23:44:22,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:22,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1467 backedges. 906 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-11-19 23:44:22,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397705899] [2019-11-19 23:44:22,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:22,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:22,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151034915] [2019-11-19 23:44:22,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:22,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:22,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:22,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:22,509 INFO L87 Difference]: Start difference. First operand 30260 states and 45515 transitions. Second operand 4 states. [2019-11-19 23:44:23,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:23,730 INFO L93 Difference]: Finished difference Result 61359 states and 92089 transitions. [2019-11-19 23:44:23,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:23,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2019-11-19 23:44:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:23,757 INFO L225 Difference]: With dead ends: 61359 [2019-11-19 23:44:23,757 INFO L226 Difference]: Without dead ends: 31118 [2019-11-19 23:44:23,771 INFO L630 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-19 23:44:23,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31118 states. [2019-11-19 23:44:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31118 to 30260. [2019-11-19 23:44:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:24,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45440 transitions. [2019-11-19 23:44:24,589 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45440 transitions. Word has length 389 [2019-11-19 23:44:24,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:24,589 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45440 transitions. [2019-11-19 23:44:24,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:24,589 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45440 transitions. [2019-11-19 23:44:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-19 23:44:24,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:24,611 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 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, 1, 1, 1] [2019-11-19 23:44:24,611 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:24,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash 912524167, now seen corresponding path program 1 times [2019-11-19 23:44:24,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:24,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013574773] [2019-11-19 23:44:24,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:24,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1500 backedges. 716 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:44:24,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013574773] [2019-11-19 23:44:24,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:24,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:24,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422724419] [2019-11-19 23:44:24,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:24,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:24,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:24,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:24,732 INFO L87 Difference]: Start difference. First operand 30260 states and 45440 transitions. Second operand 4 states. [2019-11-19 23:44:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:25,790 INFO L93 Difference]: Finished difference Result 61147 states and 91690 transitions. [2019-11-19 23:44:25,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:25,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-19 23:44:25,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:25,818 INFO L225 Difference]: With dead ends: 61147 [2019-11-19 23:44:25,818 INFO L226 Difference]: Without dead ends: 30906 [2019-11-19 23:44:25,832 INFO L630 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-19 23:44:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30906 states. [2019-11-19 23:44:26,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30906 to 30260. [2019-11-19 23:44:26,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:26,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45406 transitions. [2019-11-19 23:44:26,650 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45406 transitions. Word has length 390 [2019-11-19 23:44:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:26,651 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45406 transitions. [2019-11-19 23:44:26,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45406 transitions. [2019-11-19 23:44:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-19 23:44:26,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:26,673 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 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-19 23:44:26,673 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1098626658, now seen corresponding path program 1 times [2019-11-19 23:44:26,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:26,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565329074] [2019-11-19 23:44:26,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:26,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 818 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-19 23:44:26,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565329074] [2019-11-19 23:44:26,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:26,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:26,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491506831] [2019-11-19 23:44:26,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:26,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:26,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:26,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:26,828 INFO L87 Difference]: Start difference. First operand 30260 states and 45406 transitions. Second operand 4 states. [2019-11-19 23:44:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:28,155 INFO L93 Difference]: Finished difference Result 61425 states and 92070 transitions. [2019-11-19 23:44:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:28,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-19 23:44:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:28,185 INFO L225 Difference]: With dead ends: 61425 [2019-11-19 23:44:28,185 INFO L226 Difference]: Without dead ends: 31184 [2019-11-19 23:44:28,200 INFO L630 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-19 23:44:28,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31184 states. [2019-11-19 23:44:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31184 to 30260. [2019-11-19 23:44:29,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45365 transitions. [2019-11-19 23:44:29,148 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45365 transitions. Word has length 390 [2019-11-19 23:44:29,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:29,148 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45365 transitions. [2019-11-19 23:44:29,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:29,148 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45365 transitions. [2019-11-19 23:44:29,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-11-19 23:44:29,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:29,171 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:29,171 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:29,171 INFO L82 PathProgramCache]: Analyzing trace with hash -691339755, now seen corresponding path program 1 times [2019-11-19 23:44:29,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:29,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197543882] [2019-11-19 23:44:29,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:29,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 899 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2019-11-19 23:44:29,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197543882] [2019-11-19 23:44:29,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:29,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:29,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751598791] [2019-11-19 23:44:29,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:29,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:29,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:29,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:29,317 INFO L87 Difference]: Start difference. First operand 30260 states and 45365 transitions. Second operand 4 states. [2019-11-19 23:44:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:30,494 INFO L93 Difference]: Finished difference Result 61359 states and 91789 transitions. [2019-11-19 23:44:30,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:30,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 390 [2019-11-19 23:44:30,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:30,522 INFO L225 Difference]: With dead ends: 61359 [2019-11-19 23:44:30,522 INFO L226 Difference]: Without dead ends: 31118 [2019-11-19 23:44:30,535 INFO L630 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-19 23:44:30,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31118 states. [2019-11-19 23:44:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31118 to 30260. [2019-11-19 23:44:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45312 transitions. [2019-11-19 23:44:31,362 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45312 transitions. Word has length 390 [2019-11-19 23:44:31,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:31,362 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45312 transitions. [2019-11-19 23:44:31,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:31,362 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45312 transitions. [2019-11-19 23:44:31,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-19 23:44:31,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:31,384 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 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-19 23:44:31,384 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:31,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:31,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1855700081, now seen corresponding path program 1 times [2019-11-19 23:44:31,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:31,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26247983] [2019-11-19 23:44:31,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:31,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 829 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2019-11-19 23:44:31,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26247983] [2019-11-19 23:44:31,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:31,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:31,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807727598] [2019-11-19 23:44:31,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:31,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:31,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:31,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:31,504 INFO L87 Difference]: Start difference. First operand 30260 states and 45312 transitions. Second operand 4 states. [2019-11-19 23:44:32,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:32,703 INFO L93 Difference]: Finished difference Result 61353 states and 91810 transitions. [2019-11-19 23:44:32,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:32,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-11-19 23:44:32,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:32,730 INFO L225 Difference]: With dead ends: 61353 [2019-11-19 23:44:32,731 INFO L226 Difference]: Without dead ends: 31112 [2019-11-19 23:44:32,744 INFO L630 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-19 23:44:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31112 states. [2019-11-19 23:44:33,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31112 to 30260. [2019-11-19 23:44:33,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30260 states. [2019-11-19 23:44:33,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30260 states to 30260 states and 45271 transitions. [2019-11-19 23:44:33,575 INFO L78 Accepts]: Start accepts. Automaton has 30260 states and 45271 transitions. Word has length 391 [2019-11-19 23:44:33,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:33,575 INFO L462 AbstractCegarLoop]: Abstraction has 30260 states and 45271 transitions. [2019-11-19 23:44:33,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:33,575 INFO L276 IsEmpty]: Start isEmpty. Operand 30260 states and 45271 transitions. [2019-11-19 23:44:33,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-19 23:44:33,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:33,598 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:33,598 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:33,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1154626917, now seen corresponding path program 1 times [2019-11-19 23:44:33,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:33,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831555487] [2019-11-19 23:44:33,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:33,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:34,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 933 proven. 17 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2019-11-19 23:44:34,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831555487] [2019-11-19 23:44:34,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023133042] [2019-11-19 23:44:34,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:44:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:34,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 23:44:34,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:44:34,339 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|, |v_#memory_$Pointer$.base_174|], 4=[|v_#memory_int_194|]} [2019-11-19 23:44:34,342 INFO L377 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 109 treesize of output 85 [2019-11-19 23:44:34,342 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-19 23:44:34,354 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:34,356 INFO L377 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 85 treesize of output 49 [2019-11-19 23:44:34,356 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-19 23:44:34,360 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:34,387 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:34,387 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:44:34,388 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:44:34,395 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-11-19 23:44:34,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:44:34,395 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:44:34,413 INFO L377 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 19 treesize of output 7 [2019-11-19 23:44:34,413 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:44:34,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:34,415 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-19 23:44:34,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:44:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 905 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2019-11-19 23:44:34,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:44:34,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-11-19 23:44:34,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758751159] [2019-11-19 23:44:34,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:34,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:34,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:44:34,518 INFO L87 Difference]: Start difference. First operand 30260 states and 45271 transitions. Second operand 4 states. [2019-11-19 23:44:35,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:35,646 INFO L93 Difference]: Finished difference Result 49159 states and 73423 transitions. [2019-11-19 23:44:35,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:35,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-11-19 23:44:35,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:35,675 INFO L225 Difference]: With dead ends: 49159 [2019-11-19 23:44:35,675 INFO L226 Difference]: Without dead ends: 31142 [2019-11-19 23:44:35,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:44:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31142 states. [2019-11-19 23:44:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31142 to 30644. [2019-11-19 23:44:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30644 states. [2019-11-19 23:44:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30644 states to 30644 states and 45895 transitions. [2019-11-19 23:44:36,530 INFO L78 Accepts]: Start accepts. Automaton has 30644 states and 45895 transitions. Word has length 391 [2019-11-19 23:44:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:36,530 INFO L462 AbstractCegarLoop]: Abstraction has 30644 states and 45895 transitions. [2019-11-19 23:44:36,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 30644 states and 45895 transitions. [2019-11-19 23:44:36,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-11-19 23:44:36,552 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:36,553 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:36,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:44:36,753 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:36,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2050179368, now seen corresponding path program 1 times [2019-11-19 23:44:36,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:36,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202811236] [2019-11-19 23:44:36,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:36,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 907 proven. 0 refuted. 0 times theorem prover too weak. 518 trivial. 0 not checked. [2019-11-19 23:44:36,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202811236] [2019-11-19 23:44:36,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:36,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:36,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328297958] [2019-11-19 23:44:36,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:36,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:36,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:36,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:36,914 INFO L87 Difference]: Start difference. First operand 30644 states and 45895 transitions. Second operand 4 states. [2019-11-19 23:44:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:38,066 INFO L93 Difference]: Finished difference Result 62045 states and 92767 transitions. [2019-11-19 23:44:38,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:38,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 391 [2019-11-19 23:44:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:38,094 INFO L225 Difference]: With dead ends: 62045 [2019-11-19 23:44:38,094 INFO L226 Difference]: Without dead ends: 31420 [2019-11-19 23:44:38,108 INFO L630 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-19 23:44:38,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31420 states. [2019-11-19 23:44:38,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31420 to 30644. [2019-11-19 23:44:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30644 states. [2019-11-19 23:44:38,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30644 states to 30644 states and 45842 transitions. [2019-11-19 23:44:38,940 INFO L78 Accepts]: Start accepts. Automaton has 30644 states and 45842 transitions. Word has length 391 [2019-11-19 23:44:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:38,941 INFO L462 AbstractCegarLoop]: Abstraction has 30644 states and 45842 transitions. [2019-11-19 23:44:38,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 30644 states and 45842 transitions. [2019-11-19 23:44:38,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-19 23:44:38,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:38,962 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:38,963 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:38,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:38,963 INFO L82 PathProgramCache]: Analyzing trace with hash 895697677, now seen corresponding path program 1 times [2019-11-19 23:44:38,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:38,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726774590] [2019-11-19 23:44:38,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 775 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2019-11-19 23:44:39,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726774590] [2019-11-19 23:44:39,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:39,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 23:44:39,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007938586] [2019-11-19 23:44:39,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:44:39,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:39,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:44:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:44:39,107 INFO L87 Difference]: Start difference. First operand 30644 states and 45842 transitions. Second operand 5 states. [2019-11-19 23:44:40,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:40,205 INFO L93 Difference]: Finished difference Result 48859 states and 72973 transitions. [2019-11-19 23:44:40,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:44:40,205 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 392 [2019-11-19 23:44:40,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:40,239 INFO L225 Difference]: With dead ends: 48859 [2019-11-19 23:44:40,239 INFO L226 Difference]: Without dead ends: 30644 [2019-11-19 23:44:40,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:44:40,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30644 states. [2019-11-19 23:44:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30644 to 30644. [2019-11-19 23:44:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30644 states. [2019-11-19 23:44:41,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30644 states to 30644 states and 45830 transitions. [2019-11-19 23:44:41,080 INFO L78 Accepts]: Start accepts. Automaton has 30644 states and 45830 transitions. Word has length 392 [2019-11-19 23:44:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:41,080 INFO L462 AbstractCegarLoop]: Abstraction has 30644 states and 45830 transitions. [2019-11-19 23:44:41,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:44:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 30644 states and 45830 transitions. [2019-11-19 23:44:41,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-19 23:44:41,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:41,102 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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-19 23:44:41,102 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:41,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:41,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1542900672, now seen corresponding path program 1 times [2019-11-19 23:44:41,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:41,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612800853] [2019-11-19 23:44:41,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1490 backedges. 929 proven. 0 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2019-11-19 23:44:41,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612800853] [2019-11-19 23:44:41,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:41,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:44:41,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800953032] [2019-11-19 23:44:41,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:41,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:44:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:41,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:41,240 INFO L87 Difference]: Start difference. First operand 30644 states and 45830 transitions. Second operand 4 states. [2019-11-19 23:44:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:42,387 INFO L93 Difference]: Finished difference Result 62045 states and 92637 transitions. [2019-11-19 23:44:42,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:42,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 392 [2019-11-19 23:44:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:42,416 INFO L225 Difference]: With dead ends: 62045 [2019-11-19 23:44:42,416 INFO L226 Difference]: Without dead ends: 31420 [2019-11-19 23:44:42,430 INFO L630 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-19 23:44:42,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31420 states. [2019-11-19 23:44:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31420 to 30644. [2019-11-19 23:44:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30644 states. [2019-11-19 23:44:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30644 states to 30644 states and 45755 transitions. [2019-11-19 23:44:43,279 INFO L78 Accepts]: Start accepts. Automaton has 30644 states and 45755 transitions. Word has length 392 [2019-11-19 23:44:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:43,280 INFO L462 AbstractCegarLoop]: Abstraction has 30644 states and 45755 transitions. [2019-11-19 23:44:43,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 30644 states and 45755 transitions. [2019-11-19 23:44:43,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-11-19 23:44:43,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:43,304 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:44:43,304 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1930358791, now seen corresponding path program 1 times [2019-11-19 23:44:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:44:43,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424705587] [2019-11-19 23:44:43,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:44:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:43,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1446 backedges. 930 proven. 14 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-11-19 23:44:43,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424705587] [2019-11-19 23:44:43,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537404259] [2019-11-19 23:44:43,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:44:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:43,899 INFO L255 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:44:43,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:44:43,912 INFO L377 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-19 23:44:43,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:44:43,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:43,915 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:44:43,915 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-19 23:44:43,917 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_166|, |v_#memory_$Pointer$.base_175|], 5=[|v_#memory_int_195|]} [2019-11-19 23:44:43,919 INFO L377 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-19 23:44:43,920 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-19 23:44:43,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:43,926 INFO L377 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-19 23:44:43,927 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-19 23:44:43,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:43,973 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:44:43,973 INFO L377 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-19 23:44:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:44:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:44:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:44:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:44:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:44:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:44:44,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:44:44,184 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-19 23:44:44,187 INFO L168 Benchmark]: Toolchain (without parser) took 191349.05 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.8 GB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -94.5 MB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-11-19 23:44:44,187 INFO L168 Benchmark]: CDTParser took 0.24 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-19 23:44:44,187 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:44:44,187 INFO L168 Benchmark]: Boogie Procedure Inliner took 95.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:44:44,188 INFO L168 Benchmark]: Boogie Preprocessor took 133.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:44:44,188 INFO L168 Benchmark]: RCFGBuilder took 1354.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.5 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:44:44,189 INFO L168 Benchmark]: TraceAbstraction took 189046.41 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 984.5 MB in the beginning and 1.0 GB in the end (delta: -49.3 MB). Peak memory consumption was 3.6 GB. Max. memory is 11.5 GB. [2019-11-19 23:44:44,190 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.24 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 711.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -156.4 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 95.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1354.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.5 MB in the end (delta: 104.3 MB). Peak memory consumption was 104.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 189046.41 ms. Allocated memory was 1.2 GB in the beginning and 4.9 GB in the end (delta: 3.7 GB). Free memory was 984.5 MB in the beginning and 1.0 GB in the end (delta: -49.3 MB). Peak memory consumption was 3.6 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-678e011 [2019-11-19 23:44:46,178 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:44:46,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:44:46,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:44:46,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:44:46,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:44:46,198 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:44:46,200 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:44:46,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:44:46,203 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:44:46,204 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:44:46,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:44:46,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:44:46,207 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:44:46,208 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:44:46,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:44:46,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:44:46,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:44:46,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:44:46,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:44:46,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:44:46,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:44:46,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:44:46,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:44:46,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:44:46,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:44:46,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:44:46,231 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:44:46,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:44:46,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:44:46,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:44:46,238 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:44:46,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:44:46,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:44:46,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:44:46,241 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:44:46,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:44:46,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:44:46,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:44:46,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:44:46,244 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:44:46,245 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 23:44:46,258 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:44:46,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:44:46,259 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:44:46,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:44:46,260 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:44:46,260 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:44:46,260 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:44:46,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:44:46,261 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:44:46,261 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:44:46,261 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:44:46,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:44:46,262 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 23:44:46,262 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 23:44:46,262 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:44:46,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:44:46,263 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:44:46,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:44:46,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:44:46,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:44:46,264 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:44:46,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:44:46,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:44:46,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:44:46,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:44:46,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:44:46,265 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 23:44:46,265 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 23:44:46,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:44:46,266 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 23:44:46,266 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_3990336c-5583-4683-8c6a-3119c239ac9a/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 -> a76e61da8563dd867a04fa03c43a1d8e84863fd7 [2019-11-19 23:44:46,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:44:46,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:44:46,534 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:44:46,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:44:46,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:44:46,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-19 23:44:46,599 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/2be272085/1426e602a1ff4c90a9587c0cf5df24ab/FLAGeb36a9dfd [2019-11-19 23:44:47,146 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:44:47,147 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-1.c [2019-11-19 23:44:47,177 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/2be272085/1426e602a1ff4c90a9587c0cf5df24ab/FLAGeb36a9dfd [2019-11-19 23:44:47,448 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/data/2be272085/1426e602a1ff4c90a9587c0cf5df24ab [2019-11-19 23:44:47,450 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:44:47,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:44:47,453 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:44:47,453 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:44:47,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:44:47,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:44:47" (1/1) ... [2019-11-19 23:44:47,459 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0bb046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:47, skipping insertion in model container [2019-11-19 23:44:47,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:44:47" (1/1) ... [2019-11-19 23:44:47,467 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:44:47,541 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:44:48,136 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:44:48,154 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:44:48,315 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:44:48,340 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:44:48,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48 WrapperNode [2019-11-19 23:44:48,341 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:44:48,342 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:44:48,342 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:44:48,342 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:44:48,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:44:48,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:44:48,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:44:48,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:44:48,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... [2019-11-19 23:44:48,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:44:48,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:44:48,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:44:48,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:44:48,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:44:48,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 23:44:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 23:44:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 23:44:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 23:44:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 23:44:48,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:44:48,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:44:48,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 23:44:48,810 WARN L736 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-19 23:44:52,156 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-19 23:44:52,156 INFO L689 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-19 23:44:52,158 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:44:52,159 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:44:52,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:44:52 BoogieIcfgContainer [2019-11-19 23:44:52,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:44:52,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:44:52,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:44:52,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:44:52,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:44:47" (1/3) ... [2019-11-19 23:44:52,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55368ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:44:52, skipping insertion in model container [2019-11-19 23:44:52,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:44:48" (2/3) ... [2019-11-19 23:44:52,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55368ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:44:52, skipping insertion in model container [2019-11-19 23:44:52,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:44:52" (3/3) ... [2019-11-19 23:44:52,171 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-1.c [2019-11-19 23:44:52,180 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:44:52,188 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:44:52,198 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:44:52,226 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:44:52,226 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:44:52,227 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:44:52,227 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:44:52,227 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:44:52,228 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:44:52,228 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:44:52,228 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:44:52,251 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states. [2019-11-19 23:44:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 23:44:52,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:52,261 INFO L410 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] [2019-11-19 23:44:52,262 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:52,268 INFO L82 PathProgramCache]: Analyzing trace with hash 556191018, now seen corresponding path program 1 times [2019-11-19 23:44:52,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:44:52,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [639049025] [2019-11-19 23:44:52,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:44:52,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:52,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:44:52,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:44:52,521 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-19 23:44:52,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:44:52,552 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-19 23:44:52,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639049025] [2019-11-19 23:44:52,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:52,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:44:52,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445846756] [2019-11-19 23:44:52,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:52,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:44:52,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:52,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:52,578 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 4 states. [2019-11-19 23:44:52,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:52,779 INFO L93 Difference]: Finished difference Result 552 states and 941 transitions. [2019-11-19 23:44:52,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:52,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-11-19 23:44:52,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:52,805 INFO L225 Difference]: With dead ends: 552 [2019-11-19 23:44:52,806 INFO L226 Difference]: Without dead ends: 375 [2019-11-19 23:44:52,811 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 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-19 23:44:52,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-11-19 23:44:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2019-11-19 23:44:52,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2019-11-19 23:44:52,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 571 transitions. [2019-11-19 23:44:52,884 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 571 transitions. Word has length 42 [2019-11-19 23:44:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:52,884 INFO L462 AbstractCegarLoop]: Abstraction has 375 states and 571 transitions. [2019-11-19 23:44:52,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 571 transitions. [2019-11-19 23:44:52,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-19 23:44:52,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:52,891 INFO L410 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] [2019-11-19 23:44:53,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:44:53,093 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:53,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash -755732600, now seen corresponding path program 1 times [2019-11-19 23:44:53,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:44:53,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1205959112] [2019-11-19 23:44:53,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:44:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:53,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:44:53,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:44:53,387 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-19 23:44:53,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:44:53,427 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-19 23:44:53,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1205959112] [2019-11-19 23:44:53,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:53,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:44:53,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452399992] [2019-11-19 23:44:53,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:53,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:44:53,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:53,432 INFO L87 Difference]: Start difference. First operand 375 states and 571 transitions. Second operand 4 states. [2019-11-19 23:44:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:54,167 INFO L93 Difference]: Finished difference Result 860 states and 1321 transitions. [2019-11-19 23:44:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:54,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-11-19 23:44:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:54,174 INFO L225 Difference]: With dead ends: 860 [2019-11-19 23:44:54,174 INFO L226 Difference]: Without dead ends: 615 [2019-11-19 23:44:54,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 202 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-19 23:44:54,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-11-19 23:44:54,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-11-19 23:44:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-11-19 23:44:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 934 transitions. [2019-11-19 23:44:54,239 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 934 transitions. Word has length 103 [2019-11-19 23:44:54,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:54,240 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 934 transitions. [2019-11-19 23:44:54,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 934 transitions. [2019-11-19 23:44:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-19 23:44:54,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:54,248 INFO L410 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-19 23:44:54,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:44:54,459 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1345852583, now seen corresponding path program 1 times [2019-11-19 23:44:54,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:44:54,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1464339299] [2019-11-19 23:44:54,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:44:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:54,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:44:54,816 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:44:54,866 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-19 23:44:54,866 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:44:54,908 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-19 23:44:54,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1464339299] [2019-11-19 23:44:54,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:54,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 23:44:54,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945005606] [2019-11-19 23:44:54,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:44:54,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:44:54,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:44:54,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:44:54,920 INFO L87 Difference]: Start difference. First operand 615 states and 934 transitions. Second operand 3 states. [2019-11-19 23:44:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:55,750 INFO L93 Difference]: Finished difference Result 1220 states and 1860 transitions. [2019-11-19 23:44:55,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:44:55,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-11-19 23:44:55,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:55,756 INFO L225 Difference]: With dead ends: 1220 [2019-11-19 23:44:55,756 INFO L226 Difference]: Without dead ends: 735 [2019-11-19 23:44:55,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 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-19 23:44:55,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-11-19 23:44:55,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2019-11-19 23:44:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-11-19 23:44:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1114 transitions. [2019-11-19 23:44:55,797 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1114 transitions. Word has length 167 [2019-11-19 23:44:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:55,798 INFO L462 AbstractCegarLoop]: Abstraction has 735 states and 1114 transitions. [2019-11-19 23:44:55,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:44:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1114 transitions. [2019-11-19 23:44:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-19 23:44:55,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:55,803 INFO L410 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] [2019-11-19 23:44:56,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:44:56,007 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:56,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:56,007 INFO L82 PathProgramCache]: Analyzing trace with hash -892992621, now seen corresponding path program 1 times [2019-11-19 23:44:56,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:44:56,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [93907187] [2019-11-19 23:44:56,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:44:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:44:56,310 INFO L255 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:44:56,316 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:44:56,376 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-19 23:44:56,376 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:44:56,436 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-19 23:44:56,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [93907187] [2019-11-19 23:44:56,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:44:56,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 23:44:56,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222857477] [2019-11-19 23:44:56,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:44:56,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:44:56,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:44:56,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:44:56,440 INFO L87 Difference]: Start difference. First operand 735 states and 1114 transitions. Second operand 4 states. [2019-11-19 23:44:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:44:56,780 INFO L93 Difference]: Finished difference Result 1580 states and 2406 transitions. [2019-11-19 23:44:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:44:56,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-11-19 23:44:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:44:56,787 INFO L225 Difference]: With dead ends: 1580 [2019-11-19 23:44:56,788 INFO L226 Difference]: Without dead ends: 975 [2019-11-19 23:44:56,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 412 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-19 23:44:56,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2019-11-19 23:44:56,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 975. [2019-11-19 23:44:56,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 975 states. [2019-11-19 23:44:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1476 transitions. [2019-11-19 23:44:56,837 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1476 transitions. Word has length 208 [2019-11-19 23:44:56,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:44:56,840 INFO L462 AbstractCegarLoop]: Abstraction has 975 states and 1476 transitions. [2019-11-19 23:44:56,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:44:56,840 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1476 transitions. [2019-11-19 23:44:56,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-11-19 23:44:56,846 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:44:56,846 INFO L410 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] [2019-11-19 23:44:57,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:44:57,049 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:44:57,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:44:57,049 INFO L82 PathProgramCache]: Analyzing trace with hash 72434664, now seen corresponding path program 1 times [2019-11-19 23:44:57,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:44:57,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [769222937] [2019-11-19 23:44:57,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:45:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:45:00,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-19 23:45:00,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:45:01,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 23:45:01,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:03,132 WARN L191 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-19 23:45:03,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:03,138 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_181|, |v_#memory_$Pointer$.offset_180|], 2=[|v_#memory_$Pointer$.base_178|, |v_#memory_$Pointer$.offset_177|, |v_#memory_$Pointer$.base_177|, |v_#memory_$Pointer$.offset_178|]} [2019-11-19 23:45:03,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:03,364 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:03,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:03,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:03,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:03,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:03,798 INFO L237 Elim1Store]: Index analysis took 536 ms [2019-11-19 23:45:04,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-19 23:45:04,239 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:05,368 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 23:45:05,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:05,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:05,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:05,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:05,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:05,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:05,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:05,779 INFO L237 Elim1Store]: Index analysis took 304 ms [2019-11-19 23:45:06,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-19 23:45:06,069 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:06,758 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-19 23:45:06,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:06,812 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:06,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:06,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:06,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:06,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:06,886 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:06,886 INFO L237 Elim1Store]: Index analysis took 105 ms [2019-11-19 23:45:06,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-19 23:45:06,972 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,261 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-19 23:45:07,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-19 23:45:07,333 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,442 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,447 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,448 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-19 23:45:07,449 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,544 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-19 23:45:07,555 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,593 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-19 23:45:07,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,633 INFO L377 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 30 treesize of output 14 [2019-11-19 23:45:07,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,655 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,661 INFO L377 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 29 treesize of output 13 [2019-11-19 23:45:07,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,676 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,676 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,677 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:45:07,687 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,688 INFO L377 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 30 treesize of output 14 [2019-11-19 23:45:07,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,721 INFO L377 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 29 treesize of output 13 [2019-11-19 23:45:07,721 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,737 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,737 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:45:07,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,791 INFO L377 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 30 treesize of output 14 [2019-11-19 23:45:07,792 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,904 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-19 23:45:07,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,918 INFO L377 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 29 treesize of output 13 [2019-11-19 23:45:07,918 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,960 INFO L377 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 30 treesize of output 14 [2019-11-19 23:45:07,960 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,979 INFO L377 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 29 treesize of output 13 [2019-11-19 23:45:07,979 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:07,987 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:45:07,988 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-19 23:45:07,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:07,999 INFO L377 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 30 treesize of output 14 [2019-11-19 23:45:07,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:08,019 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,020 INFO L377 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 29 treesize of output 13 [2019-11-19 23:45:08,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:08,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,030 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:45:08,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,039 INFO L377 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 29 treesize of output 13 [2019-11-19 23:45:08,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,066 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:08,070 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,071 INFO L377 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 30 treesize of output 14 [2019-11-19 23:45:08,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:08,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,088 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:45:08,097 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_186|], 12=[|v_#memory_$Pointer$.base_187|]} [2019-11-19 23:45:08,101 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,102 INFO L377 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 59 treesize of output 41 [2019-11-19 23:45:08,103 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-19 23:45:08,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:08,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,199 INFO L343 Elim1Store]: treesize reduction 30, result has 58.3 percent of original size [2019-11-19 23:45:08,199 INFO L377 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2019-11-19 23:45:08,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:08,227 INFO L567 ElimStorePlain]: treesize reduction 80, result has 32.8 percent of original size [2019-11-19 23:45:08,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:08,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:39 [2019-11-19 23:45:08,261 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_180|], 20=[|v_#memory_$Pointer$.base_188|]} [2019-11-19 23:45:08,266 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-19 23:45:08,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:08,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:08,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:24,752 WARN L191 SmtUtils]: Spent 16.42 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-19 23:45:24,753 INFO L343 Elim1Store]: treesize reduction 11, result has 92.1 percent of original size [2019-11-19 23:45:24,753 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 176 [2019-11-19 23:45:24,755 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:24,844 INFO L567 ElimStorePlain]: treesize reduction 185, result has 20.6 percent of original size [2019-11-19 23:45:24,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:24,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:39 [2019-11-19 23:45:24,914 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_197|], 20=[|v_#memory_$Pointer$.base_189|]} [2019-11-19 23:45:24,922 INFO L377 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-19 23:45:24,922 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:24,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:24,956 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:24,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:24,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:24,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:24,960 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:24,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:33,089 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 23:45:33,090 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:33,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 134 [2019-11-19 23:45:33,091 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:33,131 INFO L567 ElimStorePlain]: treesize reduction 134, result has 26.4 percent of original size [2019-11-19 23:45:33,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:33,132 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:48 [2019-11-19 23:45:33,160 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_187|], 2=[|v_#memory_int_198|], 12=[|v_#memory_$Pointer$.base_190|]} [2019-11-19 23:45:33,165 INFO L377 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-19 23:45:33,165 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-19 23:45:33,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:33,193 INFO L377 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 35 treesize of output 28 [2019-11-19 23:45:33,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:33,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:33,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:33,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:33,221 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:33,256 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:33,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 69 [2019-11-19 23:45:33,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:45:33,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:45:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:45:33,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:45:33,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:45:33,278 INFO L496 ElimStorePlain]: Start of recursive call 4: 6 dim-0 vars, End of recursive call: 6 dim-0 vars, and 4 xjuncts. [2019-11-19 23:45:33,502 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-19 23:45:33,503 INFO L567 ElimStorePlain]: treesize reduction 16, result has 87.3 percent of original size [2019-11-19 23:45:33,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:45:33,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:33,506 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:84 [2019-11-19 23:45:33,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:45:33,601 INFO L377 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-19 23:45:33,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:33,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:33,626 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-19 23:45:33,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:37 [2019-11-19 23:45:33,719 INFO L377 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 33 treesize of output 15 [2019-11-19 23:45:33,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:33,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:33,727 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-19 23:45:33,727 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:37, output treesize:3 [2019-11-19 23:45:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 410 proven. 160 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-19 23:45:34,143 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:45:34,233 INFO L377 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-19 23:45:34,233 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-19 23:45:34,244 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,245 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-19 23:45:34,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-19 23:45:34,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:45:34,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,338 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-19 23:45:34,353 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:34,354 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:15 [2019-11-19 23:45:34,407 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_201|], 2=[|v_#memory_$Pointer$.base_180|]} [2019-11-19 23:45:34,410 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-19 23:45:34,425 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,428 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-19 23:45:34,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,432 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:34,432 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:25 [2019-11-19 23:45:34,566 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_200|], 20=[|v_#memory_$Pointer$.base_203|]} [2019-11-19 23:45:34,570 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-19 23:45:34,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,618 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-19 23:45:34,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:34,629 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:102, output treesize:116 [2019-11-19 23:45:34,790 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_201|], 1=[|v_#memory_$Pointer$.base_204|]} [2019-11-19 23:45:34,794 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-19 23:45:34,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,865 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-19 23:45:34,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:34,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:34,878 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:157, output treesize:156 [2019-11-19 23:45:35,086 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_202|], 1=[|v_#memory_$Pointer$.base_205|], 2=[|v_#memory_$Pointer$.base_179|, |v_#memory_$Pointer$.offset_179|]} [2019-11-19 23:45:35,099 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-19 23:45:35,365 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-19 23:45:35,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:35,369 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-19 23:45:35,533 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-19 23:45:35,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:35,536 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:35,596 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:35,598 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:35,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:35,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:35,614 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:237, output treesize:236 [2019-11-19 23:45:35,917 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_203|], 1=[|v_#memory_$Pointer$.base_206|]} [2019-11-19 23:45:35,921 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-19 23:45:35,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:35,983 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-19 23:45:35,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:35,995 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:35,995 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:197, output treesize:196 [2019-11-19 23:45:36,533 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_204|], 1=[|v_#memory_$Pointer$.base_207|]} [2019-11-19 23:45:36,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-19 23:45:36,641 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-19 23:45:36,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:36,643 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-19 23:45:36,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:45:36,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-11-19 23:45:36,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:237, output treesize:236 [2019-11-19 23:45:38,286 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 410 proven. 199 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-19 23:45:38,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769222937] [2019-11-19 23:45:38,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 23:45:38,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-11-19 23:45:38,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153451666] [2019-11-19 23:45:38,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 23:45:38,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:45:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 23:45:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-11-19 23:45:38,289 INFO L87 Difference]: Start difference. First operand 975 states and 1476 transitions. Second operand 17 states. [2019-11-19 23:46:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:46:43,893 INFO L93 Difference]: Finished difference Result 7046 states and 10722 transitions. [2019-11-19 23:46:43,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 23:46:43,895 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 290 [2019-11-19 23:46:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:46:43,927 INFO L225 Difference]: With dead ends: 7046 [2019-11-19 23:46:43,927 INFO L226 Difference]: Without dead ends: 6079 [2019-11-19 23:46:43,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 560 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=193, Invalid=509, Unknown=0, NotChecked=0, Total=702 [2019-11-19 23:46:43,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6079 states. [2019-11-19 23:46:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6079 to 2482. [2019-11-19 23:46:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-11-19 23:46:44,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3986 transitions. [2019-11-19 23:46:44,063 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3986 transitions. Word has length 290 [2019-11-19 23:46:44,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:46:44,063 INFO L462 AbstractCegarLoop]: Abstraction has 2482 states and 3986 transitions. [2019-11-19 23:46:44,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 23:46:44,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3986 transitions. [2019-11-19 23:46:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2019-11-19 23:46:44,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:46:44,071 INFO L410 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, 6, 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] [2019-11-19 23:46:44,282 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:46:44,288 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:46:44,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:46:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1427416300, now seen corresponding path program 1 times [2019-11-19 23:46:44,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:46:44,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1392431094] [2019-11-19 23:46:44,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:46:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:46:47,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-19 23:46:47,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:46:48,040 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-19 23:46:48,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:48,988 WARN L191 SmtUtils]: Spent 947.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-19 23:46:48,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:48,990 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_209|, |v_#memory_$Pointer$.base_213|], 2=[|v_#memory_$Pointer$.offset_206|, |v_#memory_$Pointer$.base_209|, |v_#memory_$Pointer$.offset_207|, |v_#memory_$Pointer$.base_210|]} [2019-11-19 23:46:49,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:49,173 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:49,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:49,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:49,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:49,360 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:49,455 INFO L237 Elim1Store]: Index analysis took 370 ms [2019-11-19 23:46:49,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-19 23:46:49,891 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:50,696 WARN L191 SmtUtils]: Spent 804.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 23:46:50,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:50,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:50,800 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:50,821 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:50,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:50,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:50,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:50,921 INFO L237 Elim1Store]: Index analysis took 168 ms [2019-11-19 23:46:51,106 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 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-19 23:46:51,107 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:51,704 WARN L191 SmtUtils]: Spent 597.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-19 23:46:51,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:51,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:51,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:51,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:51,798 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:51,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:51,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:51,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-19 23:46:51,914 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,221 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-19 23:46:52,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,225 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:46:52,453 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-19 23:46:52,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 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-19 23:46:52,501 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,618 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 23:46:52,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,626 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,634 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-11-19 23:46:52,634 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,668 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-19 23:46:52,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,699 INFO L377 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 30 treesize of output 14 [2019-11-19 23:46:52,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,727 INFO L377 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 29 treesize of output 13 [2019-11-19 23:46:52,728 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,742 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,743 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:46:52,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,758 INFO L377 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 30 treesize of output 14 [2019-11-19 23:46:52,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:52,790 INFO L377 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 29 treesize of output 13 [2019-11-19 23:46:52,790 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:52,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:46:52,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:46:52,811 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-19 23:46:53,036 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-19 23:46:53,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,058 INFO L377 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 30 treesize of output 14 [2019-11-19 23:46:53,058 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,117 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,117 INFO L377 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 30 treesize of output 14 [2019-11-19 23:46:53,118 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-11-19 23:46:53,149 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,161 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-19 23:46:53,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,168 INFO L377 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 30 treesize of output 14 [2019-11-19 23:46:53,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,187 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,187 INFO L377 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 29 treesize of output 13 [2019-11-19 23:46:53,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,208 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:46:53,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,218 INFO L377 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 29 treesize of output 13 [2019-11-19 23:46:53,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,245 INFO L377 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 30 treesize of output 14 [2019-11-19 23:46:53,246 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,257 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-19 23:46:53,261 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_215|], 12=[|v_#memory_$Pointer$.base_219|]} [2019-11-19 23:46:53,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,265 INFO L377 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 59 treesize of output 41 [2019-11-19 23:46:53,266 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-19 23:46:53,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,366 INFO L343 Elim1Store]: treesize reduction 30, result has 58.3 percent of original size [2019-11-19 23:46:53,366 INFO L377 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 5 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2019-11-19 23:46:53,367 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:46:53,404 INFO L567 ElimStorePlain]: treesize reduction 76, result has 33.9 percent of original size [2019-11-19 23:46:53,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:46:53,405 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:39 [2019-11-19 23:46:53,432 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_212|], 20=[|v_#memory_$Pointer$.base_220|]} [2019-11-19 23:46:53,437 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-19 23:46:53,496 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:46:53,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:46:53,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:09,849 WARN L191 SmtUtils]: Spent 16.34 s on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-11-19 23:47:09,850 INFO L343 Elim1Store]: treesize reduction 11, result has 92.1 percent of original size [2019-11-19 23:47:09,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 176 [2019-11-19 23:47:09,851 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:09,902 INFO L567 ElimStorePlain]: treesize reduction 185, result has 20.6 percent of original size [2019-11-19 23:47:09,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:47:09,903 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:77, output treesize:39 [2019-11-19 23:47:09,928 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_218|], 20=[|v_#memory_$Pointer$.base_221|]} [2019-11-19 23:47:09,939 INFO L377 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-19 23:47:09,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:09,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:09,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:09,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:09,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:09,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:09,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:09,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:18,179 WARN L191 SmtUtils]: Spent 8.19 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-19 23:47:18,179 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:18,180 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 134 [2019-11-19 23:47:18,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:18,227 INFO L567 ElimStorePlain]: treesize reduction 134, result has 26.4 percent of original size [2019-11-19 23:47:18,227 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:47:18,227 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:48 [2019-11-19 23:47:18,255 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_216|], 2=[|v_#memory_int_219|], 12=[|v_#memory_$Pointer$.base_222|]} [2019-11-19 23:47:18,265 INFO L377 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-19 23:47:18,266 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-19 23:47:18,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:18,313 INFO L377 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 35 treesize of output 28 [2019-11-19 23:47:18,313 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:18,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:18,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:18,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:18,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:18,405 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:18,405 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 51 treesize of output 69 [2019-11-19 23:47:18,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:18,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:18,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:18,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:18,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:18,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:47:18,410 INFO L496 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 23:47:18,553 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-19 23:47:18,553 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.2 percent of original size [2019-11-19 23:47:18,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:47:18,555 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-19 23:47:18,555 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:79, output treesize:56 [2019-11-19 23:47:18,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:18,625 INFO L377 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-19 23:47:18,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:18,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:18,653 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-19 23:47:18,654 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:35 [2019-11-19 23:47:18,725 INFO L377 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-19 23:47:18,726 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:18,732 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:18,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:18,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-11-19 23:47:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 415 proven. 162 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-19 23:47:19,110 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:47:19,174 INFO L377 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-19 23:47:19,174 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-19 23:47:19,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:19,181 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-19 23:47:19,181 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:32 [2019-11-19 23:47:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 724 backedges. 513 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2019-11-19 23:47:19,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1392431094] [2019-11-19 23:47:19,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:47:19,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-11-19 23:47:19,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308603719] [2019-11-19 23:47:19,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:19,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:47:19,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:19,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-19 23:47:19,287 INFO L87 Difference]: Start difference. First operand 2482 states and 3986 transitions. Second operand 4 states. [2019-11-19 23:47:22,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:22,164 INFO L93 Difference]: Finished difference Result 6678 states and 10634 transitions. [2019-11-19 23:47:22,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:22,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 292 [2019-11-19 23:47:22,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:22,188 INFO L225 Difference]: With dead ends: 6678 [2019-11-19 23:47:22,188 INFO L226 Difference]: Without dead ends: 4204 [2019-11-19 23:47:22,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 572 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 23:47:22,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4204 states. [2019-11-19 23:47:22,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4204 to 3122. [2019-11-19 23:47:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3122 states. [2019-11-19 23:47:22,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3122 states to 3122 states and 5170 transitions. [2019-11-19 23:47:22,331 INFO L78 Accepts]: Start accepts. Automaton has 3122 states and 5170 transitions. Word has length 292 [2019-11-19 23:47:22,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:22,332 INFO L462 AbstractCegarLoop]: Abstraction has 3122 states and 5170 transitions. [2019-11-19 23:47:22,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:22,332 INFO L276 IsEmpty]: Start isEmpty. Operand 3122 states and 5170 transitions. [2019-11-19 23:47:22,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-19 23:47:22,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:22,342 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:22,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:47:22,561 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:22,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:22,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1993324472, now seen corresponding path program 1 times [2019-11-19 23:47:22,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:47:22,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [372812400] [2019-11-19 23:47:22,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:47:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:23,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:47:23,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:23,244 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_227|, |v_#memory_$Pointer$.base_233|], 4=[|v_#memory_int_231|]} [2019-11-19 23:47:23,246 INFO L377 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 109 treesize of output 85 [2019-11-19 23:47:23,246 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-19 23:47:23,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:23,257 INFO L377 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 85 treesize of output 49 [2019-11-19 23:47:23,257 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-19 23:47:23,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:23,297 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:23,297 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:47:23,298 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:31,395 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:47:31,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:31,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:31,396 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:47:31,408 INFO L377 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 19 treesize of output 7 [2019-11-19 23:47:31,408 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:31,409 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:31,409 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-19 23:47:31,410 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:47:31,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-19 23:47:31,508 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:47:31,597 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-19 23:47:31,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [372812400] [2019-11-19 23:47:31,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:31,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:47:31,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847759266] [2019-11-19 23:47:31,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:47:31,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:47:31,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:47:31,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:47:31,601 INFO L87 Difference]: Start difference. First operand 3122 states and 5170 transitions. Second operand 6 states. [2019-11-19 23:47:40,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:40,791 INFO L93 Difference]: Finished difference Result 8052 states and 12981 transitions. [2019-11-19 23:47:40,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:47:40,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 304 [2019-11-19 23:47:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:40,817 INFO L225 Difference]: With dead ends: 8052 [2019-11-19 23:47:40,817 INFO L226 Difference]: Without dead ends: 5326 [2019-11-19 23:47:40,821 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:47:40,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2019-11-19 23:47:40,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 3285. [2019-11-19 23:47:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2019-11-19 23:47:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 5422 transitions. [2019-11-19 23:47:40,974 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 5422 transitions. Word has length 304 [2019-11-19 23:47:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:40,974 INFO L462 AbstractCegarLoop]: Abstraction has 3285 states and 5422 transitions. [2019-11-19 23:47:40,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:47:40,975 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 5422 transitions. [2019-11-19 23:47:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-19 23:47:40,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:40,985 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:41,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:47:41,190 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:41,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash 463622936, now seen corresponding path program 2 times [2019-11-19 23:47:41,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:47:41,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [338921017] [2019-11-19 23:47:41,191 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:47:42,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:47:42,156 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:47:42,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 23:47:42,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:42,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:47:42,200 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-19 23:47:42,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,207 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:42,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,208 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-19 23:47:42,221 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:42,222 INFO L377 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:47:42,222 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:42,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,224 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:47:42,282 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 121 proven. 1 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-19 23:47:42,282 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:47:42,308 INFO L377 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 22 treesize of output 20 [2019-11-19 23:47:42,311 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:42,312 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:42,316 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:42,316 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-19 23:47:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-19 23:47:42,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [338921017] [2019-11-19 23:47:42,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:47:42,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-19 23:47:42,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43580160] [2019-11-19 23:47:42,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:47:42,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:47:42,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:47:42,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-19 23:47:42,361 INFO L87 Difference]: Start difference. First operand 3285 states and 5422 transitions. Second operand 4 states. [2019-11-19 23:47:44,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:47:44,794 INFO L93 Difference]: Finished difference Result 6116 states and 9774 transitions. [2019-11-19 23:47:44,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:47:44,795 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-11-19 23:47:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:47:44,810 INFO L225 Difference]: With dead ends: 6116 [2019-11-19 23:47:44,810 INFO L226 Difference]: Without dead ends: 4359 [2019-11-19 23:47:44,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 601 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:47:44,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4359 states. [2019-11-19 23:47:44,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4359 to 3285. [2019-11-19 23:47:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3285 states. [2019-11-19 23:47:44,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3285 states to 3285 states and 5381 transitions. [2019-11-19 23:47:44,956 INFO L78 Accepts]: Start accepts. Automaton has 3285 states and 5381 transitions. Word has length 304 [2019-11-19 23:47:44,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:47:44,956 INFO L462 AbstractCegarLoop]: Abstraction has 3285 states and 5381 transitions. [2019-11-19 23:47:44,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:47:44,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3285 states and 5381 transitions. [2019-11-19 23:47:44,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-19 23:47:44,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:47:44,964 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:47:45,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:47:45,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:47:45,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:47:45,171 INFO L82 PathProgramCache]: Analyzing trace with hash -2069337052, now seen corresponding path program 1 times [2019-11-19 23:47:45,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:47:45,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [722042900] [2019-11-19 23:47:45,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/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-19 23:47:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:47:45,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:47:45,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:47:45,899 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_271|, |v_#memory_$Pointer$.offset_265|], 4=[|v_#memory_int_270|]} [2019-11-19 23:47:45,916 INFO L377 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 109 treesize of output 73 [2019-11-19 23:47:45,916 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-19 23:47:45,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:45,926 INFO L377 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 73 treesize of output 49 [2019-11-19 23:47:45,926 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-19 23:47:45,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:45,967 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:45,967 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:47:45,968 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:54,095 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:47:54,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:54,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:47:54,096 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:47:54,111 INFO L377 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 19 treesize of output 7 [2019-11-19 23:47:54,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:47:54,113 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:47:54,113 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-19 23:47:54,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:47:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-19 23:47:54,174 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:47:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 498 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2019-11-19 23:47:54,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [722042900] [2019-11-19 23:47:54,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:47:54,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:47:54,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946307884] [2019-11-19 23:47:54,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:47:54,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:47:54,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:47:54,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:47:54,259 INFO L87 Difference]: Start difference. First operand 3285 states and 5381 transitions. Second operand 6 states. [2019-11-19 23:48:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:01,813 INFO L93 Difference]: Finished difference Result 8867 states and 14199 transitions. [2019-11-19 23:48:01,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:48:01,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 304 [2019-11-19 23:48:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:01,847 INFO L225 Difference]: With dead ends: 8867 [2019-11-19 23:48:01,847 INFO L226 Difference]: Without dead ends: 5601 [2019-11-19 23:48:01,851 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:01,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5601 states. [2019-11-19 23:48:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5601 to 3813. [2019-11-19 23:48:02,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3813 states. [2019-11-19 23:48:02,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 6313 transitions. [2019-11-19 23:48:02,040 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 6313 transitions. Word has length 304 [2019-11-19 23:48:02,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:02,041 INFO L462 AbstractCegarLoop]: Abstraction has 3813 states and 6313 transitions. [2019-11-19 23:48:02,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:48:02,041 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 6313 transitions. [2019-11-19 23:48:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-19 23:48:02,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:02,050 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:02,255 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:02,255 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:02,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:02,256 INFO L82 PathProgramCache]: Analyzing trace with hash 567861804, now seen corresponding path program 2 times [2019-11-19 23:48:02,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:48:02,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [124126046] [2019-11-19 23:48:02,257 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:03,223 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:48:03,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:48:03,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 668 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:48:03,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:03,265 INFO L377 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-19 23:48:03,266 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:03,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:03,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:03,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-19 23:48:03,316 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:48:03,317 INFO L377 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-19 23:48:03,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:03,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:03,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:03,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 23:48:03,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:03,347 INFO L377 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:48:03,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:03,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:03,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:03,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:48:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 219 proven. 2 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-11-19 23:48:03,406 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:48:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 768 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-11-19 23:48:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [124126046] [2019-11-19 23:48:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:48:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-19 23:48:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955869965] [2019-11-19 23:48:03,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:48:03,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:48:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:48:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:03,481 INFO L87 Difference]: Start difference. First operand 3813 states and 6313 transitions. Second operand 4 states. [2019-11-19 23:48:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:05,843 INFO L93 Difference]: Finished difference Result 6896 states and 11083 transitions. [2019-11-19 23:48:05,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:48:05,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 304 [2019-11-19 23:48:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:05,853 INFO L225 Difference]: With dead ends: 6896 [2019-11-19 23:48:05,853 INFO L226 Difference]: Without dead ends: 4875 [2019-11-19 23:48:05,856 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 599 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:48:05,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2019-11-19 23:48:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3813. [2019-11-19 23:48:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3813 states. [2019-11-19 23:48:05,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 6260 transitions. [2019-11-19 23:48:05,998 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 6260 transitions. Word has length 304 [2019-11-19 23:48:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:05,999 INFO L462 AbstractCegarLoop]: Abstraction has 3813 states and 6260 transitions. [2019-11-19 23:48:05,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:48:05,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 6260 transitions. [2019-11-19 23:48:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-19 23:48:06,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:06,008 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:06,214 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:06,215 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:06,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:06,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1808374297, now seen corresponding path program 1 times [2019-11-19 23:48:06,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:48:06,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [852788426] [2019-11-19 23:48:06,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:06,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:48:06,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:06,874 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_295|, |v_#memory_$Pointer$.base_301|], 4=[|v_#memory_int_302|]} [2019-11-19 23:48:06,878 INFO L377 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 109 treesize of output 85 [2019-11-19 23:48:06,879 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-19 23:48:06,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:06,893 INFO L377 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 85 treesize of output 49 [2019-11-19 23:48:06,893 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-19 23:48:06,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:06,961 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:06,961 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:48:06,962 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:15,096 WARN L191 SmtUtils]: Spent 8.13 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:48:15,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:15,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:15,096 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:48:15,103 INFO L377 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 19 treesize of output 7 [2019-11-19 23:48:15,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:15,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:15,107 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-19 23:48:15,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:48:15,163 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-19 23:48:15,163 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:48:15,246 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2019-11-19 23:48:15,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [852788426] [2019-11-19 23:48:15,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:15,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:48:15,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161902747] [2019-11-19 23:48:15,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:48:15,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:48:15,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:48:15,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:48:15,249 INFO L87 Difference]: Start difference. First operand 3813 states and 6260 transitions. Second operand 6 states. [2019-11-19 23:48:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:23,308 INFO L93 Difference]: Finished difference Result 10033 states and 16116 transitions. [2019-11-19 23:48:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:48:23,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 305 [2019-11-19 23:48:23,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:23,322 INFO L225 Difference]: With dead ends: 10033 [2019-11-19 23:48:23,322 INFO L226 Difference]: Without dead ends: 6239 [2019-11-19 23:48:23,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 610 GetRequests, 604 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:23,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6239 states. [2019-11-19 23:48:23,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6239 to 4121. [2019-11-19 23:48:23,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2019-11-19 23:48:23,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6720 transitions. [2019-11-19 23:48:23,492 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6720 transitions. Word has length 305 [2019-11-19 23:48:23,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:23,492 INFO L462 AbstractCegarLoop]: Abstraction has 4121 states and 6720 transitions. [2019-11-19 23:48:23,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:48:23,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6720 transitions. [2019-11-19 23:48:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-11-19 23:48:23,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:23,500 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:23,705 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:23,705 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:23,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1547772243, now seen corresponding path program 2 times [2019-11-19 23:48:23,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:48:23,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1184059071] [2019-11-19 23:48:23,707 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:24,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 23:48:24,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 23:48:24,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:48:24,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:24,696 INFO L377 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-19 23:48:24,696 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:24,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:24,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:24,703 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2019-11-19 23:48:24,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:48:24,729 INFO L377 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-19 23:48:24,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:24,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:24,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:24,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 23:48:24,767 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:24,767 INFO L377 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 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-19 23:48:24,768 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:24,769 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:24,769 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:24,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 23:48:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 227 proven. 2 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-11-19 23:48:24,870 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:48:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 547 trivial. 0 not checked. [2019-11-19 23:48:24,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1184059071] [2019-11-19 23:48:24,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:48:24,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-11-19 23:48:24,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124238379] [2019-11-19 23:48:24,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:48:24,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:48:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:48:24,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:24,941 INFO L87 Difference]: Start difference. First operand 4121 states and 6720 transitions. Second operand 4 states. [2019-11-19 23:48:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:27,653 INFO L93 Difference]: Finished difference Result 7358 states and 11690 transitions. [2019-11-19 23:48:27,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:48:27,655 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 305 [2019-11-19 23:48:27,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:27,659 INFO L225 Difference]: With dead ends: 7358 [2019-11-19 23:48:27,659 INFO L226 Difference]: Without dead ends: 5183 [2019-11-19 23:48:27,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 601 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 23:48:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5183 states. [2019-11-19 23:48:27,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5183 to 4121. [2019-11-19 23:48:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4121 states. [2019-11-19 23:48:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6653 transitions. [2019-11-19 23:48:27,821 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6653 transitions. Word has length 305 [2019-11-19 23:48:27,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:27,822 INFO L462 AbstractCegarLoop]: Abstraction has 4121 states and 6653 transitions. [2019-11-19 23:48:27,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:48:27,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6653 transitions. [2019-11-19 23:48:27,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-19 23:48:27,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:27,867 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:28,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:28,068 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:28,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:28,068 INFO L82 PathProgramCache]: Analyzing trace with hash -725064623, now seen corresponding path program 1 times [2019-11-19 23:48:28,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:48:28,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [762888066] [2019-11-19 23:48:28,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:28,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:48:28,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:28,723 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_329|, |v_#memory_$Pointer$.base_335|], 4=[|v_#memory_int_338|]} [2019-11-19 23:48:28,725 INFO L377 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 109 treesize of output 85 [2019-11-19 23:48:28,725 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-19 23:48:28,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:28,739 INFO L377 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 85 treesize of output 49 [2019-11-19 23:48:28,740 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-19 23:48:28,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:28,780 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:28,780 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:48:28,780 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:36,880 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:48:36,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:36,881 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:36,881 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:48:36,888 INFO L377 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 19 treesize of output 7 [2019-11-19 23:48:36,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:36,890 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:36,890 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-19 23:48:36,890 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:48:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-11-19 23:48:36,952 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:48:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2019-11-19 23:48:37,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [762888066] [2019-11-19 23:48:37,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:37,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:48:37,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621381371] [2019-11-19 23:48:37,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:48:37,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:48:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:48:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:48:37,041 INFO L87 Difference]: Start difference. First operand 4121 states and 6653 transitions. Second operand 6 states. [2019-11-19 23:48:43,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:43,097 INFO L93 Difference]: Finished difference Result 10763 states and 17033 transitions. [2019-11-19 23:48:43,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:48:43,098 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 306 [2019-11-19 23:48:43,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:43,103 INFO L225 Difference]: With dead ends: 10763 [2019-11-19 23:48:43,103 INFO L226 Difference]: Without dead ends: 6661 [2019-11-19 23:48:43,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:43,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6661 states. [2019-11-19 23:48:43,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6661 to 4817. [2019-11-19 23:48:43,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4817 states. [2019-11-19 23:48:43,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4817 states to 4817 states and 7797 transitions. [2019-11-19 23:48:43,269 INFO L78 Accepts]: Start accepts. Automaton has 4817 states and 7797 transitions. Word has length 306 [2019-11-19 23:48:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:48:43,269 INFO L462 AbstractCegarLoop]: Abstraction has 4817 states and 7797 transitions. [2019-11-19 23:48:43,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:48:43,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4817 states and 7797 transitions. [2019-11-19 23:48:43,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-19 23:48:43,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:48:43,278 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1] [2019-11-19 23:48:43,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:43,480 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:48:43,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:48:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 131917425, now seen corresponding path program 1 times [2019-11-19 23:48:43,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:48:43,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1362415480] [2019-11-19 23:48:43,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:48:44,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:48:44,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:48:44,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:48:44,144 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_349|, |v_#memory_$Pointer$.offset_343|], 4=[|v_#memory_int_352|]} [2019-11-19 23:48:44,146 INFO L377 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 109 treesize of output 73 [2019-11-19 23:48:44,146 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-19 23:48:44,155 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:44,160 INFO L377 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 73 treesize of output 49 [2019-11-19 23:48:44,161 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-19 23:48:44,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:44,200 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:44,201 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:48:44,201 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:52,302 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:48:52,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:52,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:48:52,303 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:48:52,317 INFO L377 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 19 treesize of output 7 [2019-11-19 23:48:52,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:48:52,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:48:52,319 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-19 23:48:52,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:48:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-19 23:48:52,370 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:48:52,459 INFO L134 CoverageAnalysis]: Checked inductivity of 791 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 638 trivial. 0 not checked. [2019-11-19 23:48:52,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1362415480] [2019-11-19 23:48:52,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:48:52,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:48:52,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53695083] [2019-11-19 23:48:52,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:48:52,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:48:52,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:48:52,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:48:52,461 INFO L87 Difference]: Start difference. First operand 4817 states and 7797 transitions. Second operand 6 states. [2019-11-19 23:48:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:48:59,968 INFO L93 Difference]: Finished difference Result 11038 states and 17498 transitions. [2019-11-19 23:48:59,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:48:59,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 307 [2019-11-19 23:48:59,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:48:59,975 INFO L225 Difference]: With dead ends: 11038 [2019-11-19 23:48:59,975 INFO L226 Difference]: Without dead ends: 6821 [2019-11-19 23:48:59,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 608 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:48:59,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2019-11-19 23:49:00,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 4825. [2019-11-19 23:49:00,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2019-11-19 23:49:00,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7739 transitions. [2019-11-19 23:49:00,187 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7739 transitions. Word has length 307 [2019-11-19 23:49:00,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:00,187 INFO L462 AbstractCegarLoop]: Abstraction has 4825 states and 7739 transitions. [2019-11-19 23:49:00,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:49:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7739 transitions. [2019-11-19 23:49:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-19 23:49:00,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:00,193 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:49:00,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:00,394 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:00,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:00,394 INFO L82 PathProgramCache]: Analyzing trace with hash 68609649, now seen corresponding path program 1 times [2019-11-19 23:49:00,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:49:00,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2007670367] [2019-11-19 23:49:00,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:01,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:49:01,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:01,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:49:01,578 INFO L377 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-19 23:49:01,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:01,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:01,591 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:01,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-19 23:49:01,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:49:01,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:01,617 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-19 23:49:01,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:01,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:01,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:01,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-19 23:49:01,634 INFO L377 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 15 treesize of output 7 [2019-11-19 23:49:01,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:01,637 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:01,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:01,638 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 23:49:01,705 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-11-19 23:49:01,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:49:01,805 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-11-19 23:49:01,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2007670367] [2019-11-19 23:49:01,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:01,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:49:01,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30717898] [2019-11-19 23:49:01,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:49:01,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:49:01,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:49:01,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:49:01,807 INFO L87 Difference]: Start difference. First operand 4825 states and 7739 transitions. Second operand 6 states. [2019-11-19 23:49:07,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:07,301 INFO L93 Difference]: Finished difference Result 8483 states and 13307 transitions. [2019-11-19 23:49:07,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:49:07,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 307 [2019-11-19 23:49:07,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:07,306 INFO L225 Difference]: With dead ends: 8483 [2019-11-19 23:49:07,306 INFO L226 Difference]: Without dead ends: 5952 [2019-11-19 23:49:07,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 607 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:49:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2019-11-19 23:49:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 4825. [2019-11-19 23:49:07,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2019-11-19 23:49:07,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7656 transitions. [2019-11-19 23:49:07,441 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7656 transitions. Word has length 307 [2019-11-19 23:49:07,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:07,441 INFO L462 AbstractCegarLoop]: Abstraction has 4825 states and 7656 transitions. [2019-11-19 23:49:07,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:49:07,441 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7656 transitions. [2019-11-19 23:49:07,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-11-19 23:49:07,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:07,447 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:49:07,650 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:07,651 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:07,651 INFO L82 PathProgramCache]: Analyzing trace with hash -153651980, now seen corresponding path program 1 times [2019-11-19 23:49:07,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:49:07,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [857667467] [2019-11-19 23:49:07,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:08,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:49:08,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:08,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:49:08,833 INFO L377 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-19 23:49:08,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:08,848 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:08,849 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:08,849 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-19 23:49:08,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:49:08,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:08,861 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-19 23:49:08,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:08,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:08,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:08,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-19 23:49:08,869 INFO L377 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 15 treesize of output 7 [2019-11-19 23:49:08,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:08,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:08,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:08,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 23:49:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-11-19 23:49:08,953 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:49:09,051 INFO L134 CoverageAnalysis]: Checked inductivity of 792 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 736 trivial. 0 not checked. [2019-11-19 23:49:09,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [857667467] [2019-11-19 23:49:09,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:09,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:49:09,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535336958] [2019-11-19 23:49:09,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:49:09,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:49:09,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:49:09,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:49:09,054 INFO L87 Difference]: Start difference. First operand 4825 states and 7656 transitions. Second operand 6 states. [2019-11-19 23:49:12,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:12,543 INFO L93 Difference]: Finished difference Result 8393 states and 13062 transitions. [2019-11-19 23:49:12,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:49:12,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 308 [2019-11-19 23:49:12,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:12,548 INFO L225 Difference]: With dead ends: 8393 [2019-11-19 23:49:12,548 INFO L226 Difference]: Without dead ends: 5862 [2019-11-19 23:49:12,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 616 GetRequests, 609 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:49:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2019-11-19 23:49:12,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 4825. [2019-11-19 23:49:12,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4825 states. [2019-11-19 23:49:12,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 7573 transitions. [2019-11-19 23:49:12,683 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 7573 transitions. Word has length 308 [2019-11-19 23:49:12,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:12,684 INFO L462 AbstractCegarLoop]: Abstraction has 4825 states and 7573 transitions. [2019-11-19 23:49:12,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:49:12,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 7573 transitions. [2019-11-19 23:49:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-19 23:49:12,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:12,689 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:49:12,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:12,890 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:12,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:12,890 INFO L82 PathProgramCache]: Analyzing trace with hash 722459739, now seen corresponding path program 1 times [2019-11-19 23:49:12,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:49:12,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [528603762] [2019-11-19 23:49:12,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:13,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:13,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:49:13,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:13,624 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_405|, |v_#memory_$Pointer$.base_411|], 4=[|v_#memory_int_418|]} [2019-11-19 23:49:13,626 INFO L377 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 109 treesize of output 85 [2019-11-19 23:49:13,626 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-19 23:49:13,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:13,643 INFO L377 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 85 treesize of output 49 [2019-11-19 23:49:13,643 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-19 23:49:13,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:13,700 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:13,701 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:49:13,701 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:21,787 WARN L191 SmtUtils]: Spent 8.09 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:49:21,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:21,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:21,787 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:49:21,796 INFO L377 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 19 treesize of output 7 [2019-11-19 23:49:21,796 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:21,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:21,798 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-19 23:49:21,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:49:21,897 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2019-11-19 23:49:21,897 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:49:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2019-11-19 23:49:22,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [528603762] [2019-11-19 23:49:22,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:22,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:49:22,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113795479] [2019-11-19 23:49:22,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:49:22,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:49:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:49:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:49:22,007 INFO L87 Difference]: Start difference. First operand 4825 states and 7573 transitions. Second operand 6 states. [2019-11-19 23:49:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:27,289 INFO L93 Difference]: Finished difference Result 11275 states and 17407 transitions. [2019-11-19 23:49:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:49:27,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2019-11-19 23:49:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:27,295 INFO L225 Difference]: With dead ends: 11275 [2019-11-19 23:49:27,295 INFO L226 Difference]: Without dead ends: 6469 [2019-11-19 23:49:27,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:49:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6469 states. [2019-11-19 23:49:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6469 to 4837. [2019-11-19 23:49:27,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4837 states. [2019-11-19 23:49:27,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4837 states to 4837 states and 7569 transitions. [2019-11-19 23:49:27,439 INFO L78 Accepts]: Start accepts. Automaton has 4837 states and 7569 transitions. Word has length 334 [2019-11-19 23:49:27,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:27,439 INFO L462 AbstractCegarLoop]: Abstraction has 4837 states and 7569 transitions. [2019-11-19 23:49:27,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:49:27,439 INFO L276 IsEmpty]: Start isEmpty. Operand 4837 states and 7569 transitions. [2019-11-19 23:49:27,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-19 23:49:27,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:27,447 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:49:27,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:27,654 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:27,654 INFO L82 PathProgramCache]: Analyzing trace with hash 637371633, now seen corresponding path program 1 times [2019-11-19 23:49:27,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:49:27,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1221049133] [2019-11-19 23:49:27,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:28,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:28,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:49:28,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:28,363 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_425|, |v_#memory_$Pointer$.offset_419|], 4=[|v_#memory_int_432|]} [2019-11-19 23:49:28,369 INFO L377 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 109 treesize of output 73 [2019-11-19 23:49:28,369 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-19 23:49:28,382 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:28,384 INFO L377 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 73 treesize of output 49 [2019-11-19 23:49:28,384 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-19 23:49:28,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:28,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:28,447 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:49:28,447 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:36,587 WARN L191 SmtUtils]: Spent 8.14 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:49:36,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:36,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:36,587 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:49:36,601 INFO L377 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 19 treesize of output 7 [2019-11-19 23:49:36,601 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:36,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:36,605 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-19 23:49:36,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:49:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-19 23:49:36,747 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:49:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 628 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-19 23:49:36,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1221049133] [2019-11-19 23:49:36,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:36,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:49:36,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686232711] [2019-11-19 23:49:36,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:49:36,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:49:36,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:49:36,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:49:36,844 INFO L87 Difference]: Start difference. First operand 4837 states and 7569 transitions. Second operand 6 states. [2019-11-19 23:49:42,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:49:42,697 INFO L93 Difference]: Finished difference Result 11242 states and 17315 transitions. [2019-11-19 23:49:42,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:49:42,698 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2019-11-19 23:49:42,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:49:42,702 INFO L225 Difference]: With dead ends: 11242 [2019-11-19 23:49:42,703 INFO L226 Difference]: Without dead ends: 6280 [2019-11-19 23:49:42,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:49:42,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6280 states. [2019-11-19 23:49:42,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6280 to 4769. [2019-11-19 23:49:42,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4769 states. [2019-11-19 23:49:42,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 7453 transitions. [2019-11-19 23:49:42,852 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 7453 transitions. Word has length 334 [2019-11-19 23:49:42,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:49:42,853 INFO L462 AbstractCegarLoop]: Abstraction has 4769 states and 7453 transitions. [2019-11-19 23:49:42,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:49:42,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 7453 transitions. [2019-11-19 23:49:42,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-19 23:49:42,858 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:49:42,859 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:49:43,059 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:43,059 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:49:43,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:49:43,060 INFO L82 PathProgramCache]: Analyzing trace with hash 391446112, now seen corresponding path program 1 times [2019-11-19 23:49:43,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:49:43,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1438176730] [2019-11-19 23:49:43,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:49:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:49:43,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 23:49:43,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:49:43,776 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_437|, |v_#memory_$Pointer$.offset_431|], 4=[|v_#memory_int_444|]} [2019-11-19 23:49:43,777 INFO L377 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 109 treesize of output 73 [2019-11-19 23:49:43,778 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-19 23:49:43,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:43,787 INFO L377 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 73 treesize of output 49 [2019-11-19 23:49:43,788 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-19 23:49:43,797 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:43,828 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:43,829 INFO L377 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 2 case distinctions, treesize of input 49 treesize of output 55 [2019-11-19 23:49:43,829 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:51,933 WARN L191 SmtUtils]: Spent 8.10 s on a formula simplification that was a NOOP. DAG size: 22 [2019-11-19 23:49:51,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:51,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:49:51,933 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-11-19 23:49:51,940 INFO L377 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 19 treesize of output 7 [2019-11-19 23:49:51,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:49:51,946 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:49:51,946 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-19 23:49:51,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-19 23:49:52,049 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-11-19 23:49:52,049 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:49:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 407 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2019-11-19 23:49:52,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1438176730] [2019-11-19 23:49:52,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:49:52,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:49:52,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326406799] [2019-11-19 23:49:52,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:49:52,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:49:52,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:49:52,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:49:52,131 INFO L87 Difference]: Start difference. First operand 4769 states and 7453 transitions. Second operand 6 states. [2019-11-19 23:50:01,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:01,113 INFO L93 Difference]: Finished difference Result 10992 states and 16936 transitions. [2019-11-19 23:50:01,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:50:01,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2019-11-19 23:50:01,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:01,119 INFO L225 Difference]: With dead ends: 10992 [2019-11-19 23:50:01,119 INFO L226 Difference]: Without dead ends: 6242 [2019-11-19 23:50:01,123 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:50:01,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6242 states. [2019-11-19 23:50:01,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6242 to 4769. [2019-11-19 23:50:01,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4769 states. [2019-11-19 23:50:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4769 states to 4769 states and 7393 transitions. [2019-11-19 23:50:01,275 INFO L78 Accepts]: Start accepts. Automaton has 4769 states and 7393 transitions. Word has length 334 [2019-11-19 23:50:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:01,276 INFO L462 AbstractCegarLoop]: Abstraction has 4769 states and 7393 transitions. [2019-11-19 23:50:01,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:50:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 4769 states and 7393 transitions. [2019-11-19 23:50:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-11-19 23:50:01,282 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:01,282 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:50:01,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:01,483 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:01,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:01,483 INFO L82 PathProgramCache]: Analyzing trace with hash 725326961, now seen corresponding path program 1 times [2019-11-19 23:50:01,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:50:01,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [795167971] [2019-11-19 23:50:01,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:02,853 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:50:02,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:02,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:02,862 INFO L377 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-19 23:50:02,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:02,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:02,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:02,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-19 23:50:02,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:02,885 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:02,885 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-19 23:50:02,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:02,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:02,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:02,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-19 23:50:02,894 INFO L377 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 15 treesize of output 7 [2019-11-19 23:50:02,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:02,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:02,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:02,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 23:50:03,012 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:50:03,012 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:50:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2019-11-19 23:50:03,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [795167971] [2019-11-19 23:50:03,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:50:03,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:50:03,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37377159] [2019-11-19 23:50:03,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:50:03,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:50:03,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:50:03,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:50:03,103 INFO L87 Difference]: Start difference. First operand 4769 states and 7393 transitions. Second operand 6 states. [2019-11-19 23:50:08,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:08,046 INFO L93 Difference]: Finished difference Result 11268 states and 17343 transitions. [2019-11-19 23:50:08,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:50:08,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2019-11-19 23:50:08,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:08,052 INFO L225 Difference]: With dead ends: 11268 [2019-11-19 23:50:08,052 INFO L226 Difference]: Without dead ends: 6518 [2019-11-19 23:50:08,056 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 668 GetRequests, 661 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:50:08,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6518 states. [2019-11-19 23:50:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6518 to 5473. [2019-11-19 23:50:08,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5473 states. [2019-11-19 23:50:08,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5473 states to 5473 states and 8433 transitions. [2019-11-19 23:50:08,221 INFO L78 Accepts]: Start accepts. Automaton has 5473 states and 8433 transitions. Word has length 334 [2019-11-19 23:50:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:08,221 INFO L462 AbstractCegarLoop]: Abstraction has 5473 states and 8433 transitions. [2019-11-19 23:50:08,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:50:08,222 INFO L276 IsEmpty]: Start isEmpty. Operand 5473 states and 8433 transitions. [2019-11-19 23:50:08,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-11-19 23:50:08,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:08,227 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:50:08,433 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:08,433 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:08,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:08,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2146365459, now seen corresponding path program 1 times [2019-11-19 23:50:08,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:50:08,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2145799754] [2019-11-19 23:50:08,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:09,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:09,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:50:09,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:09,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:09,926 INFO L377 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-19 23:50:09,926 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:09,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:09,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:09,936 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-19 23:50:09,946 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:09,948 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:09,949 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-19 23:50:09,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:09,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:09,955 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:09,955 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-19 23:50:09,958 INFO L377 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 15 treesize of output 7 [2019-11-19 23:50:09,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:09,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:09,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:09,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 23:50:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-11-19 23:50:10,026 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:50:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-11-19 23:50:10,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2145799754] [2019-11-19 23:50:10,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:50:10,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:50:10,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715065485] [2019-11-19 23:50:10,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:50:10,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:50:10,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:50:10,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:50:10,113 INFO L87 Difference]: Start difference. First operand 5473 states and 8433 transitions. Second operand 6 states. [2019-11-19 23:50:14,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:14,536 INFO L93 Difference]: Finished difference Result 12186 states and 18612 transitions. [2019-11-19 23:50:14,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:50:14,537 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 347 [2019-11-19 23:50:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:14,542 INFO L225 Difference]: With dead ends: 12186 [2019-11-19 23:50:14,542 INFO L226 Difference]: Without dead ends: 6732 [2019-11-19 23:50:14,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 687 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:50:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6732 states. [2019-11-19 23:50:14,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6732 to 5601. [2019-11-19 23:50:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5601 states. [2019-11-19 23:50:14,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5601 states to 5601 states and 8504 transitions. [2019-11-19 23:50:14,732 INFO L78 Accepts]: Start accepts. Automaton has 5601 states and 8504 transitions. Word has length 347 [2019-11-19 23:50:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:14,733 INFO L462 AbstractCegarLoop]: Abstraction has 5601 states and 8504 transitions. [2019-11-19 23:50:14,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:50:14,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5601 states and 8504 transitions. [2019-11-19 23:50:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-19 23:50:14,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:14,737 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:50:14,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:14,938 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:14,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:14,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1312460854, now seen corresponding path program 1 times [2019-11-19 23:50:14,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:50:14,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1041946495] [2019-11-19 23:50:14,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:16,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:16,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 23:50:16,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:16,391 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:16,392 INFO L377 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-11-19 23:50:16,392 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:16,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:16,401 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:16,402 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:13 [2019-11-19 23:50:16,414 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:16,415 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:16,415 INFO L377 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 1 case distinctions, treesize of input 31 treesize of output 24 [2019-11-19 23:50:16,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:16,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:16,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:16,421 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:13 [2019-11-19 23:50:16,425 INFO L377 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 15 treesize of output 7 [2019-11-19 23:50:16,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:16,427 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:16,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:16,427 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 23:50:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-11-19 23:50:16,493 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:50:16,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1067 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2019-11-19 23:50:16,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1041946495] [2019-11-19 23:50:16,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:50:16,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 23:50:16,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107049673] [2019-11-19 23:50:16,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 23:50:16,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 23:50:16,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 23:50:16,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 23:50:16,577 INFO L87 Difference]: Start difference. First operand 5601 states and 8504 transitions. Second operand 6 states. [2019-11-19 23:50:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:50:21,083 INFO L93 Difference]: Finished difference Result 12120 states and 18257 transitions. [2019-11-19 23:50:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 23:50:21,086 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 348 [2019-11-19 23:50:21,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:50:21,091 INFO L225 Difference]: With dead ends: 12120 [2019-11-19 23:50:21,091 INFO L226 Difference]: Without dead ends: 6538 [2019-11-19 23:50:21,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 689 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-19 23:50:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6538 states. [2019-11-19 23:50:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6538 to 5601. [2019-11-19 23:50:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5601 states. [2019-11-19 23:50:21,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5601 states to 5601 states and 8399 transitions. [2019-11-19 23:50:21,275 INFO L78 Accepts]: Start accepts. Automaton has 5601 states and 8399 transitions. Word has length 348 [2019-11-19 23:50:21,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:50:21,275 INFO L462 AbstractCegarLoop]: Abstraction has 5601 states and 8399 transitions. [2019-11-19 23:50:21,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 23:50:21,275 INFO L276 IsEmpty]: Start isEmpty. Operand 5601 states and 8399 transitions. [2019-11-19 23:50:21,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-11-19 23:50:21,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:50:21,279 INFO L410 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, 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, 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-19 23:50:21,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:21,480 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:50:21,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:50:21,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1491464520, now seen corresponding path program 1 times [2019-11-19 23:50:21,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 23:50:21,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [180900948] [2019-11-19 23:50:21,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3990336c-5583-4683-8c6a-3119c239ac9a/bin/uautomizer/cvc4 Starting monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:23,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:50:23,764 INFO L255 TraceCheckSpWp]: Trace formula consists of 744 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 23:50:23,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:50:23,778 INFO L377 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-19 23:50:23,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:23,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:23,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:23,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-19 23:50:23,799 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_523|, |v_#memory_$Pointer$.base_529|], 6=[|v_#memory_int_543|]} [2019-11-19 23:50:23,808 INFO L377 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-19 23:50:23,809 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-19 23:50:23,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:23,890 INFO L377 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-19 23:50:23,890 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-19 23:50:23,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:23,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,001 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:24,001 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 103 [2019-11-19 23:50:24,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:24,002 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:24,058 INFO L567 ElimStorePlain]: treesize reduction 56, result has 44.0 percent of original size [2019-11-19 23:50:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:24,059 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-19 23:50:24,060 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:54, output treesize:44 [2019-11-19 23:50:24,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:24,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:24,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,115 INFO L377 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 38 treesize of output 40 [2019-11-19 23:50:24,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:24,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,181 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:24,181 INFO L377 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 45 treesize of output 116 [2019-11-19 23:50:24,182 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:24,293 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 36 [2019-11-19 23:50:24,294 INFO L567 ElimStorePlain]: treesize reduction 57, result has 60.1 percent of original size [2019-11-19 23:50:24,294 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-19 23:50:24,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:84, output treesize:65 [2019-11-19 23:50:24,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:24,342 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_524|, |v_#memory_$Pointer$.base_530|], 20=[|v_#memory_int_545|]} [2019-11-19 23:50:24,350 INFO L377 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 63 treesize of output 57 [2019-11-19 23:50:24,351 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-19 23:50:24,355 INFO L377 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 63 treesize of output 57 [2019-11-19 23:50:24,355 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-19 23:50:24,541 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-11-19 23:50:24,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:24,545 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2019-11-19 23:50:24,545 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:50:24,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2019-11-19 23:50:24,554 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 23:50:24,713 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-19 23:50:24,714 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:24,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,730 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,863 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-19 23:50:24,863 INFO L343 Elim1Store]: treesize reduction 34, result has 63.0 percent of original size [2019-11-19 23:50:24,863 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 98 [2019-11-19 23:50:24,864 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:24,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:24,993 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-11-19 23:50:24,993 INFO L343 Elim1Store]: treesize reduction 34, result has 63.0 percent of original size [2019-11-19 23:50:24,994 INFO L377 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 98 [2019-11-19 23:50:24,994 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:25,192 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-11-19 23:50:25,192 INFO L567 ElimStorePlain]: treesize reduction 100, result has 54.8 percent of original size [2019-11-19 23:50:25,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,193 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 23:50:25,193 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:127, output treesize:121 [2019-11-19 23:50:25,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,414 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-19 23:50:25,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:25,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 23:50:27,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2019-11-19 23:50:27,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:27,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 23:50:27,914 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:27,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 48 [2019-11-19 23:50:27,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 23:50:27,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:27,978 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:27,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2019-11-19 23:50:27,979 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 23:50:28,030 INFO L567 ElimStorePlain]: treesize reduction 192, result has 2.0 percent of original size [2019-11-19 23:50:28,030 INFO L464 ElimStorePlain]: Eliminatee v_prenex_14 vanished before elimination [2019-11-19 23:50:28,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 23:50:28,030 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:253, output treesize:4 [2019-11-19 23:50:28,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1124 backedges. 809 proven. 27 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-11-19 23:50:28,442 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 23:50:28,473 INFO L377 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 33 treesize of output 27 [2019-11-19 23:50:28,474 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-19 23:50:28,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:28,479 INFO L377 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 27 treesize of output 21 [2019-11-19 23:50:28,479 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-19 23:50:28,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:28,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:50:28,488 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2019-11-19 23:50:28,511 INFO L377 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 26 [2019-11-19 23:50:28,511 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-19 23:50:28,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:28,527 INFO L377 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 26 treesize of output 20 [2019-11-19 23:50:28,527 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-19 23:50:28,537 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 23:50:28,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 23:50:28,537 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2019-11-19 23:50:28,767 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 23:50:28,767 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) 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.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.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.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) 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:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-19 23:50:28,771 INFO L168 Benchmark]: Toolchain (without parser) took 341319.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 416.3 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -154.5 MB). Peak memory consumption was 261.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:28,771 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:50:28,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 889.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:28,772 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.42 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-19 23:50:28,772 INFO L168 Benchmark]: Boogie Preprocessor took 82.58 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-19 23:50:28,772 INFO L168 Benchmark]: RCFGBuilder took 3646.57 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.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:28,773 INFO L168 Benchmark]: TraceAbstraction took 336609.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -81.6 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:50:28,774 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.54 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 889.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 951.1 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 88.42 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 82.58 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 3646.57 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.0 MB). Peak memory consumption was 96.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 336609.20 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 256.9 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -81.6 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...