./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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 4bea9123dc38197075cd07fcd6899770fae2083a .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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 4bea9123dc38197075cd07fcd6899770fae2083a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: NullPointerException: null --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:56:00,763 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:56:00,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:56:00,780 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:56:00,780 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:56:00,782 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:56:00,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:56:00,793 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:56:00,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:56:00,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:56:00,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:56:00,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:56:00,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:56:00,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:56:00,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:56:00,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:56:00,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:56:00,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:56:00,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:56:00,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:56:00,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:56:00,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:56:00,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:56:00,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:56:00,830 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:56:00,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:56:00,831 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:56:00,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:56:00,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:56:00,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:56:00,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:56:00,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:56:00,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:56:00,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:56:00,837 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:56:00,838 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:56:00,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:56:00,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:56:00,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:56:00,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:56:00,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:56:00,842 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:56:00,867 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:56:00,877 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:56:00,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:56:00,879 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:56:00,879 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:56:00,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:56:00,880 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:56:00,880 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:56:00,880 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:56:00,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:56:00,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:56:00,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:56:00,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:56:00,881 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:56:00,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:56:00,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:56:00,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:56:00,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:56:00,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:56:00,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:56:00,884 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:56:00,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:00,885 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:56:00,885 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:56:00,885 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:56:00,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:56:00,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:56:00,886 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:56:00,886 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_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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 -> 4bea9123dc38197075cd07fcd6899770fae2083a [2019-11-15 23:56:00,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:56:00,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:56:00,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:56:00,934 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:56:00,934 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:56:00,935 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-11-15 23:56:00,996 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/1110f8eaa/ed62c50885364c8da320f000e139845d/FLAGaa3500f06 [2019-11-15 23:56:01,643 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:56:01,643 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-11-15 23:56:01,687 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/1110f8eaa/ed62c50885364c8da320f000e139845d/FLAGaa3500f06 [2019-11-15 23:56:01,844 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/1110f8eaa/ed62c50885364c8da320f000e139845d [2019-11-15 23:56:01,847 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:56:01,848 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:56:01,855 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:01,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:56:01,859 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:56:01,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:01" (1/1) ... [2019-11-15 23:56:01,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1e3a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:01, skipping insertion in model container [2019-11-15 23:56:01,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:01" (1/1) ... [2019-11-15 23:56:01,869 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:56:01,937 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:56:02,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:02,428 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:56:02,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:02,626 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:56:02,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02 WrapperNode [2019-11-15 23:56:02,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:02,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:02,628 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:56:02,628 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:56:02,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,675 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:02,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:56:02,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:56:02,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:56:02,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... [2019-11-15 23:56:02,838 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:56:02,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:56:02,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:56:02,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:56:02,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:02,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:56:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:56:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:56:02,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:56:02,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:56:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:56:02,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:56:02,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:56:03,205 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:56:04,289 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 23:56:04,290 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 23:56:04,291 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:56:04,291 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:56:04,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:04 BoogieIcfgContainer [2019-11-15 23:56:04,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:56:04,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:56:04,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:56:04,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:56:04,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:56:01" (1/3) ... [2019-11-15 23:56:04,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104f385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:04, skipping insertion in model container [2019-11-15 23:56:04,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:02" (2/3) ... [2019-11-15 23:56:04,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104f385 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:04, skipping insertion in model container [2019-11-15 23:56:04,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:04" (3/3) ... [2019-11-15 23:56:04,301 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2019-11-15 23:56:04,311 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:56:04,324 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:56:04,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:56:04,360 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:56:04,360 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:56:04,360 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:56:04,361 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:56:04,361 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:56:04,361 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:56:04,361 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:56:04,361 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:56:04,381 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 23:56:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:56:04,391 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:04,392 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:04,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:04,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:04,400 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-15 23:56:04,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:04,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365101071] [2019-11-15 23:56:04,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:04,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:04,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:04,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:04,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365101071] [2019-11-15 23:56:04,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:04,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:04,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459837274] [2019-11-15 23:56:04,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:04,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:04,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:04,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:04,737 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 23:56:05,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:05,328 INFO L93 Difference]: Finished difference Result 323 states and 547 transitions. [2019-11-15 23:56:05,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:05,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:56:05,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:05,353 INFO L225 Difference]: With dead ends: 323 [2019-11-15 23:56:05,354 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 23:56:05,358 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:05,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 23:56:05,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 23:56:05,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:05,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 226 transitions. [2019-11-15 23:56:05,409 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 226 transitions. Word has length 35 [2019-11-15 23:56:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:05,409 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 226 transitions. [2019-11-15 23:56:05,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 226 transitions. [2019-11-15 23:56:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:56:05,413 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:05,414 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:05,414 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:05,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash 972749596, now seen corresponding path program 1 times [2019-11-15 23:56:05,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:05,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489530956] [2019-11-15 23:56:05,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,416 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:05,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:05,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489530956] [2019-11-15 23:56:05,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:05,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:05,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318994888] [2019-11-15 23:56:05,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:05,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:05,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:05,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:05,578 INFO L87 Difference]: Start difference. First operand 146 states and 226 transitions. Second operand 4 states. [2019-11-15 23:56:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:06,013 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-11-15 23:56:06,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:06,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-15 23:56:06,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:06,015 INFO L225 Difference]: With dead ends: 290 [2019-11-15 23:56:06,016 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 23:56:06,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:06,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 23:56:06,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 146. [2019-11-15 23:56:06,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:06,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2019-11-15 23:56:06,029 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 48 [2019-11-15 23:56:06,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:06,030 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2019-11-15 23:56:06,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:06,030 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2019-11-15 23:56:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:56:06,032 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:06,032 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:06,033 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:06,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:06,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1295428526, now seen corresponding path program 1 times [2019-11-15 23:56:06,033 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:06,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681635563] [2019-11-15 23:56:06,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:06,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:06,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:06,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:06,141 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681635563] [2019-11-15 23:56:06,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:06,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:06,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337114780] [2019-11-15 23:56:06,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:06,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:06,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:06,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:06,143 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand 4 states. [2019-11-15 23:56:06,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:06,551 INFO L93 Difference]: Finished difference Result 289 states and 441 transitions. [2019-11-15 23:56:06,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:06,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:56:06,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:06,554 INFO L225 Difference]: With dead ends: 289 [2019-11-15 23:56:06,554 INFO L226 Difference]: Without dead ends: 162 [2019-11-15 23:56:06,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-11-15 23:56:06,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2019-11-15 23:56:06,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:06,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 224 transitions. [2019-11-15 23:56:06,576 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 224 transitions. Word has length 49 [2019-11-15 23:56:06,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:06,577 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 224 transitions. [2019-11-15 23:56:06,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:06,577 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 224 transitions. [2019-11-15 23:56:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:56:06,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:06,579 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:06,580 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:06,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:06,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1231677145, now seen corresponding path program 1 times [2019-11-15 23:56:06,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:06,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422449529] [2019-11-15 23:56:06,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:06,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:06,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:06,701 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:06,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422449529] [2019-11-15 23:56:06,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:06,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:06,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194402756] [2019-11-15 23:56:06,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:06,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:06,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:06,704 INFO L87 Difference]: Start difference. First operand 146 states and 224 transitions. Second operand 4 states. [2019-11-15 23:56:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:07,154 INFO L93 Difference]: Finished difference Result 287 states and 438 transitions. [2019-11-15 23:56:07,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:07,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:56:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:07,157 INFO L225 Difference]: With dead ends: 287 [2019-11-15 23:56:07,157 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 23:56:07,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:07,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 23:56:07,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-11-15 23:56:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:07,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 223 transitions. [2019-11-15 23:56:07,173 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 223 transitions. Word has length 49 [2019-11-15 23:56:07,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:07,173 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 223 transitions. [2019-11-15 23:56:07,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 223 transitions. [2019-11-15 23:56:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:56:07,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:07,181 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:07,181 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1771822617, now seen corresponding path program 1 times [2019-11-15 23:56:07,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:07,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084612920] [2019-11-15 23:56:07,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:07,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:07,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:07,291 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:07,292 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084612920] [2019-11-15 23:56:07,292 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:07,292 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:07,293 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314549999] [2019-11-15 23:56:07,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:07,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:07,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:07,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:07,294 INFO L87 Difference]: Start difference. First operand 146 states and 223 transitions. Second operand 4 states. [2019-11-15 23:56:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:07,655 INFO L93 Difference]: Finished difference Result 286 states and 436 transitions. [2019-11-15 23:56:07,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:07,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:56:07,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:07,657 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:56:07,657 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:56:07,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:56:07,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:56:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:07,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 222 transitions. [2019-11-15 23:56:07,672 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 222 transitions. Word has length 49 [2019-11-15 23:56:07,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:07,672 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 222 transitions. [2019-11-15 23:56:07,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:07,672 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 222 transitions. [2019-11-15 23:56:07,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 23:56:07,673 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:07,674 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:07,674 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:07,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:07,674 INFO L82 PathProgramCache]: Analyzing trace with hash -2133959614, now seen corresponding path program 1 times [2019-11-15 23:56:07,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:07,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543802657] [2019-11-15 23:56:07,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:07,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:07,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:07,751 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543802657] [2019-11-15 23:56:07,751 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:07,751 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:07,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106531027] [2019-11-15 23:56:07,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:07,752 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:07,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:07,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:07,753 INFO L87 Difference]: Start difference. First operand 146 states and 222 transitions. Second operand 4 states. [2019-11-15 23:56:08,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:08,111 INFO L93 Difference]: Finished difference Result 286 states and 435 transitions. [2019-11-15 23:56:08,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:08,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-15 23:56:08,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:08,113 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:56:08,113 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:56:08,114 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:08,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:56:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:56:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 221 transitions. [2019-11-15 23:56:08,120 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 221 transitions. Word has length 49 [2019-11-15 23:56:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:08,120 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 221 transitions. [2019-11-15 23:56:08,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 221 transitions. [2019-11-15 23:56:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 23:56:08,122 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:08,122 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:08,122 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:08,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:08,122 INFO L82 PathProgramCache]: Analyzing trace with hash -824123675, now seen corresponding path program 1 times [2019-11-15 23:56:08,122 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:08,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011588065] [2019-11-15 23:56:08,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,123 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:08,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,185 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:08,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011588065] [2019-11-15 23:56:08,186 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:08,186 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:08,186 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157754928] [2019-11-15 23:56:08,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:08,187 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:08,187 INFO L87 Difference]: Start difference. First operand 146 states and 221 transitions. Second operand 4 states. [2019-11-15 23:56:08,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:08,544 INFO L93 Difference]: Finished difference Result 286 states and 434 transitions. [2019-11-15 23:56:08,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:08,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-15 23:56:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:08,546 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:56:08,547 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:56:08,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:08,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:56:08,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:56:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:08,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 220 transitions. [2019-11-15 23:56:08,553 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 220 transitions. Word has length 50 [2019-11-15 23:56:08,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:08,553 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 220 transitions. [2019-11-15 23:56:08,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 220 transitions. [2019-11-15 23:56:08,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 23:56:08,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:08,555 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:08,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:08,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:08,555 INFO L82 PathProgramCache]: Analyzing trace with hash 807634151, now seen corresponding path program 1 times [2019-11-15 23:56:08,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:08,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281293561] [2019-11-15 23:56:08,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,610 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:08,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281293561] [2019-11-15 23:56:08,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:08,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:08,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384459633] [2019-11-15 23:56:08,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:08,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:08,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:08,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:08,612 INFO L87 Difference]: Start difference. First operand 146 states and 220 transitions. Second operand 4 states. [2019-11-15 23:56:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:08,936 INFO L93 Difference]: Finished difference Result 286 states and 433 transitions. [2019-11-15 23:56:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:08,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-15 23:56:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:08,938 INFO L225 Difference]: With dead ends: 286 [2019-11-15 23:56:08,938 INFO L226 Difference]: Without dead ends: 159 [2019-11-15 23:56:08,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:08,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-15 23:56:08,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 146. [2019-11-15 23:56:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 219 transitions. [2019-11-15 23:56:08,944 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 219 transitions. Word has length 51 [2019-11-15 23:56:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:08,944 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 219 transitions. [2019-11-15 23:56:08,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 219 transitions. [2019-11-15 23:56:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:56:08,945 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:08,946 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:08,946 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash -465931414, now seen corresponding path program 1 times [2019-11-15 23:56:08,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:08,947 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955249213] [2019-11-15 23:56:08,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:08,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:08,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955249213] [2019-11-15 23:56:08,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:08,997 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:08,997 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119123885] [2019-11-15 23:56:08,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:08,998 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:08,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:08,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:08,999 INFO L87 Difference]: Start difference. First operand 146 states and 219 transitions. Second operand 4 states. [2019-11-15 23:56:09,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:09,299 INFO L93 Difference]: Finished difference Result 276 states and 419 transitions. [2019-11-15 23:56:09,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:09,300 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:56:09,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:09,302 INFO L225 Difference]: With dead ends: 276 [2019-11-15 23:56:09,302 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 23:56:09,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:09,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 23:56:09,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-11-15 23:56:09,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-15 23:56:09,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 218 transitions. [2019-11-15 23:56:09,307 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 218 transitions. Word has length 52 [2019-11-15 23:56:09,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:09,308 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 218 transitions. [2019-11-15 23:56:09,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 218 transitions. [2019-11-15 23:56:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:56:09,309 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:09,309 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:09,310 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:09,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:09,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1405490990, now seen corresponding path program 1 times [2019-11-15 23:56:09,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:09,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921202002] [2019-11-15 23:56:09,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:09,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:09,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:09,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921202002] [2019-11-15 23:56:09,363 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:09,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:09,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218058579] [2019-11-15 23:56:09,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:09,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:09,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:09,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:09,365 INFO L87 Difference]: Start difference. First operand 146 states and 218 transitions. Second operand 4 states. [2019-11-15 23:56:09,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:09,761 INFO L93 Difference]: Finished difference Result 316 states and 480 transitions. [2019-11-15 23:56:09,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:09,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:56:09,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:09,763 INFO L225 Difference]: With dead ends: 316 [2019-11-15 23:56:09,763 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 23:56:09,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 23:56:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 23:56:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:09,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 256 transitions. [2019-11-15 23:56:09,774 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 256 transitions. Word has length 52 [2019-11-15 23:56:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:09,774 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 256 transitions. [2019-11-15 23:56:09,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 256 transitions. [2019-11-15 23:56:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-15 23:56:09,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:09,776 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:09,776 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1761497597, now seen corresponding path program 1 times [2019-11-15 23:56:09,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:09,777 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365306757] [2019-11-15 23:56:09,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:09,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:09,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:09,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:09,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365306757] [2019-11-15 23:56:09,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:09,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:09,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953301841] [2019-11-15 23:56:09,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:09,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:09,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:09,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:09,877 INFO L87 Difference]: Start difference. First operand 168 states and 256 transitions. Second operand 4 states. [2019-11-15 23:56:10,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:10,222 INFO L93 Difference]: Finished difference Result 338 states and 517 transitions. [2019-11-15 23:56:10,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:10,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-15 23:56:10,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:10,225 INFO L225 Difference]: With dead ends: 338 [2019-11-15 23:56:10,225 INFO L226 Difference]: Without dead ends: 189 [2019-11-15 23:56:10,226 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-15 23:56:10,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 168. [2019-11-15 23:56:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:10,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 255 transitions. [2019-11-15 23:56:10,233 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 255 transitions. Word has length 65 [2019-11-15 23:56:10,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:10,233 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 255 transitions. [2019-11-15 23:56:10,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:10,233 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 255 transitions. [2019-11-15 23:56:10,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:56:10,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:10,234 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:10,235 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:10,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:10,235 INFO L82 PathProgramCache]: Analyzing trace with hash -23187219, now seen corresponding path program 1 times [2019-11-15 23:56:10,235 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:10,235 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456392035] [2019-11-15 23:56:10,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:10,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:10,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:10,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:10,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:10,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456392035] [2019-11-15 23:56:10,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:10,295 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:10,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977719245] [2019-11-15 23:56:10,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:10,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:10,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:10,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:10,297 INFO L87 Difference]: Start difference. First operand 168 states and 255 transitions. Second operand 4 states. [2019-11-15 23:56:10,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:10,729 INFO L93 Difference]: Finished difference Result 337 states and 514 transitions. [2019-11-15 23:56:10,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:10,730 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:56:10,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:10,731 INFO L225 Difference]: With dead ends: 337 [2019-11-15 23:56:10,731 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 23:56:10,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:10,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 23:56:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2019-11-15 23:56:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 254 transitions. [2019-11-15 23:56:10,737 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 254 transitions. Word has length 66 [2019-11-15 23:56:10,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:10,737 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 254 transitions. [2019-11-15 23:56:10,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:10,737 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 254 transitions. [2019-11-15 23:56:10,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:56:10,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:10,738 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:10,738 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:10,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:10,739 INFO L82 PathProgramCache]: Analyzing trace with hash -86938600, now seen corresponding path program 1 times [2019-11-15 23:56:10,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:10,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520035392] [2019-11-15 23:56:10,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:10,739 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:10,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:10,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:10,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520035392] [2019-11-15 23:56:10,800 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:10,800 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:10,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876402092] [2019-11-15 23:56:10,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:10,803 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:10,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:10,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:10,805 INFO L87 Difference]: Start difference. First operand 168 states and 254 transitions. Second operand 4 states. [2019-11-15 23:56:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:11,147 INFO L93 Difference]: Finished difference Result 335 states and 510 transitions. [2019-11-15 23:56:11,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:11,148 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:56:11,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:11,150 INFO L225 Difference]: With dead ends: 335 [2019-11-15 23:56:11,150 INFO L226 Difference]: Without dead ends: 186 [2019-11-15 23:56:11,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:11,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-15 23:56:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 168. [2019-11-15 23:56:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:11,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 253 transitions. [2019-11-15 23:56:11,156 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 253 transitions. Word has length 66 [2019-11-15 23:56:11,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:11,156 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 253 transitions. [2019-11-15 23:56:11,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:11,156 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 253 transitions. [2019-11-15 23:56:11,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:56:11,158 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:11,158 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:11,158 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:11,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:11,158 INFO L82 PathProgramCache]: Analyzing trace with hash 453206872, now seen corresponding path program 1 times [2019-11-15 23:56:11,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:11,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071337778] [2019-11-15 23:56:11,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:11,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:11,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:11,206 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:11,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071337778] [2019-11-15 23:56:11,207 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:11,207 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:11,207 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224348004] [2019-11-15 23:56:11,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:11,208 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:11,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:11,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:11,208 INFO L87 Difference]: Start difference. First operand 168 states and 253 transitions. Second operand 4 states. [2019-11-15 23:56:11,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:11,546 INFO L93 Difference]: Finished difference Result 334 states and 507 transitions. [2019-11-15 23:56:11,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:11,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:56:11,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:11,548 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:56:11,548 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:56:11,549 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:56:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:56:11,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:11,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 252 transitions. [2019-11-15 23:56:11,554 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 252 transitions. Word has length 66 [2019-11-15 23:56:11,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:11,555 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 252 transitions. [2019-11-15 23:56:11,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 252 transitions. [2019-11-15 23:56:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:56:11,555 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:11,556 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:11,556 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:11,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:11,556 INFO L82 PathProgramCache]: Analyzing trace with hash 842391937, now seen corresponding path program 1 times [2019-11-15 23:56:11,556 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:11,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790678312] [2019-11-15 23:56:11,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:11,557 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:11,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:11,603 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:11,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790678312] [2019-11-15 23:56:11,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:11,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:11,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737903112] [2019-11-15 23:56:11,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:11,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:11,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:11,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:11,605 INFO L87 Difference]: Start difference. First operand 168 states and 252 transitions. Second operand 4 states. [2019-11-15 23:56:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:11,973 INFO L93 Difference]: Finished difference Result 334 states and 505 transitions. [2019-11-15 23:56:11,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:11,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 23:56:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:11,975 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:56:11,975 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:56:11,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:11,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:56:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:56:11,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 251 transitions. [2019-11-15 23:56:11,981 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 251 transitions. Word has length 66 [2019-11-15 23:56:11,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:11,981 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 251 transitions. [2019-11-15 23:56:11,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:11,981 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 251 transitions. [2019-11-15 23:56:11,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-15 23:56:11,982 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:11,982 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:11,982 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:11,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:11,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1248461190, now seen corresponding path program 1 times [2019-11-15 23:56:11,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:11,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077766934] [2019-11-15 23:56:11,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:11,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:11,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:12,032 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:12,032 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077766934] [2019-11-15 23:56:12,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:12,035 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:12,035 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759136241] [2019-11-15 23:56:12,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:12,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:12,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:12,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:12,036 INFO L87 Difference]: Start difference. First operand 168 states and 251 transitions. Second operand 4 states. [2019-11-15 23:56:12,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:12,413 INFO L93 Difference]: Finished difference Result 334 states and 503 transitions. [2019-11-15 23:56:12,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:12,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-15 23:56:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:12,415 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:56:12,416 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:56:12,416 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:12,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:56:12,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:56:12,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-11-15 23:56:12,427 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 67 [2019-11-15 23:56:12,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:12,428 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 250 transitions. [2019-11-15 23:56:12,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:12,428 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 250 transitions. [2019-11-15 23:56:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-15 23:56:12,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:12,429 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:12,429 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:12,429 INFO L82 PathProgramCache]: Analyzing trace with hash 633255526, now seen corresponding path program 1 times [2019-11-15 23:56:12,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:12,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448850743] [2019-11-15 23:56:12,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:12,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:12,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:12,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448850743] [2019-11-15 23:56:12,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:12,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:12,476 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825511756] [2019-11-15 23:56:12,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:12,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:12,477 INFO L87 Difference]: Start difference. First operand 168 states and 250 transitions. Second operand 4 states. [2019-11-15 23:56:12,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:12,852 INFO L93 Difference]: Finished difference Result 334 states and 501 transitions. [2019-11-15 23:56:12,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:12,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-15 23:56:12,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:12,855 INFO L225 Difference]: With dead ends: 334 [2019-11-15 23:56:12,855 INFO L226 Difference]: Without dead ends: 185 [2019-11-15 23:56:12,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:12,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-15 23:56:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2019-11-15 23:56:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 249 transitions. [2019-11-15 23:56:12,863 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 249 transitions. Word has length 68 [2019-11-15 23:56:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:12,863 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 249 transitions. [2019-11-15 23:56:12,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 249 transitions. [2019-11-15 23:56:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-15 23:56:12,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:12,865 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:12,865 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:12,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:12,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1576701493, now seen corresponding path program 1 times [2019-11-15 23:56:12,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:12,866 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096087496] [2019-11-15 23:56:12,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:12,866 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:12,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:12,926 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:12,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096087496] [2019-11-15 23:56:12,927 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:12,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:12,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492249788] [2019-11-15 23:56:12,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:12,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:12,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:12,929 INFO L87 Difference]: Start difference. First operand 168 states and 249 transitions. Second operand 4 states. [2019-11-15 23:56:13,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:13,258 INFO L93 Difference]: Finished difference Result 324 states and 486 transitions. [2019-11-15 23:56:13,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:13,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-15 23:56:13,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:13,260 INFO L225 Difference]: With dead ends: 324 [2019-11-15 23:56:13,260 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 23:56:13,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 23:56:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2019-11-15 23:56:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 23:56:13,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 248 transitions. [2019-11-15 23:56:13,265 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 248 transitions. Word has length 69 [2019-11-15 23:56:13,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:13,266 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 248 transitions. [2019-11-15 23:56:13,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:13,266 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 248 transitions. [2019-11-15 23:56:13,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:56:13,267 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:13,267 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:13,267 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:13,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:13,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1274616071, now seen corresponding path program 1 times [2019-11-15 23:56:13,267 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:13,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612651547] [2019-11-15 23:56:13,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:13,268 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:13,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:13,352 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:13,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612651547] [2019-11-15 23:56:13,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:13,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:13,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650813653] [2019-11-15 23:56:13,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:13,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:13,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:13,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:13,357 INFO L87 Difference]: Start difference. First operand 168 states and 248 transitions. Second operand 4 states. [2019-11-15 23:56:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:13,814 INFO L93 Difference]: Finished difference Result 424 states and 639 transitions. [2019-11-15 23:56:13,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:13,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 23:56:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:13,816 INFO L225 Difference]: With dead ends: 424 [2019-11-15 23:56:13,816 INFO L226 Difference]: Without dead ends: 275 [2019-11-15 23:56:13,817 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:13,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-11-15 23:56:13,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 198. [2019-11-15 23:56:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 23:56:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 300 transitions. [2019-11-15 23:56:13,823 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 300 transitions. Word has length 74 [2019-11-15 23:56:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:13,823 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 300 transitions. [2019-11-15 23:56:13,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:13,823 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 300 transitions. [2019-11-15 23:56:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-15 23:56:13,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:13,824 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:13,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:13,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:13,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1202229513, now seen corresponding path program 1 times [2019-11-15 23:56:13,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:13,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538740278] [2019-11-15 23:56:13,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:13,825 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:13,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:13,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538740278] [2019-11-15 23:56:13,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:13,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:13,885 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112219587] [2019-11-15 23:56:13,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:13,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:13,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:13,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:13,886 INFO L87 Difference]: Start difference. First operand 198 states and 300 transitions. Second operand 4 states. [2019-11-15 23:56:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:14,279 INFO L93 Difference]: Finished difference Result 427 states and 655 transitions. [2019-11-15 23:56:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:14,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-11-15 23:56:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:14,283 INFO L225 Difference]: With dead ends: 427 [2019-11-15 23:56:14,283 INFO L226 Difference]: Without dead ends: 248 [2019-11-15 23:56:14,284 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:14,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-11-15 23:56:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 222. [2019-11-15 23:56:14,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-11-15 23:56:14,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 342 transitions. [2019-11-15 23:56:14,291 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 342 transitions. Word has length 74 [2019-11-15 23:56:14,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:14,292 INFO L462 AbstractCegarLoop]: Abstraction has 222 states and 342 transitions. [2019-11-15 23:56:14,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:14,292 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 342 transitions. [2019-11-15 23:56:14,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-11-15 23:56:14,294 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:14,294 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:14,295 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:14,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:14,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1047936766, now seen corresponding path program 1 times [2019-11-15 23:56:14,295 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:14,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596061554] [2019-11-15 23:56:14,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:14,296 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:14,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:14,378 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:14,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596061554] [2019-11-15 23:56:14,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:14,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:14,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573731121] [2019-11-15 23:56:14,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:14,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:14,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:14,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:14,381 INFO L87 Difference]: Start difference. First operand 222 states and 342 transitions. Second operand 4 states. [2019-11-15 23:56:14,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:14,890 INFO L93 Difference]: Finished difference Result 494 states and 761 transitions. [2019-11-15 23:56:14,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:14,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-11-15 23:56:14,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:14,893 INFO L225 Difference]: With dead ends: 494 [2019-11-15 23:56:14,893 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:56:14,893 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:14,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:56:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 223. [2019-11-15 23:56:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-11-15 23:56:14,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 343 transitions. [2019-11-15 23:56:14,900 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 343 transitions. Word has length 75 [2019-11-15 23:56:14,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:14,900 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 343 transitions. [2019-11-15 23:56:14,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:14,900 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 343 transitions. [2019-11-15 23:56:14,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-15 23:56:14,901 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:14,901 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:14,901 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:14,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:14,902 INFO L82 PathProgramCache]: Analyzing trace with hash -2006174842, now seen corresponding path program 1 times [2019-11-15 23:56:14,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:14,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285871812] [2019-11-15 23:56:14,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:14,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:14,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:14,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285871812] [2019-11-15 23:56:14,976 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:14,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:14,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309963994] [2019-11-15 23:56:14,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:14,977 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:14,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:14,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:14,977 INFO L87 Difference]: Start difference. First operand 223 states and 343 transitions. Second operand 4 states. [2019-11-15 23:56:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:15,432 INFO L93 Difference]: Finished difference Result 495 states and 761 transitions. [2019-11-15 23:56:15,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:15,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-15 23:56:15,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:15,436 INFO L225 Difference]: With dead ends: 495 [2019-11-15 23:56:15,436 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:56:15,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:56:15,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 233. [2019-11-15 23:56:15,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2019-11-15 23:56:15,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 362 transitions. [2019-11-15 23:56:15,444 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 362 transitions. Word has length 80 [2019-11-15 23:56:15,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:15,445 INFO L462 AbstractCegarLoop]: Abstraction has 233 states and 362 transitions. [2019-11-15 23:56:15,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:15,445 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 362 transitions. [2019-11-15 23:56:15,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-15 23:56:15,446 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:15,446 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:15,446 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:15,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:15,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2068915140, now seen corresponding path program 1 times [2019-11-15 23:56:15,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:15,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656972384] [2019-11-15 23:56:15,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:15,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:15,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:15,521 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656972384] [2019-11-15 23:56:15,521 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:15,521 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:15,521 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024646910] [2019-11-15 23:56:15,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:15,523 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:15,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:15,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:15,524 INFO L87 Difference]: Start difference. First operand 233 states and 362 transitions. Second operand 4 states. [2019-11-15 23:56:15,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:15,977 INFO L93 Difference]: Finished difference Result 499 states and 772 transitions. [2019-11-15 23:56:15,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:15,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-15 23:56:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:15,980 INFO L225 Difference]: With dead ends: 499 [2019-11-15 23:56:15,980 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 23:56:15,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:15,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 23:56:15,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-15 23:56:15,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:56:15,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 363 transitions. [2019-11-15 23:56:15,991 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 363 transitions. Word has length 81 [2019-11-15 23:56:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:15,992 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 363 transitions. [2019-11-15 23:56:15,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:15,992 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 363 transitions. [2019-11-15 23:56:15,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:56:15,993 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:15,993 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:15,994 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:15,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash -262676504, now seen corresponding path program 1 times [2019-11-15 23:56:15,996 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:15,997 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931732495] [2019-11-15 23:56:15,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:15,997 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:15,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:16,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931732495] [2019-11-15 23:56:16,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:16,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:16,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815138751] [2019-11-15 23:56:16,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:16,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:16,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:16,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:16,076 INFO L87 Difference]: Start difference. First operand 234 states and 363 transitions. Second operand 4 states. [2019-11-15 23:56:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:16,607 INFO L93 Difference]: Finished difference Result 500 states and 772 transitions. [2019-11-15 23:56:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:16,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:56:16,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:16,609 INFO L225 Difference]: With dead ends: 500 [2019-11-15 23:56:16,609 INFO L226 Difference]: Without dead ends: 285 [2019-11-15 23:56:16,610 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:16,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-11-15 23:56:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 234. [2019-11-15 23:56:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:56:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 362 transitions. [2019-11-15 23:56:16,621 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 362 transitions. Word has length 87 [2019-11-15 23:56:16,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:16,622 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 362 transitions. [2019-11-15 23:56:16,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:16,622 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 362 transitions. [2019-11-15 23:56:16,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-15 23:56:16,623 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:16,624 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:16,624 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:16,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:16,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1665596198, now seen corresponding path program 1 times [2019-11-15 23:56:16,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:16,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766616891] [2019-11-15 23:56:16,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:16,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:16,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:16,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766616891] [2019-11-15 23:56:16,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:16,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:16,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011041461] [2019-11-15 23:56:16,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:16,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:16,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:16,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:16,696 INFO L87 Difference]: Start difference. First operand 234 states and 362 transitions. Second operand 4 states. [2019-11-15 23:56:17,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:17,115 INFO L93 Difference]: Finished difference Result 475 states and 736 transitions. [2019-11-15 23:56:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:17,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-11-15 23:56:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:17,117 INFO L225 Difference]: With dead ends: 475 [2019-11-15 23:56:17,117 INFO L226 Difference]: Without dead ends: 260 [2019-11-15 23:56:17,118 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:17,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-11-15 23:56:17,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 234. [2019-11-15 23:56:17,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:56:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 361 transitions. [2019-11-15 23:56:17,124 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 361 transitions. Word has length 87 [2019-11-15 23:56:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:17,124 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 361 transitions. [2019-11-15 23:56:17,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 361 transitions. [2019-11-15 23:56:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:56:17,125 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:17,126 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:17,126 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:17,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1651925090, now seen corresponding path program 1 times [2019-11-15 23:56:17,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:17,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137316302] [2019-11-15 23:56:17,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:17,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:17,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:17,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:17,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137316302] [2019-11-15 23:56:17,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:17,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:17,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200617289] [2019-11-15 23:56:17,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:17,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:17,190 INFO L87 Difference]: Start difference. First operand 234 states and 361 transitions. Second operand 4 states. [2019-11-15 23:56:17,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:17,584 INFO L93 Difference]: Finished difference Result 499 states and 767 transitions. [2019-11-15 23:56:17,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:17,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:56:17,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:17,586 INFO L225 Difference]: With dead ends: 499 [2019-11-15 23:56:17,586 INFO L226 Difference]: Without dead ends: 284 [2019-11-15 23:56:17,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:17,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-15 23:56:17,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 234. [2019-11-15 23:56:17,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:56:17,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 360 transitions. [2019-11-15 23:56:17,595 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 360 transitions. Word has length 88 [2019-11-15 23:56:17,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:17,596 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 360 transitions. [2019-11-15 23:56:17,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 360 transitions. [2019-11-15 23:56:17,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:56:17,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:17,597 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:17,598 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:17,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:17,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1588173709, now seen corresponding path program 1 times [2019-11-15 23:56:17,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:17,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214832290] [2019-11-15 23:56:17,599 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:17,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:17,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:17,658 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:17,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214832290] [2019-11-15 23:56:17,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:17,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:17,659 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796450032] [2019-11-15 23:56:17,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:17,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:17,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:17,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:17,660 INFO L87 Difference]: Start difference. First operand 234 states and 360 transitions. Second operand 4 states. [2019-11-15 23:56:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:18,008 INFO L93 Difference]: Finished difference Result 497 states and 763 transitions. [2019-11-15 23:56:18,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:18,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:56:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:18,010 INFO L225 Difference]: With dead ends: 497 [2019-11-15 23:56:18,010 INFO L226 Difference]: Without dead ends: 282 [2019-11-15 23:56:18,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-11-15 23:56:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 234. [2019-11-15 23:56:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:56:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 359 transitions. [2019-11-15 23:56:18,017 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 359 transitions. Word has length 88 [2019-11-15 23:56:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:18,017 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 359 transitions. [2019-11-15 23:56:18,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 359 transitions. [2019-11-15 23:56:18,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:56:18,018 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:18,018 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:18,018 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:18,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:18,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2128319181, now seen corresponding path program 1 times [2019-11-15 23:56:18,019 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:18,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408808689] [2019-11-15 23:56:18,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:18,019 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:18,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:18,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:18,117 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408808689] [2019-11-15 23:56:18,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:18,118 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:18,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997037911] [2019-11-15 23:56:18,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:18,118 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:18,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:18,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:18,119 INFO L87 Difference]: Start difference. First operand 234 states and 359 transitions. Second operand 4 states. [2019-11-15 23:56:18,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:18,550 INFO L93 Difference]: Finished difference Result 496 states and 760 transitions. [2019-11-15 23:56:18,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:18,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:56:18,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:18,552 INFO L225 Difference]: With dead ends: 496 [2019-11-15 23:56:18,553 INFO L226 Difference]: Without dead ends: 281 [2019-11-15 23:56:18,553 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-11-15 23:56:18,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 234. [2019-11-15 23:56:18,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2019-11-15 23:56:18,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 358 transitions. [2019-11-15 23:56:18,560 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 358 transitions. Word has length 88 [2019-11-15 23:56:18,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:18,560 INFO L462 AbstractCegarLoop]: Abstraction has 234 states and 358 transitions. [2019-11-15 23:56:18,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 358 transitions. [2019-11-15 23:56:18,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:56:18,561 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:18,562 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:18,562 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:18,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:18,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1777463050, now seen corresponding path program 1 times [2019-11-15 23:56:18,562 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:18,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272621930] [2019-11-15 23:56:18,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:18,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:18,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-15 23:56:18,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272621930] [2019-11-15 23:56:18,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:18,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:18,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586129622] [2019-11-15 23:56:18,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:18,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:18,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:18,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:18,635 INFO L87 Difference]: Start difference. First operand 234 states and 358 transitions. Second operand 5 states. [2019-11-15 23:56:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:19,159 INFO L93 Difference]: Finished difference Result 470 states and 724 transitions. [2019-11-15 23:56:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:56:19,160 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 88 [2019-11-15 23:56:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:19,162 INFO L225 Difference]: With dead ends: 470 [2019-11-15 23:56:19,162 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 23:56:19,162 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:56:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 23:56:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2019-11-15 23:56:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 384 transitions. [2019-11-15 23:56:19,170 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 384 transitions. Word has length 88 [2019-11-15 23:56:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:19,171 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 384 transitions. [2019-11-15 23:56:19,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 384 transitions. [2019-11-15 23:56:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:56:19,172 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:19,172 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:19,172 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:19,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:19,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1235085327, now seen corresponding path program 1 times [2019-11-15 23:56:19,173 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:19,175 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236600631] [2019-11-15 23:56:19,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,175 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:19,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236600631] [2019-11-15 23:56:19,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:19,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:19,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370944443] [2019-11-15 23:56:19,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:19,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:19,248 INFO L87 Difference]: Start difference. First operand 254 states and 384 transitions. Second operand 4 states. [2019-11-15 23:56:19,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:19,621 INFO L93 Difference]: Finished difference Result 512 states and 776 transitions. [2019-11-15 23:56:19,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:19,621 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:56:19,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:19,623 INFO L225 Difference]: With dead ends: 512 [2019-11-15 23:56:19,623 INFO L226 Difference]: Without dead ends: 277 [2019-11-15 23:56:19,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:19,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-11-15 23:56:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 254. [2019-11-15 23:56:19,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:19,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2019-11-15 23:56:19,631 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 88 [2019-11-15 23:56:19,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:19,631 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2019-11-15 23:56:19,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2019-11-15 23:56:19,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-15 23:56:19,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:19,632 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:19,632 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:19,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:19,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1775230799, now seen corresponding path program 1 times [2019-11-15 23:56:19,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:19,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477982898] [2019-11-15 23:56:19,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:19,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:19,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477982898] [2019-11-15 23:56:19,687 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:19,687 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:19,687 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36895385] [2019-11-15 23:56:19,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:19,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:19,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:19,688 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand 4 states. [2019-11-15 23:56:20,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:20,057 INFO L93 Difference]: Finished difference Result 511 states and 773 transitions. [2019-11-15 23:56:20,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:20,058 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-11-15 23:56:20,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:20,059 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:56:20,059 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:56:20,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:20,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:56:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:56:20,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 382 transitions. [2019-11-15 23:56:20,068 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 382 transitions. Word has length 88 [2019-11-15 23:56:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:20,068 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 382 transitions. [2019-11-15 23:56:20,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 382 transitions. [2019-11-15 23:56:20,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:56:20,069 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:20,070 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:20,070 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:20,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:20,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1768485220, now seen corresponding path program 1 times [2019-11-15 23:56:20,071 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:20,071 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361985663] [2019-11-15 23:56:20,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:20,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:20,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:20,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361985663] [2019-11-15 23:56:20,134 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:20,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:20,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678507702] [2019-11-15 23:56:20,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:20,135 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:20,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:20,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:20,136 INFO L87 Difference]: Start difference. First operand 254 states and 382 transitions. Second operand 4 states. [2019-11-15 23:56:20,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:20,583 INFO L93 Difference]: Finished difference Result 536 states and 805 transitions. [2019-11-15 23:56:20,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:20,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 23:56:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:20,586 INFO L225 Difference]: With dead ends: 536 [2019-11-15 23:56:20,586 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 23:56:20,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:20,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 23:56:20,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-15 23:56:20,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 381 transitions. [2019-11-15 23:56:20,595 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 381 transitions. Word has length 89 [2019-11-15 23:56:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:20,595 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 381 transitions. [2019-11-15 23:56:20,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:20,596 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 381 transitions. [2019-11-15 23:56:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 23:56:20,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:20,597 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:20,597 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:20,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash -587320030, now seen corresponding path program 1 times [2019-11-15 23:56:20,598 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:20,598 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434352782] [2019-11-15 23:56:20,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:20,598 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:20,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:20,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434352782] [2019-11-15 23:56:20,658 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:20,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:20,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340653336] [2019-11-15 23:56:20,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:20,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:20,659 INFO L87 Difference]: Start difference. First operand 254 states and 381 transitions. Second operand 4 states. [2019-11-15 23:56:21,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:21,066 INFO L93 Difference]: Finished difference Result 511 states and 769 transitions. [2019-11-15 23:56:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:21,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-11-15 23:56:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:21,069 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:56:21,069 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:56:21,070 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:56:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:56:21,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 380 transitions. [2019-11-15 23:56:21,086 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 380 transitions. Word has length 89 [2019-11-15 23:56:21,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:21,086 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 380 transitions. [2019-11-15 23:56:21,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 380 transitions. [2019-11-15 23:56:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:56:21,088 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:21,089 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:21,089 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash 253049097, now seen corresponding path program 1 times [2019-11-15 23:56:21,089 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:21,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130443908] [2019-11-15 23:56:21,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:21,090 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:21,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:21,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:21,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130443908] [2019-11-15 23:56:21,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:21,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:21,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579273224] [2019-11-15 23:56:21,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:21,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:21,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:21,169 INFO L87 Difference]: Start difference. First operand 254 states and 380 transitions. Second operand 4 states. [2019-11-15 23:56:21,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:21,606 INFO L93 Difference]: Finished difference Result 536 states and 801 transitions. [2019-11-15 23:56:21,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:21,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:56:21,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:21,609 INFO L225 Difference]: With dead ends: 536 [2019-11-15 23:56:21,609 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 23:56:21,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:21,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 23:56:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-15 23:56:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 379 transitions. [2019-11-15 23:56:21,618 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 379 transitions. Word has length 90 [2019-11-15 23:56:21,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:21,619 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 379 transitions. [2019-11-15 23:56:21,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 379 transitions. [2019-11-15 23:56:21,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 23:56:21,620 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:21,620 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:21,620 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:21,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:21,621 INFO L82 PathProgramCache]: Analyzing trace with hash 237530379, now seen corresponding path program 1 times [2019-11-15 23:56:21,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:21,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302023463] [2019-11-15 23:56:21,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:21,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:21,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:21,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:21,694 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:21,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302023463] [2019-11-15 23:56:21,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:21,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:21,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467330595] [2019-11-15 23:56:21,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:21,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:21,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:21,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:21,696 INFO L87 Difference]: Start difference. First operand 254 states and 379 transitions. Second operand 4 states. [2019-11-15 23:56:22,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:22,020 INFO L93 Difference]: Finished difference Result 511 states and 765 transitions. [2019-11-15 23:56:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:22,021 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-15 23:56:22,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:22,022 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:56:22,023 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:56:22,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:56:22,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:56:22,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 378 transitions. [2019-11-15 23:56:22,033 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 378 transitions. Word has length 90 [2019-11-15 23:56:22,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:22,033 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 378 transitions. [2019-11-15 23:56:22,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:22,034 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 378 transitions. [2019-11-15 23:56:22,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:56:22,035 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:22,035 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:22,035 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:22,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:22,036 INFO L82 PathProgramCache]: Analyzing trace with hash -762865057, now seen corresponding path program 1 times [2019-11-15 23:56:22,036 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:22,036 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159388473] [2019-11-15 23:56:22,036 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:22,037 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:22,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:22,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159388473] [2019-11-15 23:56:22,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:22,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:22,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915089596] [2019-11-15 23:56:22,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:22,104 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:22,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:22,105 INFO L87 Difference]: Start difference. First operand 254 states and 378 transitions. Second operand 4 states. [2019-11-15 23:56:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:22,610 INFO L93 Difference]: Finished difference Result 536 states and 797 transitions. [2019-11-15 23:56:22,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:22,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 23:56:22,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:22,612 INFO L225 Difference]: With dead ends: 536 [2019-11-15 23:56:22,612 INFO L226 Difference]: Without dead ends: 301 [2019-11-15 23:56:22,612 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:22,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-11-15 23:56:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 254. [2019-11-15 23:56:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:22,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 377 transitions. [2019-11-15 23:56:22,620 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 377 transitions. Word has length 91 [2019-11-15 23:56:22,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:22,620 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 377 transitions. [2019-11-15 23:56:22,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:22,620 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 377 transitions. [2019-11-15 23:56:22,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 23:56:22,621 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:22,621 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:22,621 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:22,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:22,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1243945315, now seen corresponding path program 1 times [2019-11-15 23:56:22,622 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:22,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630950958] [2019-11-15 23:56:22,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:22,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:22,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:22,691 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:22,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630950958] [2019-11-15 23:56:22,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:22,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:22,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809368680] [2019-11-15 23:56:22,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:22,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:22,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:22,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:22,694 INFO L87 Difference]: Start difference. First operand 254 states and 377 transitions. Second operand 4 states. [2019-11-15 23:56:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:23,037 INFO L93 Difference]: Finished difference Result 511 states and 761 transitions. [2019-11-15 23:56:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:23,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-15 23:56:23,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:23,039 INFO L225 Difference]: With dead ends: 511 [2019-11-15 23:56:23,039 INFO L226 Difference]: Without dead ends: 276 [2019-11-15 23:56:23,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:23,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-11-15 23:56:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 254. [2019-11-15 23:56:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 376 transitions. [2019-11-15 23:56:23,047 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 376 transitions. Word has length 91 [2019-11-15 23:56:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:23,048 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 376 transitions. [2019-11-15 23:56:23,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 376 transitions. [2019-11-15 23:56:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:56:23,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:23,049 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:23,049 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:23,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash 821499940, now seen corresponding path program 1 times [2019-11-15 23:56:23,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:23,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942307774] [2019-11-15 23:56:23,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:23,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:23,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:23,120 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:23,120 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942307774] [2019-11-15 23:56:23,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:23,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:23,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960084163] [2019-11-15 23:56:23,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:23,121 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:23,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:23,122 INFO L87 Difference]: Start difference. First operand 254 states and 376 transitions. Second operand 4 states. [2019-11-15 23:56:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:23,434 INFO L93 Difference]: Finished difference Result 526 states and 781 transitions. [2019-11-15 23:56:23,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:23,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:56:23,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:23,436 INFO L225 Difference]: With dead ends: 526 [2019-11-15 23:56:23,436 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:56:23,437 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:23,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:56:23,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-15 23:56:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 375 transitions. [2019-11-15 23:56:23,446 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 375 transitions. Word has length 92 [2019-11-15 23:56:23,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:23,447 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 375 transitions. [2019-11-15 23:56:23,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:23,447 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 375 transitions. [2019-11-15 23:56:23,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 23:56:23,448 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:23,448 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:23,449 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:23,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:23,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1207086170, now seen corresponding path program 1 times [2019-11-15 23:56:23,449 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:23,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097436388] [2019-11-15 23:56:23,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:23,450 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:23,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:23,526 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:23,527 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097436388] [2019-11-15 23:56:23,527 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:23,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:23,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611763205] [2019-11-15 23:56:23,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:23,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:23,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:23,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:23,529 INFO L87 Difference]: Start difference. First operand 254 states and 375 transitions. Second operand 4 states. [2019-11-15 23:56:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:23,882 INFO L93 Difference]: Finished difference Result 501 states and 745 transitions. [2019-11-15 23:56:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:23,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-15 23:56:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:23,884 INFO L225 Difference]: With dead ends: 501 [2019-11-15 23:56:23,884 INFO L226 Difference]: Without dead ends: 266 [2019-11-15 23:56:23,885 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:23,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-15 23:56:23,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 254. [2019-11-15 23:56:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:23,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 374 transitions. [2019-11-15 23:56:23,893 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 374 transitions. Word has length 92 [2019-11-15 23:56:23,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:23,893 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 374 transitions. [2019-11-15 23:56:23,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:23,894 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 374 transitions. [2019-11-15 23:56:23,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:56:23,895 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:23,895 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:23,895 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:23,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:23,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1797179946, now seen corresponding path program 1 times [2019-11-15 23:56:23,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:23,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618717449] [2019-11-15 23:56:23,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:23,896 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:23,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:23,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618717449] [2019-11-15 23:56:23,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:23,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:23,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668777781] [2019-11-15 23:56:23,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:23,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:23,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:23,955 INFO L87 Difference]: Start difference. First operand 254 states and 374 transitions. Second operand 4 states. [2019-11-15 23:56:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:24,374 INFO L93 Difference]: Finished difference Result 526 states and 777 transitions. [2019-11-15 23:56:24,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:24,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-15 23:56:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:24,376 INFO L225 Difference]: With dead ends: 526 [2019-11-15 23:56:24,376 INFO L226 Difference]: Without dead ends: 291 [2019-11-15 23:56:24,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:24,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2019-11-15 23:56:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 254. [2019-11-15 23:56:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 23:56:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 373 transitions. [2019-11-15 23:56:24,385 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 373 transitions. Word has length 96 [2019-11-15 23:56:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:24,386 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 373 transitions. [2019-11-15 23:56:24,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 373 transitions. [2019-11-15 23:56:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-15 23:56:24,387 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:24,388 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:24,388 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1111001940, now seen corresponding path program 1 times [2019-11-15 23:56:24,388 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:24,389 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238696852] [2019-11-15 23:56:24,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,389 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:24,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:56:24,444 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238696852] [2019-11-15 23:56:24,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:24,445 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:24,445 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372488932] [2019-11-15 23:56:24,446 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:24,446 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:24,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:24,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:24,447 INFO L87 Difference]: Start difference. First operand 254 states and 373 transitions. Second operand 3 states. [2019-11-15 23:56:24,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:24,502 INFO L93 Difference]: Finished difference Result 722 states and 1074 transitions. [2019-11-15 23:56:24,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:24,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-11-15 23:56:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:24,506 INFO L225 Difference]: With dead ends: 722 [2019-11-15 23:56:24,506 INFO L226 Difference]: Without dead ends: 487 [2019-11-15 23:56:24,506 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:24,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2019-11-15 23:56:24,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 487. [2019-11-15 23:56:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2019-11-15 23:56:24,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 717 transitions. [2019-11-15 23:56:24,525 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 717 transitions. Word has length 96 [2019-11-15 23:56:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:24,526 INFO L462 AbstractCegarLoop]: Abstraction has 487 states and 717 transitions. [2019-11-15 23:56:24,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 717 transitions. [2019-11-15 23:56:24,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-15 23:56:24,527 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:24,527 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:24,528 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:24,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:24,528 INFO L82 PathProgramCache]: Analyzing trace with hash 870924278, now seen corresponding path program 1 times [2019-11-15 23:56:24,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:24,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999555596] [2019-11-15 23:56:24,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:56:24,603 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999555596] [2019-11-15 23:56:24,603 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:24,603 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:24,604 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345068316] [2019-11-15 23:56:24,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:24,604 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:24,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:24,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:24,605 INFO L87 Difference]: Start difference. First operand 487 states and 717 transitions. Second operand 3 states. [2019-11-15 23:56:24,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:24,666 INFO L93 Difference]: Finished difference Result 1190 states and 1763 transitions. [2019-11-15 23:56:24,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:24,667 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-11-15 23:56:24,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:24,671 INFO L225 Difference]: With dead ends: 1190 [2019-11-15 23:56:24,671 INFO L226 Difference]: Without dead ends: 722 [2019-11-15 23:56:24,672 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:24,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-11-15 23:56:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 720. [2019-11-15 23:56:24,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-15 23:56:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1065 transitions. [2019-11-15 23:56:24,694 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1065 transitions. Word has length 98 [2019-11-15 23:56:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:24,695 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1065 transitions. [2019-11-15 23:56:24,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1065 transitions. [2019-11-15 23:56:24,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-15 23:56:24,698 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:24,698 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:24,698 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:24,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:24,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1276717877, now seen corresponding path program 1 times [2019-11-15 23:56:24,699 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:24,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406794851] [2019-11-15 23:56:24,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,699 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:56:24,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406794851] [2019-11-15 23:56:24,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:24,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:24,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505036580] [2019-11-15 23:56:24,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:24,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:24,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:24,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:24,771 INFO L87 Difference]: Start difference. First operand 720 states and 1065 transitions. Second operand 3 states. [2019-11-15 23:56:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:24,887 INFO L93 Difference]: Finished difference Result 1656 states and 2457 transitions. [2019-11-15 23:56:24,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:24,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-15 23:56:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:24,893 INFO L225 Difference]: With dead ends: 1656 [2019-11-15 23:56:24,893 INFO L226 Difference]: Without dead ends: 955 [2019-11-15 23:56:24,895 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 955 states. [2019-11-15 23:56:24,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 955 to 953. [2019-11-15 23:56:24,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 953 states. [2019-11-15 23:56:24,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1399 transitions. [2019-11-15 23:56:24,929 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1399 transitions. Word has length 104 [2019-11-15 23:56:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:24,931 INFO L462 AbstractCegarLoop]: Abstraction has 953 states and 1399 transitions. [2019-11-15 23:56:24,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:24,931 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1399 transitions. [2019-11-15 23:56:24,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-15 23:56:24,933 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:24,934 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:24,934 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:24,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:24,934 INFO L82 PathProgramCache]: Analyzing trace with hash -796142130, now seen corresponding path program 1 times [2019-11-15 23:56:24,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:24,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053997765] [2019-11-15 23:56:24,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:24,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:56:24,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053997765] [2019-11-15 23:56:24,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:24,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:24,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717239042] [2019-11-15 23:56:25,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:25,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:25,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:25,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:25,001 INFO L87 Difference]: Start difference. First operand 953 states and 1399 transitions. Second operand 3 states. [2019-11-15 23:56:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,091 INFO L93 Difference]: Finished difference Result 2120 states and 3124 transitions. [2019-11-15 23:56:25,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:25,091 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-15 23:56:25,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,097 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 23:56:25,098 INFO L226 Difference]: Without dead ends: 1186 [2019-11-15 23:56:25,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2019-11-15 23:56:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1186. [2019-11-15 23:56:25,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1186 states. [2019-11-15 23:56:25,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1186 states to 1186 states and 1744 transitions. [2019-11-15 23:56:25,135 INFO L78 Accepts]: Start accepts. Automaton has 1186 states and 1744 transitions. Word has length 121 [2019-11-15 23:56:25,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,136 INFO L462 AbstractCegarLoop]: Abstraction has 1186 states and 1744 transitions. [2019-11-15 23:56:25,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1186 states and 1744 transitions. [2019-11-15 23:56:25,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 23:56:25,139 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,139 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:25,139 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:25,140 INFO L82 PathProgramCache]: Analyzing trace with hash 893597874, now seen corresponding path program 1 times [2019-11-15 23:56:25,140 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:25,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083375883] [2019-11-15 23:56:25,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:56:25,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083375883] [2019-11-15 23:56:25,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:25,209 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:25,209 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139150850] [2019-11-15 23:56:25,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:25,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:25,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:25,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:25,211 INFO L87 Difference]: Start difference. First operand 1186 states and 1744 transitions. Second operand 3 states. [2019-11-15 23:56:25,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,291 INFO L93 Difference]: Finished difference Result 1423 states and 2089 transitions. [2019-11-15 23:56:25,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:25,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-15 23:56:25,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,298 INFO L225 Difference]: With dead ends: 1423 [2019-11-15 23:56:25,299 INFO L226 Difference]: Without dead ends: 1421 [2019-11-15 23:56:25,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:25,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2019-11-15 23:56:25,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 1419. [2019-11-15 23:56:25,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-11-15 23:56:25,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 2086 transitions. [2019-11-15 23:56:25,345 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 2086 transitions. Word has length 127 [2019-11-15 23:56:25,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,345 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 2086 transitions. [2019-11-15 23:56:25,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:25,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 2086 transitions. [2019-11-15 23:56:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-11-15 23:56:25,349 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,349 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:25,350 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash -618148538, now seen corresponding path program 1 times [2019-11-15 23:56:25,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:25,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315050351] [2019-11-15 23:56:25,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:25,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-15 23:56:25,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315050351] [2019-11-15 23:56:25,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:25,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:56:25,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775537583] [2019-11-15 23:56:25,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:56:25,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:25,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:56:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:25,516 INFO L87 Difference]: Start difference. First operand 1419 states and 2086 transitions. Second operand 3 states. [2019-11-15 23:56:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:25,590 INFO L93 Difference]: Finished difference Result 2120 states and 3120 transitions. [2019-11-15 23:56:25,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:56:25,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-11-15 23:56:25,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:25,600 INFO L225 Difference]: With dead ends: 2120 [2019-11-15 23:56:25,600 INFO L226 Difference]: Without dead ends: 1652 [2019-11-15 23:56:25,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:56:25,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2019-11-15 23:56:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1652. [2019-11-15 23:56:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-11-15 23:56:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2432 transitions. [2019-11-15 23:56:25,649 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2432 transitions. Word has length 164 [2019-11-15 23:56:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:25,650 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 2432 transitions. [2019-11-15 23:56:25,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:56:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2432 transitions. [2019-11-15 23:56:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 23:56:25,655 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:25,655 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:25,655 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash 383929993, now seen corresponding path program 1 times [2019-11-15 23:56:25,656 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:25,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633389657] [2019-11-15 23:56:25,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,656 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:25,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:56:25,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633389657] [2019-11-15 23:56:25,737 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:25,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:25,738 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358452599] [2019-11-15 23:56:25,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:25,738 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:25,739 INFO L87 Difference]: Start difference. First operand 1652 states and 2432 transitions. Second operand 4 states. [2019-11-15 23:56:26,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:26,245 INFO L93 Difference]: Finished difference Result 3726 states and 5519 transitions. [2019-11-15 23:56:26,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:26,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-11-15 23:56:26,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:26,257 INFO L225 Difference]: With dead ends: 3726 [2019-11-15 23:56:26,257 INFO L226 Difference]: Without dead ends: 2093 [2019-11-15 23:56:26,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-11-15 23:56:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-11-15 23:56:26,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:26,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2775 transitions. [2019-11-15 23:56:26,318 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2775 transitions. Word has length 172 [2019-11-15 23:56:26,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:26,318 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2775 transitions. [2019-11-15 23:56:26,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2775 transitions. [2019-11-15 23:56:26,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-11-15 23:56:26,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:26,323 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:26,323 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:26,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:26,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1861094142, now seen corresponding path program 1 times [2019-11-15 23:56:26,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:26,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427395562] [2019-11-15 23:56:26,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:26,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:26,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:26,412 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427395562] [2019-11-15 23:56:26,412 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:26,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:26,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368207549] [2019-11-15 23:56:26,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:26,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:26,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:26,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:26,414 INFO L87 Difference]: Start difference. First operand 1848 states and 2775 transitions. Second operand 4 states. [2019-11-15 23:56:26,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:26,927 INFO L93 Difference]: Finished difference Result 3922 states and 5855 transitions. [2019-11-15 23:56:26,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:26,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-11-15 23:56:26,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:26,938 INFO L225 Difference]: With dead ends: 3922 [2019-11-15 23:56:26,939 INFO L226 Difference]: Without dead ends: 2093 [2019-11-15 23:56:26,941 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:26,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2093 states. [2019-11-15 23:56:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2093 to 1848. [2019-11-15 23:56:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2768 transitions. [2019-11-15 23:56:26,999 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2768 transitions. Word has length 185 [2019-11-15 23:56:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:26,999 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2768 transitions. [2019-11-15 23:56:26,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2768 transitions. [2019-11-15 23:56:27,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:56:27,003 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:27,004 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:27,004 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:27,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:27,004 INFO L82 PathProgramCache]: Analyzing trace with hash 593014019, now seen corresponding path program 1 times [2019-11-15 23:56:27,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:27,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546204198] [2019-11-15 23:56:27,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:27,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:27,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:27,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 314 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:27,102 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546204198] [2019-11-15 23:56:27,102 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:27,103 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:27,103 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905225360] [2019-11-15 23:56:27,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:27,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:27,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:27,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:27,104 INFO L87 Difference]: Start difference. First operand 1848 states and 2768 transitions. Second operand 4 states. [2019-11-15 23:56:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:27,551 INFO L93 Difference]: Finished difference Result 3908 states and 5827 transitions. [2019-11-15 23:56:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:27,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 23:56:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:27,562 INFO L225 Difference]: With dead ends: 3908 [2019-11-15 23:56:27,562 INFO L226 Difference]: Without dead ends: 2079 [2019-11-15 23:56:27,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:27,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2019-11-15 23:56:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1848. [2019-11-15 23:56:27,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:27,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2761 transitions. [2019-11-15 23:56:27,620 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2761 transitions. Word has length 186 [2019-11-15 23:56:27,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:27,621 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2761 transitions. [2019-11-15 23:56:27,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2761 transitions. [2019-11-15 23:56:27,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-11-15 23:56:27,625 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:27,626 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:27,626 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash -699433533, now seen corresponding path program 1 times [2019-11-15 23:56:27,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:27,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623137426] [2019-11-15 23:56:27,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:27,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:27,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:27,732 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:27,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623137426] [2019-11-15 23:56:27,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:27,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:27,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083187498] [2019-11-15 23:56:27,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:27,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:27,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:27,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:27,734 INFO L87 Difference]: Start difference. First operand 1848 states and 2761 transitions. Second operand 4 states. [2019-11-15 23:56:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:28,285 INFO L93 Difference]: Finished difference Result 3901 states and 5806 transitions. [2019-11-15 23:56:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:28,286 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-11-15 23:56:28,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:28,296 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 23:56:28,297 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 23:56:28,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 23:56:28,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 23:56:28,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:28,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2754 transitions. [2019-11-15 23:56:28,355 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2754 transitions. Word has length 186 [2019-11-15 23:56:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:28,355 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2754 transitions. [2019-11-15 23:56:28,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2754 transitions. [2019-11-15 23:56:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-11-15 23:56:28,360 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:28,361 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:28,362 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:28,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:28,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1460921410, now seen corresponding path program 1 times [2019-11-15 23:56:28,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:28,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063118055] [2019-11-15 23:56:28,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:28,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:28,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:28,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063118055] [2019-11-15 23:56:28,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:28,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:28,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040788202] [2019-11-15 23:56:28,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:28,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:28,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:28,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:28,489 INFO L87 Difference]: Start difference. First operand 1848 states and 2754 transitions. Second operand 4 states. [2019-11-15 23:56:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:28,952 INFO L93 Difference]: Finished difference Result 3901 states and 5792 transitions. [2019-11-15 23:56:28,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:28,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-11-15 23:56:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:28,963 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 23:56:28,963 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 23:56:28,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:28,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 23:56:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 23:56:29,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:29,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2747 transitions. [2019-11-15 23:56:29,015 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2747 transitions. Word has length 187 [2019-11-15 23:56:29,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:29,016 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2747 transitions. [2019-11-15 23:56:29,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:29,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2747 transitions. [2019-11-15 23:56:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-15 23:56:29,020 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:29,020 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:29,020 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:29,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:29,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1574944825, now seen corresponding path program 1 times [2019-11-15 23:56:29,021 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:29,021 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233633728] [2019-11-15 23:56:29,021 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:29,022 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:29,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:29,105 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:29,106 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233633728] [2019-11-15 23:56:29,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:29,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:29,106 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305544473] [2019-11-15 23:56:29,107 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:29,107 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:29,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:29,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:29,107 INFO L87 Difference]: Start difference. First operand 1848 states and 2747 transitions. Second operand 4 states. [2019-11-15 23:56:29,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:29,493 INFO L93 Difference]: Finished difference Result 3901 states and 5778 transitions. [2019-11-15 23:56:29,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:29,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2019-11-15 23:56:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:29,515 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 23:56:29,516 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 23:56:29,518 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:29,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 23:56:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 23:56:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2740 transitions. [2019-11-15 23:56:29,576 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2740 transitions. Word has length 188 [2019-11-15 23:56:29,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:29,577 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2740 transitions. [2019-11-15 23:56:29,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2740 transitions. [2019-11-15 23:56:29,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-11-15 23:56:29,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:29,581 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:29,582 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:29,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:29,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1346205799, now seen corresponding path program 1 times [2019-11-15 23:56:29,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:29,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591508349] [2019-11-15 23:56:29,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:29,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:29,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:29,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591508349] [2019-11-15 23:56:29,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:29,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:29,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901919777] [2019-11-15 23:56:29,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:29,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:29,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:29,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:29,664 INFO L87 Difference]: Start difference. First operand 1848 states and 2740 transitions. Second operand 4 states. [2019-11-15 23:56:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:29,975 INFO L93 Difference]: Finished difference Result 3901 states and 5764 transitions. [2019-11-15 23:56:29,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:29,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-11-15 23:56:29,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:29,980 INFO L225 Difference]: With dead ends: 3901 [2019-11-15 23:56:29,981 INFO L226 Difference]: Without dead ends: 2072 [2019-11-15 23:56:29,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:29,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2019-11-15 23:56:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 1848. [2019-11-15 23:56:30,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:30,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2733 transitions. [2019-11-15 23:56:30,027 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2733 transitions. Word has length 189 [2019-11-15 23:56:30,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:30,027 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2733 transitions. [2019-11-15 23:56:30,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:30,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2733 transitions. [2019-11-15 23:56:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-11-15 23:56:30,031 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:30,032 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:30,032 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:30,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:30,032 INFO L82 PathProgramCache]: Analyzing trace with hash -43681972, now seen corresponding path program 1 times [2019-11-15 23:56:30,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:30,033 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376822786] [2019-11-15 23:56:30,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:30,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:30,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:30,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:30,121 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:30,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376822786] [2019-11-15 23:56:30,122 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:30,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:30,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979537803] [2019-11-15 23:56:30,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:30,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:30,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:30,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:30,123 INFO L87 Difference]: Start difference. First operand 1848 states and 2733 transitions. Second operand 4 states. [2019-11-15 23:56:30,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:30,442 INFO L93 Difference]: Finished difference Result 3831 states and 5666 transitions. [2019-11-15 23:56:30,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:30,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-11-15 23:56:30,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:30,447 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 23:56:30,447 INFO L226 Difference]: Without dead ends: 2002 [2019-11-15 23:56:30,449 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-15 23:56:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-15 23:56:30,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:30,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2726 transitions. [2019-11-15 23:56:30,492 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2726 transitions. Word has length 190 [2019-11-15 23:56:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:30,493 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2726 transitions. [2019-11-15 23:56:30,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:30,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2726 transitions. [2019-11-15 23:56:30,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-15 23:56:30,497 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:30,497 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:30,497 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:30,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1447453746, now seen corresponding path program 1 times [2019-11-15 23:56:30,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:30,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827241435] [2019-11-15 23:56:30,498 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:30,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:30,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:30,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:30,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827241435] [2019-11-15 23:56:30,592 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:30,592 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:30,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257957817] [2019-11-15 23:56:30,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:30,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:30,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:30,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:30,594 INFO L87 Difference]: Start difference. First operand 1848 states and 2726 transitions. Second operand 4 states. [2019-11-15 23:56:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:31,018 INFO L93 Difference]: Finished difference Result 3831 states and 5652 transitions. [2019-11-15 23:56:31,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:31,019 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-15 23:56:31,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:31,023 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 23:56:31,023 INFO L226 Difference]: Without dead ends: 2002 [2019-11-15 23:56:31,025 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-15 23:56:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-15 23:56:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2719 transitions. [2019-11-15 23:56:31,069 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2719 transitions. Word has length 194 [2019-11-15 23:56:31,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:31,069 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2719 transitions. [2019-11-15 23:56:31,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2719 transitions. [2019-11-15 23:56:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-15 23:56:31,073 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:31,073 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:31,073 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:31,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:31,074 INFO L82 PathProgramCache]: Analyzing trace with hash 161862790, now seen corresponding path program 1 times [2019-11-15 23:56:31,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:31,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990945000] [2019-11-15 23:56:31,074 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:31,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:31,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:31,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990945000] [2019-11-15 23:56:31,206 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:31,206 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:31,206 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605114352] [2019-11-15 23:56:31,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:31,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:31,207 INFO L87 Difference]: Start difference. First operand 1848 states and 2719 transitions. Second operand 4 states. [2019-11-15 23:56:31,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:31,688 INFO L93 Difference]: Finished difference Result 3831 states and 5638 transitions. [2019-11-15 23:56:31,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:31,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-11-15 23:56:31,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:31,693 INFO L225 Difference]: With dead ends: 3831 [2019-11-15 23:56:31,693 INFO L226 Difference]: Without dead ends: 2002 [2019-11-15 23:56:31,695 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2002 states. [2019-11-15 23:56:31,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2002 to 1848. [2019-11-15 23:56:31,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:31,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2712 transitions. [2019-11-15 23:56:31,742 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2712 transitions. Word has length 194 [2019-11-15 23:56:31,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:31,742 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2712 transitions. [2019-11-15 23:56:31,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:31,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2712 transitions. [2019-11-15 23:56:31,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:56:31,747 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:31,747 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:31,747 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:31,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:31,748 INFO L82 PathProgramCache]: Analyzing trace with hash -345495059, now seen corresponding path program 1 times [2019-11-15 23:56:31,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:31,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685608819] [2019-11-15 23:56:31,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:31,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:31,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:31,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685608819] [2019-11-15 23:56:31,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:31,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:31,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722671135] [2019-11-15 23:56:31,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:31,847 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:31,847 INFO L87 Difference]: Start difference. First operand 1848 states and 2712 transitions. Second operand 4 states. [2019-11-15 23:56:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:32,218 INFO L93 Difference]: Finished difference Result 3803 states and 5585 transitions. [2019-11-15 23:56:32,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:32,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-15 23:56:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:32,222 INFO L225 Difference]: With dead ends: 3803 [2019-11-15 23:56:32,223 INFO L226 Difference]: Without dead ends: 1974 [2019-11-15 23:56:32,225 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:32,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1974 states. [2019-11-15 23:56:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1974 to 1848. [2019-11-15 23:56:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2705 transitions. [2019-11-15 23:56:32,258 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2705 transitions. Word has length 195 [2019-11-15 23:56:32,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:32,258 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2705 transitions. [2019-11-15 23:56:32,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:32,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2705 transitions. [2019-11-15 23:56:32,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-15 23:56:32,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:32,263 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:32,263 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:32,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1457997217, now seen corresponding path program 1 times [2019-11-15 23:56:32,264 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:32,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501253252] [2019-11-15 23:56:32,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:32,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:32,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:32,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:56:32,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501253252] [2019-11-15 23:56:32,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:32,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:32,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493998826] [2019-11-15 23:56:32,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:32,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:32,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:32,362 INFO L87 Difference]: Start difference. First operand 1848 states and 2705 transitions. Second operand 4 states. [2019-11-15 23:56:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:32,706 INFO L93 Difference]: Finished difference Result 3768 states and 5525 transitions. [2019-11-15 23:56:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:32,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-11-15 23:56:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:32,710 INFO L225 Difference]: With dead ends: 3768 [2019-11-15 23:56:32,710 INFO L226 Difference]: Without dead ends: 1939 [2019-11-15 23:56:32,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:32,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1939 states. [2019-11-15 23:56:32,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1939 to 1848. [2019-11-15 23:56:32,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1848 states. [2019-11-15 23:56:32,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1848 states to 1848 states and 2698 transitions. [2019-11-15 23:56:32,758 INFO L78 Accepts]: Start accepts. Automaton has 1848 states and 2698 transitions. Word has length 195 [2019-11-15 23:56:32,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:32,758 INFO L462 AbstractCegarLoop]: Abstraction has 1848 states and 2698 transitions. [2019-11-15 23:56:32,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:32,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1848 states and 2698 transitions. [2019-11-15 23:56:32,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-15 23:56:32,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:32,762 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:32,762 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:32,763 INFO L82 PathProgramCache]: Analyzing trace with hash -2120220672, now seen corresponding path program 1 times [2019-11-15 23:56:32,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:32,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724922961] [2019-11-15 23:56:32,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:32,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:32,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:32,868 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 207 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-15 23:56:32,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724922961] [2019-11-15 23:56:32,869 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:32,869 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:56:32,869 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439012739] [2019-11-15 23:56:32,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:32,870 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:32,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:32,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:32,870 INFO L87 Difference]: Start difference. First operand 1848 states and 2698 transitions. Second operand 4 states. [2019-11-15 23:56:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:33,278 INFO L93 Difference]: Finished difference Result 4146 states and 6093 transitions. [2019-11-15 23:56:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:33,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-15 23:56:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:33,284 INFO L225 Difference]: With dead ends: 4146 [2019-11-15 23:56:33,285 INFO L226 Difference]: Without dead ends: 2317 [2019-11-15 23:56:33,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2019-11-15 23:56:33,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2058. [2019-11-15 23:56:33,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2058 states. [2019-11-15 23:56:33,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2058 states to 2058 states and 3069 transitions. [2019-11-15 23:56:33,333 INFO L78 Accepts]: Start accepts. Automaton has 2058 states and 3069 transitions. Word has length 197 [2019-11-15 23:56:33,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:33,334 INFO L462 AbstractCegarLoop]: Abstraction has 2058 states and 3069 transitions. [2019-11-15 23:56:33,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 2058 states and 3069 transitions. [2019-11-15 23:56:33,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 23:56:33,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:33,338 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:33,338 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:33,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:33,339 INFO L82 PathProgramCache]: Analyzing trace with hash 650332099, now seen corresponding path program 1 times [2019-11-15 23:56:33,339 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:33,339 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945394362] [2019-11-15 23:56:33,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:33,339 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:33,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:33,575 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:56:33,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945394362] [2019-11-15 23:56:33,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:33,575 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:33,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348839336] [2019-11-15 23:56:33,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:33,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:33,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:33,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:33,577 INFO L87 Difference]: Start difference. First operand 2058 states and 3069 transitions. Second operand 5 states. [2019-11-15 23:56:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:34,890 INFO L93 Difference]: Finished difference Result 6252 states and 9378 transitions. [2019-11-15 23:56:34,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:56:34,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-11-15 23:56:34,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:34,896 INFO L225 Difference]: With dead ends: 6252 [2019-11-15 23:56:34,896 INFO L226 Difference]: Without dead ends: 4213 [2019-11-15 23:56:34,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4213 states. [2019-11-15 23:56:34,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4213 to 2261. [2019-11-15 23:56:34,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-11-15 23:56:34,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3419 transitions. [2019-11-15 23:56:34,968 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3419 transitions. Word has length 203 [2019-11-15 23:56:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:34,969 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 3419 transitions. [2019-11-15 23:56:34,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:34,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3419 transitions. [2019-11-15 23:56:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-11-15 23:56:34,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:34,973 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:34,974 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash 577945541, now seen corresponding path program 1 times [2019-11-15 23:56:34,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:34,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517275361] [2019-11-15 23:56:34,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:34,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:34,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:35,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:56:35,239 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517275361] [2019-11-15 23:56:35,239 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:35,240 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:35,240 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93952798] [2019-11-15 23:56:35,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:35,240 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:35,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:35,241 INFO L87 Difference]: Start difference. First operand 2261 states and 3419 transitions. Second operand 5 states. [2019-11-15 23:56:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:36,261 INFO L93 Difference]: Finished difference Result 7043 states and 10757 transitions. [2019-11-15 23:56:36,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:56:36,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-11-15 23:56:36,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:36,269 INFO L225 Difference]: With dead ends: 7043 [2019-11-15 23:56:36,270 INFO L226 Difference]: Without dead ends: 4801 [2019-11-15 23:56:36,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:36,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4801 states. [2019-11-15 23:56:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4801 to 2254. [2019-11-15 23:56:36,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2019-11-15 23:56:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 3412 transitions. [2019-11-15 23:56:36,345 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 3412 transitions. Word has length 203 [2019-11-15 23:56:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:36,345 INFO L462 AbstractCegarLoop]: Abstraction has 2254 states and 3412 transitions. [2019-11-15 23:56:36,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 3412 transitions. [2019-11-15 23:56:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 23:56:36,349 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:36,350 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:36,350 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:36,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:36,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1074096582, now seen corresponding path program 1 times [2019-11-15 23:56:36,351 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:36,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614226281] [2019-11-15 23:56:36,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:36,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:36,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:56:36,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614226281] [2019-11-15 23:56:36,565 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:36,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:36,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622117060] [2019-11-15 23:56:36,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:36,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:36,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:36,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:36,567 INFO L87 Difference]: Start difference. First operand 2254 states and 3412 transitions. Second operand 5 states. [2019-11-15 23:56:37,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:37,537 INFO L93 Difference]: Finished difference Result 6728 states and 10211 transitions. [2019-11-15 23:56:37,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:56:37,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-11-15 23:56:37,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:37,540 INFO L225 Difference]: With dead ends: 6728 [2019-11-15 23:56:37,541 INFO L226 Difference]: Without dead ends: 4493 [2019-11-15 23:56:37,543 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4493 states. [2019-11-15 23:56:37,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4493 to 2464. [2019-11-15 23:56:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2019-11-15 23:56:37,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 3769 transitions. [2019-11-15 23:56:37,630 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 3769 transitions. Word has length 204 [2019-11-15 23:56:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:37,631 INFO L462 AbstractCegarLoop]: Abstraction has 2464 states and 3769 transitions. [2019-11-15 23:56:37,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:37,631 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 3769 transitions. [2019-11-15 23:56:37,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-11-15 23:56:37,635 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:37,635 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:37,636 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:37,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1169886716, now seen corresponding path program 1 times [2019-11-15 23:56:37,636 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:37,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061206603] [2019-11-15 23:56:37,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:37,637 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:37,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:37,915 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2019-11-15 23:56:37,915 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061206603] [2019-11-15 23:56:37,915 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:37,916 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:56:37,916 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062205622] [2019-11-15 23:56:37,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:56:37,917 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:56:37,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:56:37,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:56:37,917 INFO L87 Difference]: Start difference. First operand 2464 states and 3769 transitions. Second operand 5 states. [2019-11-15 23:56:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:39,383 INFO L93 Difference]: Finished difference Result 7155 states and 10932 transitions. [2019-11-15 23:56:39,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:56:39,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 204 [2019-11-15 23:56:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:39,387 INFO L225 Difference]: With dead ends: 7155 [2019-11-15 23:56:39,387 INFO L226 Difference]: Without dead ends: 4710 [2019-11-15 23:56:39,390 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:56:39,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2019-11-15 23:56:39,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 2261. [2019-11-15 23:56:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-11-15 23:56:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 3419 transitions. [2019-11-15 23:56:39,482 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 3419 transitions. Word has length 204 [2019-11-15 23:56:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:39,482 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 3419 transitions. [2019-11-15 23:56:39,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:56:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 3419 transitions. [2019-11-15 23:56:39,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 23:56:39,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:39,487 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:39,487 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:39,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:39,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1414950854, now seen corresponding path program 1 times [2019-11-15 23:56:39,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:56:39,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34074460] [2019-11-15 23:56:39,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:39,488 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:56:39,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:56:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:39,937 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 233 proven. 14 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-15 23:56:39,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34074460] [2019-11-15 23:56:39,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236477105] [2019-11-15 23:56:39,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:40,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:40,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:56:40,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:40,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2019-11-15 23:56:40,337 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:40,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:40,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:40,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:9 [2019-11-15 23:56:40,370 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_158|, |v_#memory_$Pointer$.base_158|], 3=[|v_#memory_int_179|]} [2019-11-15 23:56:40,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-11-15 23:56:40,375 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:40,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:40,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:56:40,388 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:56:40,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:40,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:40,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 55 [2019-11-15 23:56:40,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:40,440 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_4], 1=[v_arrayElimCell_5]} [2019-11-15 23:56:40,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:56:40,645 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 23:56:40,649 INFO L168 Benchmark]: Toolchain (without parser) took 38800.84 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 756.0 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -257.4 MB). Peak memory consumption was 498.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:40,649 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:40,651 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:40,651 INFO L168 Benchmark]: Boogie Procedure Inliner took 109.08 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:40,651 INFO L168 Benchmark]: Boogie Preprocessor took 100.81 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:40,652 INFO L168 Benchmark]: RCFGBuilder took 1454.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:40,652 INFO L168 Benchmark]: TraceAbstraction took 36354.08 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 618.7 MB). Free memory was 998.7 MB in the beginning and 1.2 GB in the end (delta: -203.4 MB). Peak memory consumption was 415.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:40,654 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 771.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 109.08 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.81 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1454.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.7 MB in the end (delta: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36354.08 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 618.7 MB). Free memory was 998.7 MB in the beginning and 1.2 GB in the end (delta: -203.4 MB). Peak memory consumption was 415.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 23:56:42,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:56:42,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:56:42,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:56:42,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:56:42,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:56:42,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:56:42,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:56:42,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:56:42,894 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:56:42,895 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:56:42,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:56:42,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:56:42,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:56:42,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:56:42,900 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:56:42,901 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:56:42,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:56:42,904 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:56:42,906 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:56:42,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:56:42,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:56:42,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:56:42,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:56:42,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:56:42,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:56:42,915 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:56:42,916 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:56:42,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:56:42,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:56:42,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:56:42,918 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:56:42,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:56:42,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:56:42,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:56:42,921 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:56:42,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:56:42,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:56:42,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:56:42,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:56:42,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:56:42,925 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:56:42,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:56:42,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:56:42,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:56:42,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:56:42,943 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:56:42,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:56:42,944 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:56:42,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:56:42,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:56:42,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:56:42,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:56:42,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:56:42,945 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:56:42,945 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:56:42,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:56:42,946 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:56:42,946 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:56:42,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:56:42,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:56:42,947 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:56:42,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:56:42,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:56:42,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:42,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:56:42,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:56:42,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:56:42,948 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:56:42,948 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:56:42,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:56:42,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:56:42,949 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_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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 -> 4bea9123dc38197075cd07fcd6899770fae2083a [2019-11-15 23:56:42,979 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:56:42,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:56:42,995 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:56:42,998 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:56:43,001 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:56:43,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-11-15 23:56:43,083 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/0d7b9c67a/38ed4aae03ac4e5383d424dc84d87678/FLAGc708f44e4 [2019-11-15 23:56:43,656 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:56:43,658 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/sv-benchmarks/c/ssh/s3_srvr.blast.09.i.cil-1.c [2019-11-15 23:56:43,679 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/0d7b9c67a/38ed4aae03ac4e5383d424dc84d87678/FLAGc708f44e4 [2019-11-15 23:56:43,865 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/data/0d7b9c67a/38ed4aae03ac4e5383d424dc84d87678 [2019-11-15 23:56:43,868 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:56:43,869 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:56:43,870 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:43,871 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:56:43,874 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:56:43,875 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:43" (1/1) ... [2019-11-15 23:56:43,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7648694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:43, skipping insertion in model container [2019-11-15 23:56:43,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:56:43" (1/1) ... [2019-11-15 23:56:43,884 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:56:43,940 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:56:44,567 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:44,596 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:56:44,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:56:44,718 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:56:44,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44 WrapperNode [2019-11-15 23:56:44,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:56:44,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:44,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:56:44,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:56:44,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,754 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:56:44,807 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:56:44,807 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:56:44,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:56:44,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,827 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... [2019-11-15 23:56:44,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:56:44,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:56:44,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:56:44,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:56:44,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:56:44,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:56:44,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:56:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:56:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:56:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:56:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:56:44,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:56:44,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:56:45,214 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 23:56:48,515 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-15 23:56:48,515 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-15 23:56:48,517 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:56:48,517 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:56:48,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:48 BoogieIcfgContainer [2019-11-15 23:56:48,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:56:48,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:56:48,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:56:48,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:56:48,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:56:43" (1/3) ... [2019-11-15 23:56:48,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa71b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:48, skipping insertion in model container [2019-11-15 23:56:48,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:56:44" (2/3) ... [2019-11-15 23:56:48,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa71b0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:56:48, skipping insertion in model container [2019-11-15 23:56:48,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:56:48" (3/3) ... [2019-11-15 23:56:48,528 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.09.i.cil-1.c [2019-11-15 23:56:48,538 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:56:48,546 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:56:48,557 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:56:48,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:56:48,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:56:48,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:56:48,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:56:48,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:56:48,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:56:48,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:56:48,586 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:56:48,616 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 23:56:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:56:48,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:48,633 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:48,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:48,642 INFO L82 PathProgramCache]: Analyzing trace with hash -2031756973, now seen corresponding path program 1 times [2019-11-15 23:56:48,656 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:48,656 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [638906395] [2019-11-15 23:56:48,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:48,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:56:48,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:49,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:49,004 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:49,048 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [638906395] [2019-11-15 23:56:49,048 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:49,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:56:49,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138223973] [2019-11-15 23:56:49,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:49,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:49,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:49,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:49,075 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 4 states. [2019-11-15 23:56:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:49,317 INFO L93 Difference]: Finished difference Result 564 states and 962 transitions. [2019-11-15 23:56:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:49,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:56:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:49,345 INFO L225 Difference]: With dead ends: 564 [2019-11-15 23:56:49,345 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 23:56:49,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 23:56:49,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2019-11-15 23:56:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-15 23:56:49,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 584 transitions. [2019-11-15 23:56:49,455 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 584 transitions. Word has length 35 [2019-11-15 23:56:49,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:49,456 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 584 transitions. [2019-11-15 23:56:49,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:49,456 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 584 transitions. [2019-11-15 23:56:49,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 23:56:49,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:49,465 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:49,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:49,669 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:49,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:49,669 INFO L82 PathProgramCache]: Analyzing trace with hash -718881007, now seen corresponding path program 1 times [2019-11-15 23:56:49,670 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:49,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2034508522] [2019-11-15 23:56:49,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:49,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:56:49,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:49,903 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:49,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:56:49,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2034508522] [2019-11-15 23:56:49,938 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:49,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:56:49,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651732112] [2019-11-15 23:56:49,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:49,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:49,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:49,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:49,941 INFO L87 Difference]: Start difference. First operand 383 states and 584 transitions. Second operand 4 states. [2019-11-15 23:56:50,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:50,413 INFO L93 Difference]: Finished difference Result 880 states and 1354 transitions. [2019-11-15 23:56:50,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:50,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 23:56:50,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:50,418 INFO L225 Difference]: With dead ends: 880 [2019-11-15 23:56:50,418 INFO L226 Difference]: Without dead ends: 629 [2019-11-15 23:56:50,421 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:50,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-11-15 23:56:50,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-11-15 23:56:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-11-15 23:56:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 953 transitions. [2019-11-15 23:56:50,473 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 953 transitions. Word has length 58 [2019-11-15 23:56:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:50,474 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 953 transitions. [2019-11-15 23:56:50,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:50,478 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 953 transitions. [2019-11-15 23:56:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 23:56:50,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:50,487 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:50,687 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:50,687 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:50,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:50,688 INFO L82 PathProgramCache]: Analyzing trace with hash 317355092, now seen corresponding path program 1 times [2019-11-15 23:56:50,689 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:50,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1944542075] [2019-11-15 23:56:50,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:50,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:56:51,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:51,054 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-15 23:56:51,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1944542075] [2019-11-15 23:56:51,084 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:51,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:56:51,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082033497] [2019-11-15 23:56:51,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:51,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:51,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:51,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:51,087 INFO L87 Difference]: Start difference. First operand 627 states and 953 transitions. Second operand 4 states. [2019-11-15 23:56:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:51,566 INFO L93 Difference]: Finished difference Result 1366 states and 2090 transitions. [2019-11-15 23:56:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:51,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-15 23:56:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:51,572 INFO L225 Difference]: With dead ends: 1366 [2019-11-15 23:56:51,573 INFO L226 Difference]: Without dead ends: 871 [2019-11-15 23:56:51,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:51,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-11-15 23:56:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2019-11-15 23:56:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2019-11-15 23:56:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1321 transitions. [2019-11-15 23:56:51,621 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1321 transitions. Word has length 119 [2019-11-15 23:56:51,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:51,623 INFO L462 AbstractCegarLoop]: Abstraction has 871 states and 1321 transitions. [2019-11-15 23:56:51,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:51,623 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1321 transitions. [2019-11-15 23:56:51,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-15 23:56:51,627 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:51,627 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:51,831 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:51,831 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:51,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:51,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2038642215, now seen corresponding path program 1 times [2019-11-15 23:56:51,834 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:51,835 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1128029775] [2019-11-15 23:56:51,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:52,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:56:52,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:56:52,181 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 23:56:52,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128029775] [2019-11-15 23:56:52,220 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:52,220 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-15 23:56:52,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408604827] [2019-11-15 23:56:52,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:52,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:52,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:52,222 INFO L87 Difference]: Start difference. First operand 871 states and 1321 transitions. Second operand 4 states. [2019-11-15 23:56:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:52,727 INFO L93 Difference]: Finished difference Result 1858 states and 2829 transitions. [2019-11-15 23:56:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:52,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-11-15 23:56:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:52,737 INFO L225 Difference]: With dead ends: 1858 [2019-11-15 23:56:52,738 INFO L226 Difference]: Without dead ends: 1119 [2019-11-15 23:56:52,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:52,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2019-11-15 23:56:52,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2019-11-15 23:56:52,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2019-11-15 23:56:52,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 1692 transitions. [2019-11-15 23:56:52,792 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 1692 transitions. Word has length 148 [2019-11-15 23:56:52,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:52,794 INFO L462 AbstractCegarLoop]: Abstraction has 1119 states and 1692 transitions. [2019-11-15 23:56:52,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:52,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1692 transitions. [2019-11-15 23:56:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-11-15 23:56:52,798 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:52,798 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:56:53,000 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:53,008 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:53,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:53,009 INFO L82 PathProgramCache]: Analyzing trace with hash 928802567, now seen corresponding path program 1 times [2019-11-15 23:56:53,010 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:53,010 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [260046551] [2019-11-15 23:56:53,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:56:54,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:54,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:56:54,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:54,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:56:54,814 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:56:54,814 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:54,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:54,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:54,827 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:56:54,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:54,879 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:56:54,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:54,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:54,884 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-15 23:56:54,884 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:56:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:56:54,975 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:55,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:56:55,031 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:56:55,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:55,033 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:56:55,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:56:55,034 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-15 23:56:55,035 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:56:55,111 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:56:55,112 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [260046551] [2019-11-15 23:56:55,112 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:55,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:56:55,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863487039] [2019-11-15 23:56:55,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:56:55,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:55,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:56:55,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:56:55,114 INFO L87 Difference]: Start difference. First operand 1119 states and 1692 transitions. Second operand 7 states. [2019-11-15 23:57:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:12,338 INFO L93 Difference]: Finished difference Result 4196 states and 6384 transitions. [2019-11-15 23:57:12,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:12,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 172 [2019-11-15 23:57:12,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:12,358 INFO L225 Difference]: With dead ends: 4196 [2019-11-15 23:57:12,358 INFO L226 Difference]: Without dead ends: 3085 [2019-11-15 23:57:12,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:57:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3085 states. [2019-11-15 23:57:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3085 to 1506. [2019-11-15 23:57:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2019-11-15 23:57:12,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 2412 transitions. [2019-11-15 23:57:12,445 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 2412 transitions. Word has length 172 [2019-11-15 23:57:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:12,446 INFO L462 AbstractCegarLoop]: Abstraction has 1506 states and 2412 transitions. [2019-11-15 23:57:12,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:57:12,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 2412 transitions. [2019-11-15 23:57:12,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-15 23:57:12,460 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:12,461 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:12,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:12,670 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:12,671 INFO L82 PathProgramCache]: Analyzing trace with hash 876992459, now seen corresponding path program 1 times [2019-11-15 23:57:12,672 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:57:12,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [788465341] [2019-11-15 23:57:12,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:14,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:14,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:14,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:57:14,403 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:57:14,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:14,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:14,415 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:57:14,415 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:57:14,438 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:14,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:57:14,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:14,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:14,441 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-15 23:57:14,441 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:57:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:57:14,485 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:57:14,525 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:57:14,528 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:14,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:14,530 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:57:14,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:14,531 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-15 23:57:14,531 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:57:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-15 23:57:14,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [788465341] [2019-11-15 23:57:14,570 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:14,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:57:14,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693342250] [2019-11-15 23:57:14,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:57:14,571 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:57:14,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:57:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:14,572 INFO L87 Difference]: Start difference. First operand 1506 states and 2412 transitions. Second operand 7 states. [2019-11-15 23:57:26,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:26,530 INFO L93 Difference]: Finished difference Result 4879 states and 7679 transitions. [2019-11-15 23:57:26,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:26,531 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 173 [2019-11-15 23:57:26,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:26,551 INFO L225 Difference]: With dead ends: 4879 [2019-11-15 23:57:26,551 INFO L226 Difference]: Without dead ends: 3345 [2019-11-15 23:57:26,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:57:26,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3345 states. [2019-11-15 23:57:26,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3345 to 1841. [2019-11-15 23:57:26,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1841 states. [2019-11-15 23:57:26,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1841 states to 1841 states and 3034 transitions. [2019-11-15 23:57:26,655 INFO L78 Accepts]: Start accepts. Automaton has 1841 states and 3034 transitions. Word has length 173 [2019-11-15 23:57:26,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:26,656 INFO L462 AbstractCegarLoop]: Abstraction has 1841 states and 3034 transitions. [2019-11-15 23:57:26,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:57:26,656 INFO L276 IsEmpty]: Start isEmpty. Operand 1841 states and 3034 transitions. [2019-11-15 23:57:26,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-15 23:57:26,661 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:26,661 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:26,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:26,866 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:26,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash -565791259, now seen corresponding path program 1 times [2019-11-15 23:57:26,867 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:57:26,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [873526067] [2019-11-15 23:57:26,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:28,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:28,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:28,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:57:28,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:57:28,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:28,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:28,985 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:57:28,985 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:57:29,009 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:29,009 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:57:29,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:29,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:29,012 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-15 23:57:29,012 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:57:29,064 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:57:29,064 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:57:29,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:57:29,095 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:29,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:29,096 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:57:29,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:29,097 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-15 23:57:29,097 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:57:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:57:29,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [873526067] [2019-11-15 23:57:29,122 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:29,122 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:57:29,122 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325564025] [2019-11-15 23:57:29,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:57:29,123 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:57:29,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:57:29,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:29,123 INFO L87 Difference]: Start difference. First operand 1841 states and 3034 transitions. Second operand 7 states. [2019-11-15 23:57:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:43,820 INFO L93 Difference]: Finished difference Result 5502 states and 8869 transitions. [2019-11-15 23:57:43,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:43,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-11-15 23:57:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:43,838 INFO L225 Difference]: With dead ends: 5502 [2019-11-15 23:57:43,839 INFO L226 Difference]: Without dead ends: 3669 [2019-11-15 23:57:43,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:57:43,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3669 states. [2019-11-15 23:57:43,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3669 to 2129. [2019-11-15 23:57:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2129 states. [2019-11-15 23:57:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2129 states to 2129 states and 3548 transitions. [2019-11-15 23:57:43,932 INFO L78 Accepts]: Start accepts. Automaton has 2129 states and 3548 transitions. Word has length 201 [2019-11-15 23:57:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:43,932 INFO L462 AbstractCegarLoop]: Abstraction has 2129 states and 3548 transitions. [2019-11-15 23:57:43,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:57:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2129 states and 3548 transitions. [2019-11-15 23:57:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-15 23:57:43,938 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:43,939 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:44,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:44,154 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:44,154 INFO L82 PathProgramCache]: Analyzing trace with hash 499157051, now seen corresponding path program 1 times [2019-11-15 23:57:44,155 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:57:44,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1742762295] [2019-11-15 23:57:44,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:57:46,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:57:46,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:57:46,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:57:46,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:57:46,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:46,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:46,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:57:46,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:57:46,306 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:46,306 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:57:46,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:46,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:46,322 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-15 23:57:46,322 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:57:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:57:46,398 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:57:46,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:57:46,427 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:57:46,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:46,428 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:57:46,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:57:46,429 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-15 23:57:46,429 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:57:46,462 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:57:46,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1742762295] [2019-11-15 23:57:46,462 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:57:46,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:57:46,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731112034] [2019-11-15 23:57:46,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:57:46,463 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:57:46,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:57:46,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:57:46,464 INFO L87 Difference]: Start difference. First operand 2129 states and 3548 transitions. Second operand 7 states. [2019-11-15 23:57:57,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:57:57,290 INFO L93 Difference]: Finished difference Result 6121 states and 9931 transitions. [2019-11-15 23:57:57,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:57:57,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 213 [2019-11-15 23:57:57,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:57:57,310 INFO L225 Difference]: With dead ends: 6121 [2019-11-15 23:57:57,311 INFO L226 Difference]: Without dead ends: 4000 [2019-11-15 23:57:57,313 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 420 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:57:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2019-11-15 23:57:57,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 2514. [2019-11-15 23:57:57,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2514 states. [2019-11-15 23:57:57,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2514 states to 2514 states and 4231 transitions. [2019-11-15 23:57:57,418 INFO L78 Accepts]: Start accepts. Automaton has 2514 states and 4231 transitions. Word has length 213 [2019-11-15 23:57:57,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:57:57,419 INFO L462 AbstractCegarLoop]: Abstraction has 2514 states and 4231 transitions. [2019-11-15 23:57:57,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:57:57,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2514 states and 4231 transitions. [2019-11-15 23:57:57,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 23:57:57,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:57:57,428 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:57:57,641 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:57:57,641 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:57:57,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:57:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1262082996, now seen corresponding path program 1 times [2019-11-15 23:57:57,642 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:57:57,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [492885070] [2019-11-15 23:57:57,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:58:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:00,147 INFO L256 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:00,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:00,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:58:00,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:58:00,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:00,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:00,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:00,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:58:00,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:00,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:58:00,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:00,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:00,222 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-15 23:58:00,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:58:00,265 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 274 proven. 4 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:58:00,265 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:00,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:58:00,290 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:00,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:00,291 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:00,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:00,291 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-15 23:58:00,292 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:58:00,315 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:58:00,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [492885070] [2019-11-15 23:58:00,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:58:00,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:58:00,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362221738] [2019-11-15 23:58:00,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:58:00,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:00,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:58:00,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:58:00,317 INFO L87 Difference]: Start difference. First operand 2514 states and 4231 transitions. Second operand 4 states. [2019-11-15 23:58:04,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:04,565 INFO L93 Difference]: Finished difference Result 6042 states and 9994 transitions. [2019-11-15 23:58:04,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:58:04,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 214 [2019-11-15 23:58:04,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:04,584 INFO L225 Difference]: With dead ends: 6042 [2019-11-15 23:58:04,584 INFO L226 Difference]: Without dead ends: 3536 [2019-11-15 23:58:04,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 421 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-15 23:58:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3536 states. [2019-11-15 23:58:04,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 2658. [2019-11-15 23:58:04,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-11-15 23:58:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4439 transitions. [2019-11-15 23:58:04,696 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4439 transitions. Word has length 214 [2019-11-15 23:58:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:04,697 INFO L462 AbstractCegarLoop]: Abstraction has 2658 states and 4439 transitions. [2019-11-15 23:58:04,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:58:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4439 transitions. [2019-11-15 23:58:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-15 23:58:04,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:04,704 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:04,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:58:04,914 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:04,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:04,914 INFO L82 PathProgramCache]: Analyzing trace with hash 865212567, now seen corresponding path program 1 times [2019-11-15 23:58:04,915 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:04,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [223621446] [2019-11-15 23:58:04,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:58:06,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:06,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:06,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:06,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:58:07,000 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:58:07,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:07,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:07,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:07,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:58:07,036 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:07,037 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:58:07,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:07,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:07,042 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-15 23:58:07,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:58:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:58:07,141 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:07,177 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:58:07,185 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:07,186 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:07,187 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:07,190 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:07,190 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-15 23:58:07,190 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:58:07,222 INFO L134 CoverageAnalysis]: Checked inductivity of 373 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2019-11-15 23:58:07,223 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [223621446] [2019-11-15 23:58:07,223 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:07,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:58:07,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852572195] [2019-11-15 23:58:07,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:58:07,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:07,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:58:07,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:58:07,224 INFO L87 Difference]: Start difference. First operand 2658 states and 4439 transitions. Second operand 7 states. [2019-11-15 23:58:17,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:17,034 INFO L93 Difference]: Finished difference Result 6776 states and 10977 transitions. [2019-11-15 23:58:17,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:58:17,035 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 214 [2019-11-15 23:58:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:17,053 INFO L225 Difference]: With dead ends: 6776 [2019-11-15 23:58:17,054 INFO L226 Difference]: Without dead ends: 4090 [2019-11-15 23:58:17,056 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:58:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2019-11-15 23:58:17,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 2640. [2019-11-15 23:58:17,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-11-15 23:58:17,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 4395 transitions. [2019-11-15 23:58:17,176 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 4395 transitions. Word has length 214 [2019-11-15 23:58:17,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:17,176 INFO L462 AbstractCegarLoop]: Abstraction has 2640 states and 4395 transitions. [2019-11-15 23:58:17,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:58:17,177 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 4395 transitions. [2019-11-15 23:58:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-15 23:58:17,182 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:17,182 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:17,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:58:17,399 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:17,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:17,399 INFO L82 PathProgramCache]: Analyzing trace with hash 696796715, now seen corresponding path program 1 times [2019-11-15 23:58:17,400 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:17,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [769742576] [2019-11-15 23:58:17,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:58:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:19,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:19,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:19,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:58:19,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:58:19,802 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:19,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:19,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:19,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:58:19,849 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:19,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:58:19,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:19,853 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:19,853 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-15 23:58:19,853 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:58:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 281 proven. 4 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:58:19,907 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:19,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:58:19,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:19,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:19,977 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:19,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:19,978 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-15 23:58:19,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:58:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:58:20,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769742576] [2019-11-15 23:58:20,009 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:58:20,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:58:20,010 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146647522] [2019-11-15 23:58:20,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:58:20,010 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:20,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:58:20,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:58:20,011 INFO L87 Difference]: Start difference. First operand 2640 states and 4395 transitions. Second operand 4 states. [2019-11-15 23:58:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:25,334 INFO L93 Difference]: Finished difference Result 5916 states and 9638 transitions. [2019-11-15 23:58:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:58:25,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-11-15 23:58:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:25,343 INFO L225 Difference]: With dead ends: 5916 [2019-11-15 23:58:25,344 INFO L226 Difference]: Without dead ends: 3284 [2019-11-15 23:58:25,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 423 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-15 23:58:25,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2019-11-15 23:58:25,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2640. [2019-11-15 23:58:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-11-15 23:58:25,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 4360 transitions. [2019-11-15 23:58:25,462 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 4360 transitions. Word has length 215 [2019-11-15 23:58:25,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:25,463 INFO L462 AbstractCegarLoop]: Abstraction has 2640 states and 4360 transitions. [2019-11-15 23:58:25,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:58:25,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 4360 transitions. [2019-11-15 23:58:25,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 23:58:25,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:25,469 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:25,679 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:58:25,679 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:25,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:25,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1765046609, now seen corresponding path program 1 times [2019-11-15 23:58:25,680 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:25,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1102691847] [2019-11-15 23:58:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:58:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:29,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:29,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:29,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:58:29,396 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:58:29,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:29,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:29,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:29,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:58:29,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:29,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:58:29,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:29,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:29,424 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-15 23:58:29,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:58:29,461 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 286 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:58:29,461 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:29,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 23:58:29,484 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:29,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:29,485 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:29,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:29,486 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-15 23:58:29,486 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 23:58:29,508 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:58:29,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1102691847] [2019-11-15 23:58:29,509 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:58:29,509 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:58:29,509 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31781794] [2019-11-15 23:58:29,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:58:29,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:29,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:58:29,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:58:29,510 INFO L87 Difference]: Start difference. First operand 2640 states and 4360 transitions. Second operand 4 states. [2019-11-15 23:58:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:33,277 INFO L93 Difference]: Finished difference Result 5907 states and 9559 transitions. [2019-11-15 23:58:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:58:33,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-15 23:58:33,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:33,283 INFO L225 Difference]: With dead ends: 5907 [2019-11-15 23:58:33,283 INFO L226 Difference]: Without dead ends: 3275 [2019-11-15 23:58:33,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 449 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-15 23:58:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2019-11-15 23:58:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 2640. [2019-11-15 23:58:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2640 states. [2019-11-15 23:58:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2640 states to 2640 states and 4316 transitions. [2019-11-15 23:58:33,390 INFO L78 Accepts]: Start accepts. Automaton has 2640 states and 4316 transitions. Word has length 228 [2019-11-15 23:58:33,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:33,391 INFO L462 AbstractCegarLoop]: Abstraction has 2640 states and 4316 transitions. [2019-11-15 23:58:33,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:58:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 2640 states and 4316 transitions. [2019-11-15 23:58:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 23:58:33,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:33,396 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:33,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:58:33,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1476438423, now seen corresponding path program 1 times [2019-11-15 23:58:33,609 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:33,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [303885212] [2019-11-15 23:58:33,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:58:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:35,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:35,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:36,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:58:36,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:58:36,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:36,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:36,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:36,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:58:36,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:36,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:58:36,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:36,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:36,057 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-15 23:58:36,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:58:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:58:36,129 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:36,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:58:36,161 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:36,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:36,162 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:36,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:36,163 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-15 23:58:36,163 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:58:36,203 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:58:36,204 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [303885212] [2019-11-15 23:58:36,204 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:58:36,204 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:58:36,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004552374] [2019-11-15 23:58:36,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:58:36,205 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:58:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:58:36,206 INFO L87 Difference]: Start difference. First operand 2640 states and 4316 transitions. Second operand 7 states. [2019-11-15 23:58:53,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:58:53,717 INFO L93 Difference]: Finished difference Result 7046 states and 11280 transitions. [2019-11-15 23:58:53,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:58:53,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 228 [2019-11-15 23:58:53,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:58:53,726 INFO L225 Difference]: With dead ends: 7046 [2019-11-15 23:58:53,726 INFO L226 Difference]: Without dead ends: 4414 [2019-11-15 23:58:53,728 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 450 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:58:53,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4414 states. [2019-11-15 23:58:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4414 to 2910. [2019-11-15 23:58:53,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-11-15 23:58:53,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4749 transitions. [2019-11-15 23:58:53,847 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4749 transitions. Word has length 228 [2019-11-15 23:58:53,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:58:53,847 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4749 transitions. [2019-11-15 23:58:53,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:58:53,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4749 transitions. [2019-11-15 23:58:53,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-15 23:58:53,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:53,853 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:58:54,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:58:54,063 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:54,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:54,063 INFO L82 PathProgramCache]: Analyzing trace with hash -803208643, now seen corresponding path program 1 times [2019-11-15 23:58:54,063 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:54,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1245454780] [2019-11-15 23:58:54,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:58:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:57,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:57,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:57,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:58:57,603 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:58:57,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:57,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:57,616 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:57,616 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:58:57,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:57,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:58:57,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:57,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:57,643 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-15 23:58:57,644 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:58:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 294 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:58:57,691 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:58:57,724 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 23:58:57,726 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:58:57,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:57,727 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:58:57,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:58:57,728 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-15 23:58:57,728 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 23:58:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:58:57,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1245454780] [2019-11-15 23:58:57,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:58:57,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:58:57,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037805952] [2019-11-15 23:58:57,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:58:57,764 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:58:57,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:58:57,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:58:57,765 INFO L87 Difference]: Start difference. First operand 2910 states and 4749 transitions. Second operand 4 states. [2019-11-15 23:59:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:02,795 INFO L93 Difference]: Finished difference Result 6447 states and 10337 transitions. [2019-11-15 23:59:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:02,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-11-15 23:59:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:02,803 INFO L225 Difference]: With dead ends: 6447 [2019-11-15 23:59:02,803 INFO L226 Difference]: Without dead ends: 3545 [2019-11-15 23:59:02,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 449 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-15 23:59:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-11-15 23:59:02,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 2910. [2019-11-15 23:59:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-11-15 23:59:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4696 transitions. [2019-11-15 23:59:02,926 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4696 transitions. Word has length 228 [2019-11-15 23:59:02,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:02,926 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4696 transitions. [2019-11-15 23:59:02,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4696 transitions. [2019-11-15 23:59:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:59:02,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:02,932 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:03,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:59:03,145 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:03,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash -444701924, now seen corresponding path program 1 times [2019-11-15 23:59:03,146 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:59:03,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1917907577] [2019-11-15 23:59:03,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:59:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:06,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:59:06,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:06,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:06,762 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:59:06,763 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:06,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:06,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:06,775 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:59:06,790 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:06,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:59:06,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:06,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:06,793 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-15 23:59:06,793 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:59:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 302 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:59:06,850 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:59:06,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:59:06,879 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:06,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:06,880 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:06,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:06,880 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-15 23:59:06,880 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:59:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 306 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:59:06,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1917907577] [2019-11-15 23:59:06,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:59:06,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:59:06,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904972284] [2019-11-15 23:59:06,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:06,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:59:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:59:06,905 INFO L87 Difference]: Start difference. First operand 2910 states and 4696 transitions. Second operand 4 states. [2019-11-15 23:59:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:11,200 INFO L93 Difference]: Finished difference Result 6447 states and 10231 transitions. [2019-11-15 23:59:11,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:11,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 229 [2019-11-15 23:59:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:11,208 INFO L225 Difference]: With dead ends: 6447 [2019-11-15 23:59:11,209 INFO L226 Difference]: Without dead ends: 3545 [2019-11-15 23:59:11,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 451 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-15 23:59:11,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-11-15 23:59:11,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 2910. [2019-11-15 23:59:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-11-15 23:59:11,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4643 transitions. [2019-11-15 23:59:11,334 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4643 transitions. Word has length 229 [2019-11-15 23:59:11,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:11,334 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4643 transitions. [2019-11-15 23:59:11,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:11,335 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4643 transitions. [2019-11-15 23:59:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-15 23:59:11,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:11,340 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:11,552 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:59:11,553 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:11,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:11,553 INFO L82 PathProgramCache]: Analyzing trace with hash -273478232, now seen corresponding path program 1 times [2019-11-15 23:59:11,554 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:59:11,554 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [196627897] [2019-11-15 23:59:11,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:59:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:14,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:59:14,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:14,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:14,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:59:14,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:14,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:14,150 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:14,150 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:59:14,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:14,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 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-15 23:59:14,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:14,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:14,190 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-15 23:59:14,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:59:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:59:14,287 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:59:14,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:59:14,323 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:14,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:14,324 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:14,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:14,325 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-15 23:59:14,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:59:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 347 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-11-15 23:59:14,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [196627897] [2019-11-15 23:59:14,371 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:14,371 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 7 [2019-11-15 23:59:14,371 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282920285] [2019-11-15 23:59:14,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:59:14,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:59:14,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:59:14,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:59:14,373 INFO L87 Difference]: Start difference. First operand 2910 states and 4643 transitions. Second operand 7 states. [2019-11-15 23:59:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:26,681 INFO L93 Difference]: Finished difference Result 7208 states and 11259 transitions. [2019-11-15 23:59:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:59:26,683 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 229 [2019-11-15 23:59:26,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:26,687 INFO L225 Difference]: With dead ends: 7208 [2019-11-15 23:59:26,687 INFO L226 Difference]: Without dead ends: 4306 [2019-11-15 23:59:26,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 452 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:59:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2019-11-15 23:59:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 2910. [2019-11-15 23:59:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-11-15 23:59:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4608 transitions. [2019-11-15 23:59:26,837 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4608 transitions. Word has length 229 [2019-11-15 23:59:26,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:26,838 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4608 transitions. [2019-11-15 23:59:26,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:59:26,838 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4608 transitions. [2019-11-15 23:59:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-11-15 23:59:26,849 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:26,849 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:27,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:59:27,067 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1004926008, now seen corresponding path program 1 times [2019-11-15 23:59:27,068 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:59:27,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [135216615] [2019-11-15 23:59:27,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:59:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:30,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:59:30,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:31,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:31,004 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:59:31,005 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:31,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:31,019 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:31,019 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:59:31,041 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:31,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:59:31,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:31,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:31,043 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-15 23:59:31,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:59:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 310 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:59:31,094 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:59:31,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2019-11-15 23:59:31,144 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:31,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:31,145 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:31,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:31,146 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-15 23:59:31,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:1 [2019-11-15 23:59:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:59:31,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [135216615] [2019-11-15 23:59:31,238 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:59:31,238 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:59:31,239 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395706087] [2019-11-15 23:59:31,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:31,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:59:31,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:31,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:59:31,240 INFO L87 Difference]: Start difference. First operand 2910 states and 4608 transitions. Second operand 4 states. [2019-11-15 23:59:34,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:34,743 INFO L93 Difference]: Finished difference Result 6447 states and 10055 transitions. [2019-11-15 23:59:34,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:34,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-11-15 23:59:34,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:34,748 INFO L225 Difference]: With dead ends: 6447 [2019-11-15 23:59:34,748 INFO L226 Difference]: Without dead ends: 3545 [2019-11-15 23:59:34,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 459 GetRequests, 453 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-15 23:59:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3545 states. [2019-11-15 23:59:34,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3545 to 2910. [2019-11-15 23:59:34,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-11-15 23:59:34,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4555 transitions. [2019-11-15 23:59:34,895 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4555 transitions. Word has length 230 [2019-11-15 23:59:34,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:34,896 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4555 transitions. [2019-11-15 23:59:34,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:34,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4555 transitions. [2019-11-15 23:59:34,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-11-15 23:59:34,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:34,902 INFO L380 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:35,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:59:35,121 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:35,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:35,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1919573175, now seen corresponding path program 1 times [2019-11-15 23:59:35,122 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:59:35,122 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [813178177] [2019-11-15 23:59:35,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:59:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:39,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:59:39,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:39,114 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:39,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-15 23:59:39,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:39,126 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:39,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:39,127 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:22 [2019-11-15 23:59:39,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:39,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:59:39,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:39,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:39,152 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-15 23:59:39,152 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-15 23:59:39,195 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 318 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:59:39,195 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:59:39,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2019-11-15 23:59:39,229 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:39,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:39,230 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:39,231 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:39,231 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-15 23:59:39,231 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:1 [2019-11-15 23:59:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2019-11-15 23:59:39,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [813178177] [2019-11-15 23:59:39,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:59:39,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-11-15 23:59:39,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348914811] [2019-11-15 23:59:39,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:59:39,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:59:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:59:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:59:39,269 INFO L87 Difference]: Start difference. First operand 2910 states and 4555 transitions. Second operand 4 states. [2019-11-15 23:59:43,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:43,599 INFO L93 Difference]: Finished difference Result 6357 states and 9832 transitions. [2019-11-15 23:59:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:59:43,601 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-11-15 23:59:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:43,604 INFO L225 Difference]: With dead ends: 6357 [2019-11-15 23:59:43,604 INFO L226 Difference]: Without dead ends: 3455 [2019-11-15 23:59:43,607 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 455 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-15 23:59:43,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2019-11-15 23:59:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 2910. [2019-11-15 23:59:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2910 states. [2019-11-15 23:59:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2910 states to 2910 states and 4502 transitions. [2019-11-15 23:59:43,743 INFO L78 Accepts]: Start accepts. Automaton has 2910 states and 4502 transitions. Word has length 231 [2019-11-15 23:59:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:43,744 INFO L462 AbstractCegarLoop]: Abstraction has 2910 states and 4502 transitions. [2019-11-15 23:59:43,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:59:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2910 states and 4502 transitions. [2019-11-15 23:59:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-11-15 23:59:43,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:43,750 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:59:43,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:59:43,962 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:43,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:43,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1341852121, now seen corresponding path program 1 times [2019-11-15 23:59:43,963 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:59:43,963 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1187009975] [2019-11-15 23:59:43,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68a57cf9-9efb-4435-ad0b-bd0b4dea239d/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-15 23:59:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:50,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 23:59:50,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:51,596 INFO L375 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-15 23:59:51,596 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:54,013 WARN L191 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 23:59:54,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:54,017 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_300|, |v_#memory_$Pointer$.offset_300|], 2=[|v_#memory_$Pointer$.base_294|, |v_#memory_$Pointer$.base_293|, |v_#memory_$Pointer$.offset_293|, |v_#memory_$Pointer$.offset_294|]} [2019-11-15 23:59:54,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:54,356 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:54,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:54,469 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:54,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:54,643 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:54,720 INFO L235 Elim1Store]: Index analysis took 513 ms [2019-11-15 23:59:55,106 INFO L375 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-15 23:59:55,106 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:56,659 WARN L191 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-15 23:59:56,660 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:56,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:56,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:56,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:56,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:56,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:56,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:56,958 INFO L235 Elim1Store]: Index analysis took 242 ms [2019-11-15 23:59:57,251 INFO L375 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-15 23:59:57,252 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:58,214 WARN L191 SmtUtils]: Spent 961.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 23:59:58,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:58,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,315 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,439 INFO L375 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-15 23:59:58,440 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:58,877 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 23:59:58,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:58,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:58,939 INFO L375 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-15 23:59:58,939 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,127 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 23:59:59,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,133 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:59:59,283 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 23:59:59,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,295 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,308 INFO L375 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-15 23:59:59,309 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,352 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-15 23:59:59,352 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:156, output treesize:23 [2019-11-15 23:59:59,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:59:59,379 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,419 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:59:59,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:59:59,455 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:59:59,482 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:59:59,587 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 23:59:59,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,619 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,619 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,679 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,682 INFO L375 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 35 treesize of output 23 [2019-11-15 23:59:59,682 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,714 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,728 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-15 23:59:59,739 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:59:59,765 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,775 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,775 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:59:59,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,794 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-15 23:59:59,820 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,829 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,829 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 23:59:59,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:59:59,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-15 23:59:59,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:59:59,985 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 23:59:59,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:59:59,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,003 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:00:00,003 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:00:00,042 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:00:00,067 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,076 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:00:00,091 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,092 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-16 00:00:00,092 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-16 00:00:00,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,125 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-16 00:00:00,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:00:00,162 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:00:00,280 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:00:00,325 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:00:00,355 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,364 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,365 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,365 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:99, output treesize:23 [2019-11-16 00:00:00,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 75 [2019-11-16 00:00:00,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 43 [2019-11-16 00:00:00,394 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:00,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:00,403 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:23 [2019-11-16 00:00:00,406 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_327|], 2=[|v_#memory_$Pointer$.offset_298|, |v_#memory_$Pointer$.base_310|, |v_#memory_$Pointer$.base_298|, |v_#memory_$Pointer$.offset_310|], 6=[|v_#memory_$Pointer$.base_299|, |v_#memory_$Pointer$.offset_299|]} [2019-11-16 00:00:00,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:00,517 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-11-16 00:00:00,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:01,270 WARN L191 SmtUtils]: Spent 752.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-11-16 00:00:01,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:01,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-16 00:00:02,218 WARN L191 SmtUtils]: Spent 928.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-16 00:00:02,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:02,325 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:02,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-16 00:00:02,417 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:02,859 WARN L191 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-16 00:00:02,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:02,868 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-16 00:00:03,328 WARN L191 SmtUtils]: Spent 460.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:00:03,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:03,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:03,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-16 00:00:03,455 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:03,855 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-16 00:00:03,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:03,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:03,862 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:03,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:03,864 INFO L375 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 98 [2019-11-16 00:00:03,864 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:03,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:03,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:03,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 61 [2019-11-16 00:00:03,967 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:03,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:03,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:03,999 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:306, output treesize:54 [2019-11-16 00:00:04,032 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_311|], 2=[|v_#memory_$Pointer$.offset_311|], 20=[|v_#memory_int_328|]} [2019-11-16 00:00:04,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 37 [2019-11-16 00:00:04,038 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-16 00:00:04,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:04,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:04,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2019-11-16 00:00:04,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:04,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:04,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:00:04,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2019-11-16 00:00:04,153 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:04,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:04,174 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:104, output treesize:50 [2019-11-16 00:00:04,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:00:04,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 13 [2019-11-16 00:00:04,257 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:04,269 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-16 00:00:04,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:16 [2019-11-16 00:00:04,639 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 235 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-11-16 00:00:04,640 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:00:04,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:04,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:1 [2019-11-16 00:00:04,701 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:04,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:00:04,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-16 00:00:04,743 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_317|, |v_#memory_$Pointer$.base_317|, |v_#memory_$Pointer$.offset_298|, |v_#memory_$Pointer$.base_298|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.base_299|, |v_#memory_$Pointer$.offset_299|]} [2019-11-16 00:00:04,788 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-16 00:00:05,882 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 79 [2019-11-16 00:00:05,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:05,904 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-16 00:00:06,438 WARN L191 SmtUtils]: Spent 533.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-16 00:00:06,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:06,461 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-16 00:00:06,752 WARN L191 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-16 00:00:06,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:06,756 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-16 00:00:06,916 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:00:06,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:06,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 839 treesize of output 671 [2019-11-16 00:00:06,926 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-11-16 00:00:07,342 WARN L191 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-16 00:00:07,342 INFO L567 ElimStorePlain]: treesize reduction 383, result has 45.6 percent of original size [2019-11-16 00:00:07,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,359 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:07,568 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-16 00:00:07,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,579 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:07,698 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-16 00:00:07,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,704 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:07,704 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:309, output treesize:500 [2019-11-16 00:00:07,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:07,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:08,051 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-16 00:00:08,072 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-16 00:00:08,100 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-16 00:00:08,119 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-16 00:00:09,569 WARN L191 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 123 DAG size of output: 122 [2019-11-16 00:00:09,569 INFO L567 ElimStorePlain]: treesize reduction 245, result has 88.3 percent of original size [2019-11-16 00:00:09,602 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-16 00:00:09,632 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:09,652 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:09,689 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:11,062 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification that was a NOOP. DAG size: 139 [2019-11-16 00:00:11,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:11,064 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 28 dim-0 vars, and 4 xjuncts. [2019-11-16 00:00:11,064 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:1227, output treesize:2625 [2019-11-16 00:00:17,064 WARN L191 SmtUtils]: Spent 3.32 s on a formula simplification. DAG size of input: 157 DAG size of output: 45 [2019-11-16 00:00:17,089 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_297|, |v_#memory_$Pointer$.base_297|], 6=[|v_#memory_$Pointer$.offset_319|], 14=[|v_#memory_$Pointer$.base_319|]} [2019-11-16 00:00:17,104 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-16 00:00:17,477 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:00:17,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:17,487 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-16 00:00:17,630 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:00:17,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:17,633 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-16 00:00:17,735 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-16 00:00:17,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:17,737 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-16 00:00:17,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:17,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 4 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:17,763 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:393, output treesize:792 [2019-11-16 00:00:22,221 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_320|], 14=[|v_#memory_$Pointer$.base_320|]} [2019-11-16 00:00:22,227 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-16 00:00:22,392 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-16 00:00:22,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:22,398 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-16 00:00:22,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:22,439 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:22,440 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:413, output treesize:1432 [2019-11-16 00:00:28,709 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_296|, |v_#memory_$Pointer$.base_296|], 19=[|v_#memory_$Pointer$.offset_321|], 31=[|v_#memory_$Pointer$.base_321|]} [2019-11-16 00:00:28,738 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-16 00:00:29,289 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-16 00:00:29,289 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:29,324 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-16 00:00:29,698 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-16 00:00:29,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:29,702 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-16 00:00:29,872 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-16 00:00:29,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:29,874 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-16 00:00:29,984 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-16 00:00:29,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:00:29,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: 12 dim-0 vars, and 1 xjuncts. [2019-11-16 00:00:29,985 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:1513, output treesize:3832 [2019-11-16 00:00:39,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:00:39,294 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.downgradeDimensionsIfNecessary(ArrayOccurrenceAnalysis.java:171) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:132) 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.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:335) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-16 00:00:39,300 INFO L168 Benchmark]: Toolchain (without parser) took 235430.42 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 383.8 MB). Free memory was 947.0 MB in the beginning and 972.7 MB in the end (delta: -25.7 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:39,300 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:00:39,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 848.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:39,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.98 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:39,301 INFO L168 Benchmark]: Boogie Preprocessor took 98.00 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:39,302 INFO L168 Benchmark]: RCFGBuilder took 3613.64 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: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:39,302 INFO L168 Benchmark]: TraceAbstraction took 230778.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.0 GB in the beginning and 972.7 MB in the end (delta: 57.0 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:39,315 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.68 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 848.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -190.3 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.98 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.00 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.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3613.64 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: 94.7 MB). Peak memory consumption was 94.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 230778.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 220.2 MB). Free memory was 1.0 GB in the beginning and 972.7 MB in the end (delta: 57.0 MB). Peak memory consumption was 277.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:277) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...