./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/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 8d1c32ee092f2b5f261264054761f302681bc07a ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/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 8d1c32ee092f2b5f261264054761f302681bc07a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 14:36:36,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:36:36,837 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:36:36,844 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:36:36,845 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:36:36,845 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:36:36,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:36:36,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:36:36,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:36:36,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:36:36,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:36:36,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:36:36,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:36:36,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:36:36,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:36:36,854 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:36:36,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:36:36,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:36:36,857 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:36:36,859 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:36:36,860 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:36:36,860 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:36:36,861 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:36:36,861 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:36:36,863 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:36:36,863 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:36:36,863 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:36:36,864 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:36:36,864 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:36:36,865 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:36:36,865 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:36:36,865 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:36:36,866 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:36:36,866 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:36:36,867 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:36:36,867 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:36:36,868 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:36:36,868 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:36:36,868 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:36:36,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:36:36,870 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:36:36,870 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 14:36:36,882 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:36:36,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:36:36,884 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:36:36,884 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:36:36,884 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:36:36,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:36:36,885 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:36:36,885 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 14:36:36,885 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:36:36,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:36:36,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:36:36,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:36:36,886 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:36:36,886 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:36:36,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:36:36,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:36:36,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:36:36,887 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:36:36,887 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:36:36,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:36:36,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:36:36,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:36:36,888 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:36:36,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:36:36,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:36:36,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 14:36:36,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 14:36:36,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:36:36,889 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:36:36,889 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_999810dc-8a9b-48c5-8cc0-f3f409a46448/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 -> 8d1c32ee092f2b5f261264054761f302681bc07a [2019-12-07 14:36:36,996 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:36:37,004 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:36:37,006 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:36:37,007 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:36:37,007 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:36:37,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-12-07 14:36:37,043 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/ff69b3ed3/6c2fff8cace643f5a4acefad03307803/FLAG8c7b0d7d9 [2019-12-07 14:36:37,551 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:36:37,552 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-12-07 14:36:37,565 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/ff69b3ed3/6c2fff8cace643f5a4acefad03307803/FLAG8c7b0d7d9 [2019-12-07 14:36:38,078 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/ff69b3ed3/6c2fff8cace643f5a4acefad03307803 [2019-12-07 14:36:38,080 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:36:38,082 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:36:38,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:36:38,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:36:38,085 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:36:38,086 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fbae1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38, skipping insertion in model container [2019-12-07 14:36:38,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:36:38,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:36:38,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:36:38,422 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:36:38,486 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:36:38,500 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:36:38,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38 WrapperNode [2019-12-07 14:36:38,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:36:38,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:36:38,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:36:38,501 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:36:38,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,556 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:36:38,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:36:38,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:36:38,556 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:36:38,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,570 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,570 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,603 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... [2019-12-07 14:36:38,610 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:36:38,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:36:38,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:36:38,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:36:38,611 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/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-12-07 14:36:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:36:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:36:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 14:36:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 14:36:38,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:36:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:36:38,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:36:38,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:36:38,785 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:36:39,290 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 14:36:39,290 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 14:36:39,291 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:36:39,291 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:36:39,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:36:39 BoogieIcfgContainer [2019-12-07 14:36:39,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:36:39,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:36:39,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:36:39,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:36:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:36:38" (1/3) ... [2019-12-07 14:36:39,295 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500bcc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:36:39, skipping insertion in model container [2019-12-07 14:36:39,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:36:38" (2/3) ... [2019-12-07 14:36:39,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500bcc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:36:39, skipping insertion in model container [2019-12-07 14:36:39,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:36:39" (3/3) ... [2019-12-07 14:36:39,297 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2019-12-07 14:36:39,304 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:36:39,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:36:39,317 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:36:39,333 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:36:39,333 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:36:39,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:36:39,333 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:36:39,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:36:39,334 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:36:39,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:36:39,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:36:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-12-07 14:36:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:36:39,352 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:39,353 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:39,353 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:39,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:39,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1126362112, now seen corresponding path program 1 times [2019-12-07 14:36:39,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:39,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069870179] [2019-12-07 14:36:39,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:39,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069870179] [2019-12-07 14:36:39,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:39,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:39,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214382399] [2019-12-07 14:36:39,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:39,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:39,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:39,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:39,576 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2019-12-07 14:36:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:39,870 INFO L93 Difference]: Finished difference Result 327 states and 555 transitions. [2019-12-07 14:36:39,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:39,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 14:36:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:39,882 INFO L225 Difference]: With dead ends: 327 [2019-12-07 14:36:39,883 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 14:36:39,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:39,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 14:36:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2019-12-07 14:36:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2019-12-07 14:36:39,918 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 41 [2019-12-07 14:36:39,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:39,919 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2019-12-07 14:36:39,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2019-12-07 14:36:39,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:36:39,921 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:39,921 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:39,921 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:39,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1260614375, now seen corresponding path program 1 times [2019-12-07 14:36:39,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:39,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566737575] [2019-12-07 14:36:39,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:39,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:40,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566737575] [2019-12-07 14:36:40,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:40,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:40,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046427167] [2019-12-07 14:36:40,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:40,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:40,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:40,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:40,002 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 4 states. [2019-12-07 14:36:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:40,257 INFO L93 Difference]: Finished difference Result 294 states and 451 transitions. [2019-12-07 14:36:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:40,258 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-12-07 14:36:40,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:40,259 INFO L225 Difference]: With dead ends: 294 [2019-12-07 14:36:40,259 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 14:36:40,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 14:36:40,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2019-12-07 14:36:40,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:40,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 229 transitions. [2019-12-07 14:36:40,269 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 229 transitions. Word has length 54 [2019-12-07 14:36:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:40,269 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 229 transitions. [2019-12-07 14:36:40,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 229 transitions. [2019-12-07 14:36:40,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:40,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:40,271 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:40,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:40,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:40,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1545467861, now seen corresponding path program 1 times [2019-12-07 14:36:40,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:40,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69600484] [2019-12-07 14:36:40,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:40,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:40,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:40,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69600484] [2019-12-07 14:36:40,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:40,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:40,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007916287] [2019-12-07 14:36:40,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:40,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:40,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:40,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:40,351 INFO L87 Difference]: Start difference. First operand 148 states and 229 transitions. Second operand 4 states. [2019-12-07 14:36:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:40,563 INFO L93 Difference]: Finished difference Result 293 states and 449 transitions. [2019-12-07 14:36:40,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:40,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 14:36:40,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:40,564 INFO L225 Difference]: With dead ends: 293 [2019-12-07 14:36:40,565 INFO L226 Difference]: Without dead ends: 164 [2019-12-07 14:36:40,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-12-07 14:36:40,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 148. [2019-12-07 14:36:40,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:40,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 228 transitions. [2019-12-07 14:36:40,575 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 228 transitions. Word has length 55 [2019-12-07 14:36:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:40,575 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 228 transitions. [2019-12-07 14:36:40,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 228 transitions. [2019-12-07 14:36:40,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:40,577 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:40,577 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:40,577 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:40,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1613297430, now seen corresponding path program 1 times [2019-12-07 14:36:40,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:40,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105759052] [2019-12-07 14:36:40,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:40,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:40,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105759052] [2019-12-07 14:36:40,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:40,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:40,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733915673] [2019-12-07 14:36:40,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:40,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:40,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:40,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:40,637 INFO L87 Difference]: Start difference. First operand 148 states and 228 transitions. Second operand 4 states. [2019-12-07 14:36:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:40,851 INFO L93 Difference]: Finished difference Result 291 states and 446 transitions. [2019-12-07 14:36:40,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:40,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 14:36:40,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:40,852 INFO L225 Difference]: With dead ends: 291 [2019-12-07 14:36:40,852 INFO L226 Difference]: Without dead ends: 162 [2019-12-07 14:36:40,853 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-12-07 14:36:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 148. [2019-12-07 14:36:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 227 transitions. [2019-12-07 14:36:40,859 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 227 transitions. Word has length 55 [2019-12-07 14:36:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:40,859 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 227 transitions. [2019-12-07 14:36:40,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 227 transitions. [2019-12-07 14:36:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:40,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:40,860 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:40,861 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:40,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:40,861 INFO L82 PathProgramCache]: Analyzing trace with hash 877952598, now seen corresponding path program 1 times [2019-12-07 14:36:40,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:40,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874419745] [2019-12-07 14:36:40,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:40,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:40,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874419745] [2019-12-07 14:36:40,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:40,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:40,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537998132] [2019-12-07 14:36:40,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:40,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:40,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:40,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:40,903 INFO L87 Difference]: Start difference. First operand 148 states and 227 transitions. Second operand 4 states. [2019-12-07 14:36:41,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:41,120 INFO L93 Difference]: Finished difference Result 290 states and 444 transitions. [2019-12-07 14:36:41,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:41,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 14:36:41,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:41,121 INFO L225 Difference]: With dead ends: 290 [2019-12-07 14:36:41,121 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 14:36:41,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 14:36:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2019-12-07 14:36:41,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 226 transitions. [2019-12-07 14:36:41,128 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 226 transitions. Word has length 55 [2019-12-07 14:36:41,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,128 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 226 transitions. [2019-12-07 14:36:41,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:41,128 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 226 transitions. [2019-12-07 14:36:41,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:36:41,129 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,129 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:41,130 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1745877439, now seen corresponding path program 1 times [2019-12-07 14:36:41,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607697126] [2019-12-07 14:36:41,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607697126] [2019-12-07 14:36:41,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:41,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334471318] [2019-12-07 14:36:41,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:41,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:41,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:41,177 INFO L87 Difference]: Start difference. First operand 148 states and 226 transitions. Second operand 4 states. [2019-12-07 14:36:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:41,352 INFO L93 Difference]: Finished difference Result 290 states and 443 transitions. [2019-12-07 14:36:41,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:41,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 14:36:41,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:41,353 INFO L225 Difference]: With dead ends: 290 [2019-12-07 14:36:41,353 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 14:36:41,354 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 14:36:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2019-12-07 14:36:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 225 transitions. [2019-12-07 14:36:41,358 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 225 transitions. Word has length 55 [2019-12-07 14:36:41,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,358 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 225 transitions. [2019-12-07 14:36:41,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 225 transitions. [2019-12-07 14:36:41,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:36:41,358 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,359 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:41,359 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash -112151006, now seen corresponding path program 1 times [2019-12-07 14:36:41,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951180265] [2019-12-07 14:36:41,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951180265] [2019-12-07 14:36:41,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:41,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926790218] [2019-12-07 14:36:41,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:41,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:41,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:41,399 INFO L87 Difference]: Start difference. First operand 148 states and 225 transitions. Second operand 4 states. [2019-12-07 14:36:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:41,580 INFO L93 Difference]: Finished difference Result 290 states and 442 transitions. [2019-12-07 14:36:41,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:41,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 14:36:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:41,581 INFO L225 Difference]: With dead ends: 290 [2019-12-07 14:36:41,582 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 14:36:41,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 14:36:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2019-12-07 14:36:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 224 transitions. [2019-12-07 14:36:41,586 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 224 transitions. Word has length 56 [2019-12-07 14:36:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,587 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 224 transitions. [2019-12-07 14:36:41,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 224 transitions. [2019-12-07 14:36:41,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 14:36:41,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,588 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:41,588 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1790225756, now seen corresponding path program 1 times [2019-12-07 14:36:41,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54326627] [2019-12-07 14:36:41,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54326627] [2019-12-07 14:36:41,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:41,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323206454] [2019-12-07 14:36:41,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:41,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:41,631 INFO L87 Difference]: Start difference. First operand 148 states and 224 transitions. Second operand 4 states. [2019-12-07 14:36:41,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:41,836 INFO L93 Difference]: Finished difference Result 290 states and 441 transitions. [2019-12-07 14:36:41,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:41,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 14:36:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:41,837 INFO L225 Difference]: With dead ends: 290 [2019-12-07 14:36:41,837 INFO L226 Difference]: Without dead ends: 161 [2019-12-07 14:36:41,837 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:41,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-12-07 14:36:41,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2019-12-07 14:36:41,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 223 transitions. [2019-12-07 14:36:41,840 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 223 transitions. Word has length 57 [2019-12-07 14:36:41,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:41,841 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 223 transitions. [2019-12-07 14:36:41,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:41,841 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 223 transitions. [2019-12-07 14:36:41,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 14:36:41,841 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:41,841 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:41,841 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:41,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:41,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2110264039, now seen corresponding path program 1 times [2019-12-07 14:36:41,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:41,842 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665235704] [2019-12-07 14:36:41,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:41,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665235704] [2019-12-07 14:36:41,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:41,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:41,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151568280] [2019-12-07 14:36:41,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:41,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:41,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:41,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:41,875 INFO L87 Difference]: Start difference. First operand 148 states and 223 transitions. Second operand 4 states. [2019-12-07 14:36:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:42,056 INFO L93 Difference]: Finished difference Result 280 states and 427 transitions. [2019-12-07 14:36:42,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:42,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 14:36:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:42,058 INFO L225 Difference]: With dead ends: 280 [2019-12-07 14:36:42,058 INFO L226 Difference]: Without dead ends: 151 [2019-12-07 14:36:42,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-12-07 14:36:42,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-12-07 14:36:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:36:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 222 transitions. [2019-12-07 14:36:42,061 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 222 transitions. Word has length 58 [2019-12-07 14:36:42,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:42,061 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 222 transitions. [2019-12-07 14:36:42,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 222 transitions. [2019-12-07 14:36:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 14:36:42,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:42,062 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:42,062 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:42,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1054614961, now seen corresponding path program 1 times [2019-12-07 14:36:42,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:42,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946986589] [2019-12-07 14:36:42,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:42,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946986589] [2019-12-07 14:36:42,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:42,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:42,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572511549] [2019-12-07 14:36:42,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:42,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:42,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:42,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:42,102 INFO L87 Difference]: Start difference. First operand 148 states and 222 transitions. Second operand 4 states. [2019-12-07 14:36:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:42,316 INFO L93 Difference]: Finished difference Result 320 states and 488 transitions. [2019-12-07 14:36:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:42,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 14:36:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:42,318 INFO L225 Difference]: With dead ends: 320 [2019-12-07 14:36:42,318 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 14:36:42,319 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 14:36:42,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2019-12-07 14:36:42,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:42,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 260 transitions. [2019-12-07 14:36:42,324 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 260 transitions. Word has length 58 [2019-12-07 14:36:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:42,325 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 260 transitions. [2019-12-07 14:36:42,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:42,325 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 260 transitions. [2019-12-07 14:36:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 14:36:42,325 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:42,326 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:42,326 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash -608200918, now seen corresponding path program 1 times [2019-12-07 14:36:42,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:42,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732582111] [2019-12-07 14:36:42,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:42,369 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:42,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732582111] [2019-12-07 14:36:42,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:42,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:42,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337011235] [2019-12-07 14:36:42,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:42,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:42,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:42,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:42,370 INFO L87 Difference]: Start difference. First operand 170 states and 260 transitions. Second operand 4 states. [2019-12-07 14:36:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:42,600 INFO L93 Difference]: Finished difference Result 342 states and 525 transitions. [2019-12-07 14:36:42,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:42,600 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 14:36:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:42,601 INFO L225 Difference]: With dead ends: 342 [2019-12-07 14:36:42,601 INFO L226 Difference]: Without dead ends: 191 [2019-12-07 14:36:42,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-12-07 14:36:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2019-12-07 14:36:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 259 transitions. [2019-12-07 14:36:42,605 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 259 transitions. Word has length 71 [2019-12-07 14:36:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:42,605 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 259 transitions. [2019-12-07 14:36:42,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 259 transitions. [2019-12-07 14:36:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:36:42,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:42,606 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:42,606 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1499480122, now seen corresponding path program 1 times [2019-12-07 14:36:42,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:42,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259151071] [2019-12-07 14:36:42,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:42,633 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:42,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259151071] [2019-12-07 14:36:42,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:42,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:42,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764219949] [2019-12-07 14:36:42,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:42,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:42,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:42,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:42,634 INFO L87 Difference]: Start difference. First operand 170 states and 259 transitions. Second operand 4 states. [2019-12-07 14:36:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:42,862 INFO L93 Difference]: Finished difference Result 341 states and 522 transitions. [2019-12-07 14:36:42,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:42,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 14:36:42,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:42,864 INFO L225 Difference]: With dead ends: 341 [2019-12-07 14:36:42,864 INFO L226 Difference]: Without dead ends: 190 [2019-12-07 14:36:42,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-12-07 14:36:42,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2019-12-07 14:36:42,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:42,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 258 transitions. [2019-12-07 14:36:42,868 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 258 transitions. Word has length 72 [2019-12-07 14:36:42,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:42,868 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 258 transitions. [2019-12-07 14:36:42,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 258 transitions. [2019-12-07 14:36:42,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:36:42,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:42,869 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:42,869 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:42,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:42,869 INFO L82 PathProgramCache]: Analyzing trace with hash 363278117, now seen corresponding path program 1 times [2019-12-07 14:36:42,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:42,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557594103] [2019-12-07 14:36:42,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:42,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557594103] [2019-12-07 14:36:42,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:42,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:42,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73522837] [2019-12-07 14:36:42,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:42,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:42,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:42,900 INFO L87 Difference]: Start difference. First operand 170 states and 258 transitions. Second operand 4 states. [2019-12-07 14:36:43,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:43,142 INFO L93 Difference]: Finished difference Result 339 states and 518 transitions. [2019-12-07 14:36:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:43,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 14:36:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:43,144 INFO L225 Difference]: With dead ends: 339 [2019-12-07 14:36:43,144 INFO L226 Difference]: Without dead ends: 188 [2019-12-07 14:36:43,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-12-07 14:36:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 170. [2019-12-07 14:36:43,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 257 transitions. [2019-12-07 14:36:43,148 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 257 transitions. Word has length 72 [2019-12-07 14:36:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:43,148 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 257 transitions. [2019-12-07 14:36:43,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:43,148 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 257 transitions. [2019-12-07 14:36:43,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:36:43,148 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:43,149 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:43,149 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:43,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:43,149 INFO L82 PathProgramCache]: Analyzing trace with hash -372066715, now seen corresponding path program 1 times [2019-12-07 14:36:43,149 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:43,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118871881] [2019-12-07 14:36:43,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:43,178 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:43,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118871881] [2019-12-07 14:36:43,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:43,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:43,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168036724] [2019-12-07 14:36:43,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:43,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:43,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:43,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:43,180 INFO L87 Difference]: Start difference. First operand 170 states and 257 transitions. Second operand 4 states. [2019-12-07 14:36:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:43,399 INFO L93 Difference]: Finished difference Result 338 states and 515 transitions. [2019-12-07 14:36:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:43,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 14:36:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:43,400 INFO L225 Difference]: With dead ends: 338 [2019-12-07 14:36:43,400 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 14:36:43,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:43,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 14:36:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2019-12-07 14:36:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 256 transitions. [2019-12-07 14:36:43,404 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 256 transitions. Word has length 72 [2019-12-07 14:36:43,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:43,404 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 256 transitions. [2019-12-07 14:36:43,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:43,404 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 256 transitions. [2019-12-07 14:36:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 14:36:43,405 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:43,405 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:43,405 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:43,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash 495858126, now seen corresponding path program 1 times [2019-12-07 14:36:43,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:43,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400093081] [2019-12-07 14:36:43,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:43,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:43,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:43,447 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400093081] [2019-12-07 14:36:43,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:43,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:43,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551882696] [2019-12-07 14:36:43,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:43,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:43,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:43,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:43,448 INFO L87 Difference]: Start difference. First operand 170 states and 256 transitions. Second operand 4 states. [2019-12-07 14:36:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:43,688 INFO L93 Difference]: Finished difference Result 338 states and 513 transitions. [2019-12-07 14:36:43,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:43,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2019-12-07 14:36:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:43,689 INFO L225 Difference]: With dead ends: 338 [2019-12-07 14:36:43,689 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 14:36:43,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 14:36:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2019-12-07 14:36:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 255 transitions. [2019-12-07 14:36:43,693 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 255 transitions. Word has length 72 [2019-12-07 14:36:43,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:43,694 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 255 transitions. [2019-12-07 14:36:43,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 255 transitions. [2019-12-07 14:36:43,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 14:36:43,694 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:43,694 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:43,695 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:43,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:43,695 INFO L82 PathProgramCache]: Analyzing trace with hash -208044045, now seen corresponding path program 1 times [2019-12-07 14:36:43,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:43,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42754846] [2019-12-07 14:36:43,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:43,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:43,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42754846] [2019-12-07 14:36:43,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:43,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:43,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091440582] [2019-12-07 14:36:43,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:43,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:43,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:43,722 INFO L87 Difference]: Start difference. First operand 170 states and 255 transitions. Second operand 4 states. [2019-12-07 14:36:43,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:43,962 INFO L93 Difference]: Finished difference Result 338 states and 511 transitions. [2019-12-07 14:36:43,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:43,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 14:36:43,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:43,963 INFO L225 Difference]: With dead ends: 338 [2019-12-07 14:36:43,963 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 14:36:43,964 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:43,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 14:36:43,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2019-12-07 14:36:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2019-12-07 14:36:43,968 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 73 [2019-12-07 14:36:43,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:43,969 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2019-12-07 14:36:43,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:43,969 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2019-12-07 14:36:43,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 14:36:43,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:43,970 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:43,970 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:43,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:43,970 INFO L82 PathProgramCache]: Analyzing trace with hash -467942669, now seen corresponding path program 1 times [2019-12-07 14:36:43,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:43,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587173211] [2019-12-07 14:36:43,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:43,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:43,998 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:43,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587173211] [2019-12-07 14:36:43,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:43,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:43,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647684652] [2019-12-07 14:36:43,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:43,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:43,999 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand 4 states. [2019-12-07 14:36:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:44,256 INFO L93 Difference]: Finished difference Result 338 states and 509 transitions. [2019-12-07 14:36:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:44,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 14:36:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:44,258 INFO L225 Difference]: With dead ends: 338 [2019-12-07 14:36:44,258 INFO L226 Difference]: Without dead ends: 187 [2019-12-07 14:36:44,258 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-12-07 14:36:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2019-12-07 14:36:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:44,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-12-07 14:36:44,261 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 74 [2019-12-07 14:36:44,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:44,262 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 253 transitions. [2019-12-07 14:36:44,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:44,262 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 253 transitions. [2019-12-07 14:36:44,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 14:36:44,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:44,262 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:44,262 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:44,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:44,262 INFO L82 PathProgramCache]: Analyzing trace with hash 151366776, now seen corresponding path program 1 times [2019-12-07 14:36:44,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:44,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007508271] [2019-12-07 14:36:44,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:44,291 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:36:44,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007508271] [2019-12-07 14:36:44,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:44,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:44,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636551241] [2019-12-07 14:36:44,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:44,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:44,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:44,293 INFO L87 Difference]: Start difference. First operand 170 states and 253 transitions. Second operand 4 states. [2019-12-07 14:36:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:44,481 INFO L93 Difference]: Finished difference Result 328 states and 494 transitions. [2019-12-07 14:36:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:44,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 14:36:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:44,482 INFO L225 Difference]: With dead ends: 328 [2019-12-07 14:36:44,482 INFO L226 Difference]: Without dead ends: 177 [2019-12-07 14:36:44,483 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-12-07 14:36:44,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2019-12-07 14:36:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 14:36:44,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 252 transitions. [2019-12-07 14:36:44,486 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 252 transitions. Word has length 75 [2019-12-07 14:36:44,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:44,486 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 252 transitions. [2019-12-07 14:36:44,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 252 transitions. [2019-12-07 14:36:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:36:44,487 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:44,487 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:44,487 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:44,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1479009068, now seen corresponding path program 1 times [2019-12-07 14:36:44,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:44,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844904589] [2019-12-07 14:36:44,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:44,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844904589] [2019-12-07 14:36:44,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:44,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:44,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630357273] [2019-12-07 14:36:44,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:44,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:44,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:44,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:44,532 INFO L87 Difference]: Start difference. First operand 170 states and 252 transitions. Second operand 4 states. [2019-12-07 14:36:44,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:44,836 INFO L93 Difference]: Finished difference Result 430 states and 651 transitions. [2019-12-07 14:36:44,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:44,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 14:36:44,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:44,838 INFO L225 Difference]: With dead ends: 430 [2019-12-07 14:36:44,838 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 14:36:44,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:44,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 14:36:44,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 211. [2019-12-07 14:36:44,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-12-07 14:36:44,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 326 transitions. [2019-12-07 14:36:44,842 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 326 transitions. Word has length 80 [2019-12-07 14:36:44,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:44,842 INFO L462 AbstractCegarLoop]: Abstraction has 211 states and 326 transitions. [2019-12-07 14:36:44,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:44,842 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 326 transitions. [2019-12-07 14:36:44,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 14:36:44,843 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:44,843 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:44,843 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:44,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:44,843 INFO L82 PathProgramCache]: Analyzing trace with hash 970591062, now seen corresponding path program 1 times [2019-12-07 14:36:44,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:44,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999082025] [2019-12-07 14:36:44,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:44,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:44,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-12-07 14:36:44,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999082025] [2019-12-07 14:36:44,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:44,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:44,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543411146] [2019-12-07 14:36:44,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:44,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:44,886 INFO L87 Difference]: Start difference. First operand 211 states and 326 transitions. Second operand 4 states. [2019-12-07 14:36:45,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:45,159 INFO L93 Difference]: Finished difference Result 453 states and 707 transitions. [2019-12-07 14:36:45,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:45,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-07 14:36:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:45,160 INFO L225 Difference]: With dead ends: 453 [2019-12-07 14:36:45,160 INFO L226 Difference]: Without dead ends: 261 [2019-12-07 14:36:45,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:45,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-12-07 14:36:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 235. [2019-12-07 14:36:45,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-12-07 14:36:45,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 368 transitions. [2019-12-07 14:36:45,165 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 368 transitions. Word has length 80 [2019-12-07 14:36:45,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:45,166 INFO L462 AbstractCegarLoop]: Abstraction has 235 states and 368 transitions. [2019-12-07 14:36:45,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:45,166 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 368 transitions. [2019-12-07 14:36:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-07 14:36:45,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:45,167 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:45,167 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1387575626, now seen corresponding path program 1 times [2019-12-07 14:36:45,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:45,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617643325] [2019-12-07 14:36:45,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:45,215 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:45,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617643325] [2019-12-07 14:36:45,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:45,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:45,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702286059] [2019-12-07 14:36:45,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:45,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:45,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:45,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:45,216 INFO L87 Difference]: Start difference. First operand 235 states and 368 transitions. Second operand 4 states. [2019-12-07 14:36:45,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:45,505 INFO L93 Difference]: Finished difference Result 513 states and 801 transitions. [2019-12-07 14:36:45,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:45,505 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-07 14:36:45,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:45,507 INFO L225 Difference]: With dead ends: 513 [2019-12-07 14:36:45,507 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 14:36:45,507 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:45,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 14:36:45,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 236. [2019-12-07 14:36:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:36:45,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 369 transitions. [2019-12-07 14:36:45,512 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 369 transitions. Word has length 81 [2019-12-07 14:36:45,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:45,512 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 369 transitions. [2019-12-07 14:36:45,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:45,513 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 369 transitions. [2019-12-07 14:36:45,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 14:36:45,513 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:45,514 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:45,514 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:45,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash -4172603, now seen corresponding path program 1 times [2019-12-07 14:36:45,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:45,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877498410] [2019-12-07 14:36:45,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:45,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877498410] [2019-12-07 14:36:45,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:45,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:45,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658135245] [2019-12-07 14:36:45,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:45,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:45,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:45,558 INFO L87 Difference]: Start difference. First operand 236 states and 369 transitions. Second operand 4 states. [2019-12-07 14:36:45,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:45,982 INFO L93 Difference]: Finished difference Result 514 states and 801 transitions. [2019-12-07 14:36:45,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:45,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 14:36:45,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:45,986 INFO L225 Difference]: With dead ends: 514 [2019-12-07 14:36:45,986 INFO L226 Difference]: Without dead ends: 297 [2019-12-07 14:36:45,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:45,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2019-12-07 14:36:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 236. [2019-12-07 14:36:45,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:36:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 368 transitions. [2019-12-07 14:36:45,994 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 368 transitions. Word has length 93 [2019-12-07 14:36:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:45,995 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 368 transitions. [2019-12-07 14:36:45,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 368 transitions. [2019-12-07 14:36:45,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 14:36:45,997 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:45,997 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:45,997 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:45,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:45,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1534167427, now seen corresponding path program 1 times [2019-12-07 14:36:45,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:45,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716331135] [2019-12-07 14:36:45,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:46,041 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:46,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716331135] [2019-12-07 14:36:46,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:46,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:46,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936452577] [2019-12-07 14:36:46,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:46,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:46,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:46,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:46,043 INFO L87 Difference]: Start difference. First operand 236 states and 368 transitions. Second operand 4 states. [2019-12-07 14:36:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:46,329 INFO L93 Difference]: Finished difference Result 479 states and 748 transitions. [2019-12-07 14:36:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:46,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-07 14:36:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:46,332 INFO L225 Difference]: With dead ends: 479 [2019-12-07 14:36:46,333 INFO L226 Difference]: Without dead ends: 262 [2019-12-07 14:36:46,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-12-07 14:36:46,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 236. [2019-12-07 14:36:46,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:36:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 367 transitions. [2019-12-07 14:36:46,341 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 367 transitions. Word has length 93 [2019-12-07 14:36:46,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:46,342 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 367 transitions. [2019-12-07 14:36:46,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:46,342 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 367 transitions. [2019-12-07 14:36:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:36:46,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:46,343 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:46,343 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:46,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1250478593, now seen corresponding path program 1 times [2019-12-07 14:36:46,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:46,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782016007] [2019-12-07 14:36:46,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:46,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:46,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782016007] [2019-12-07 14:36:46,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:46,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:46,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073149099] [2019-12-07 14:36:46,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:46,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:46,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:46,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:46,391 INFO L87 Difference]: Start difference. First operand 236 states and 367 transitions. Second operand 4 states. [2019-12-07 14:36:46,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:46,736 INFO L93 Difference]: Finished difference Result 513 states and 796 transitions. [2019-12-07 14:36:46,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:46,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 14:36:46,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:46,737 INFO L225 Difference]: With dead ends: 513 [2019-12-07 14:36:46,737 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 14:36:46,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:46,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 14:36:46,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 236. [2019-12-07 14:36:46,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:36:46,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 366 transitions. [2019-12-07 14:36:46,742 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 366 transitions. Word has length 94 [2019-12-07 14:36:46,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:46,742 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 366 transitions. [2019-12-07 14:36:46,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 366 transitions. [2019-12-07 14:36:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:36:46,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:46,743 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:46,743 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:46,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:46,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1908286698, now seen corresponding path program 1 times [2019-12-07 14:36:46,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:46,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791095288] [2019-12-07 14:36:46,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:46,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:46,776 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:46,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791095288] [2019-12-07 14:36:46,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:46,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:46,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320309160] [2019-12-07 14:36:46,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:46,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:46,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:46,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:46,777 INFO L87 Difference]: Start difference. First operand 236 states and 366 transitions. Second operand 4 states. [2019-12-07 14:36:47,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:47,082 INFO L93 Difference]: Finished difference Result 511 states and 792 transitions. [2019-12-07 14:36:47,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:47,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 14:36:47,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:47,084 INFO L225 Difference]: With dead ends: 511 [2019-12-07 14:36:47,084 INFO L226 Difference]: Without dead ends: 294 [2019-12-07 14:36:47,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:47,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-12-07 14:36:47,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 236. [2019-12-07 14:36:47,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:36:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 365 transitions. [2019-12-07 14:36:47,088 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 365 transitions. Word has length 94 [2019-12-07 14:36:47,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:47,088 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 365 transitions. [2019-12-07 14:36:47,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 365 transitions. [2019-12-07 14:36:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:36:47,089 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:47,089 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:47,089 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1172941866, now seen corresponding path program 1 times [2019-12-07 14:36:47,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:47,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748911037] [2019-12-07 14:36:47,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:47,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748911037] [2019-12-07 14:36:47,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:47,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:47,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872219164] [2019-12-07 14:36:47,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:47,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:47,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:47,143 INFO L87 Difference]: Start difference. First operand 236 states and 365 transitions. Second operand 4 states. [2019-12-07 14:36:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:47,396 INFO L93 Difference]: Finished difference Result 510 states and 789 transitions. [2019-12-07 14:36:47,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:47,396 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 14:36:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:47,397 INFO L225 Difference]: With dead ends: 510 [2019-12-07 14:36:47,397 INFO L226 Difference]: Without dead ends: 293 [2019-12-07 14:36:47,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:47,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-12-07 14:36:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 236. [2019-12-07 14:36:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-12-07 14:36:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 364 transitions. [2019-12-07 14:36:47,401 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 364 transitions. Word has length 94 [2019-12-07 14:36:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:47,402 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 364 transitions. [2019-12-07 14:36:47,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 364 transitions. [2019-12-07 14:36:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:36:47,402 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:47,402 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:47,402 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:47,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash 2040866707, now seen corresponding path program 1 times [2019-12-07 14:36:47,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:47,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618241741] [2019-12-07 14:36:47,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 14:36:47,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618241741] [2019-12-07 14:36:47,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:47,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:36:47,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457845641] [2019-12-07 14:36:47,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:36:47,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:47,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:36:47,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:47,447 INFO L87 Difference]: Start difference. First operand 236 states and 364 transitions. Second operand 5 states. [2019-12-07 14:36:47,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:47,741 INFO L93 Difference]: Finished difference Result 474 states and 736 transitions. [2019-12-07 14:36:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:36:47,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-07 14:36:47,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:47,743 INFO L225 Difference]: With dead ends: 474 [2019-12-07 14:36:47,743 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 14:36:47,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:36:47,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 14:36:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-12-07 14:36:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 390 transitions. [2019-12-07 14:36:47,747 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 390 transitions. Word has length 94 [2019-12-07 14:36:47,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:47,748 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 390 transitions. [2019-12-07 14:36:47,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:36:47,748 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 390 transitions. [2019-12-07 14:36:47,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:36:47,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:47,748 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:47,749 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:47,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1942779924, now seen corresponding path program 1 times [2019-12-07 14:36:47,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:47,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186424843] [2019-12-07 14:36:47,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:47,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:47,784 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:47,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186424843] [2019-12-07 14:36:47,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:47,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:47,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214624196] [2019-12-07 14:36:47,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:47,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:47,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:47,786 INFO L87 Difference]: Start difference. First operand 256 states and 390 transitions. Second operand 4 states. [2019-12-07 14:36:48,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:48,028 INFO L93 Difference]: Finished difference Result 516 states and 788 transitions. [2019-12-07 14:36:48,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:48,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 14:36:48,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:48,029 INFO L225 Difference]: With dead ends: 516 [2019-12-07 14:36:48,029 INFO L226 Difference]: Without dead ends: 279 [2019-12-07 14:36:48,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:48,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-12-07 14:36:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 256. [2019-12-07 14:36:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 389 transitions. [2019-12-07 14:36:48,033 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 389 transitions. Word has length 94 [2019-12-07 14:36:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:48,034 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 389 transitions. [2019-12-07 14:36:48,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:48,034 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 389 transitions. [2019-12-07 14:36:48,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 14:36:48,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:48,034 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:48,034 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:48,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:48,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1616842540, now seen corresponding path program 1 times [2019-12-07 14:36:48,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:48,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66402924] [2019-12-07 14:36:48,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:48,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66402924] [2019-12-07 14:36:48,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:48,069 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:48,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360586687] [2019-12-07 14:36:48,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:48,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:48,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:48,069 INFO L87 Difference]: Start difference. First operand 256 states and 389 transitions. Second operand 4 states. [2019-12-07 14:36:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:48,289 INFO L93 Difference]: Finished difference Result 515 states and 785 transitions. [2019-12-07 14:36:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:48,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-07 14:36:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:48,291 INFO L225 Difference]: With dead ends: 515 [2019-12-07 14:36:48,291 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 14:36:48,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 14:36:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-12-07 14:36:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 388 transitions. [2019-12-07 14:36:48,297 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 388 transitions. Word has length 94 [2019-12-07 14:36:48,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:48,297 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 388 transitions. [2019-12-07 14:36:48,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:48,297 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 388 transitions. [2019-12-07 14:36:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:36:48,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:48,298 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:48,299 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1770643777, now seen corresponding path program 1 times [2019-12-07 14:36:48,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:48,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865929457] [2019-12-07 14:36:48,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:48,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:48,333 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:48,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865929457] [2019-12-07 14:36:48,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:48,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:48,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484891252] [2019-12-07 14:36:48,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:48,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:48,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:48,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:48,334 INFO L87 Difference]: Start difference. First operand 256 states and 388 transitions. Second operand 4 states. [2019-12-07 14:36:48,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:48,618 INFO L93 Difference]: Finished difference Result 550 states and 834 transitions. [2019-12-07 14:36:48,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:48,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 14:36:48,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:48,619 INFO L225 Difference]: With dead ends: 550 [2019-12-07 14:36:48,619 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 14:36:48,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:48,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 14:36:48,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2019-12-07 14:36:48,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:48,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2019-12-07 14:36:48,625 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 95 [2019-12-07 14:36:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:48,625 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2019-12-07 14:36:48,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2019-12-07 14:36:48,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 14:36:48,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:48,627 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:48,627 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:48,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:48,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1648304513, now seen corresponding path program 1 times [2019-12-07 14:36:48,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:48,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099841311] [2019-12-07 14:36:48,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:48,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099841311] [2019-12-07 14:36:48,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:48,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:48,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834024149] [2019-12-07 14:36:48,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:48,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:48,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:48,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:48,666 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand 4 states. [2019-12-07 14:36:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:48,889 INFO L93 Difference]: Finished difference Result 515 states and 781 transitions. [2019-12-07 14:36:48,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:48,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 14:36:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:48,891 INFO L225 Difference]: With dead ends: 515 [2019-12-07 14:36:48,891 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 14:36:48,891 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:48,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 14:36:48,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-12-07 14:36:48,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:48,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 386 transitions. [2019-12-07 14:36:48,895 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 386 transitions. Word has length 95 [2019-12-07 14:36:48,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:48,895 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 386 transitions. [2019-12-07 14:36:48,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:48,895 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 386 transitions. [2019-12-07 14:36:48,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 14:36:48,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:48,896 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:48,896 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash -531550874, now seen corresponding path program 1 times [2019-12-07 14:36:48,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:48,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046883222] [2019-12-07 14:36:48,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:48,943 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:48,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046883222] [2019-12-07 14:36:48,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:48,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:48,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582128771] [2019-12-07 14:36:48,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:48,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:48,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:48,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:48,944 INFO L87 Difference]: Start difference. First operand 256 states and 386 transitions. Second operand 4 states. [2019-12-07 14:36:49,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:49,217 INFO L93 Difference]: Finished difference Result 550 states and 830 transitions. [2019-12-07 14:36:49,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:49,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 14:36:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:49,218 INFO L225 Difference]: With dead ends: 550 [2019-12-07 14:36:49,218 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 14:36:49,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 14:36:49,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2019-12-07 14:36:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 385 transitions. [2019-12-07 14:36:49,223 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 385 transitions. Word has length 96 [2019-12-07 14:36:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:49,223 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 385 transitions. [2019-12-07 14:36:49,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 385 transitions. [2019-12-07 14:36:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 14:36:49,224 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:49,224 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:49,224 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:49,224 INFO L82 PathProgramCache]: Analyzing trace with hash 855234536, now seen corresponding path program 1 times [2019-12-07 14:36:49,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:49,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546588228] [2019-12-07 14:36:49,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:49,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:49,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546588228] [2019-12-07 14:36:49,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:49,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:49,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903138378] [2019-12-07 14:36:49,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:49,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:49,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:49,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:49,256 INFO L87 Difference]: Start difference. First operand 256 states and 385 transitions. Second operand 4 states. [2019-12-07 14:36:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:49,465 INFO L93 Difference]: Finished difference Result 515 states and 777 transitions. [2019-12-07 14:36:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:49,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 14:36:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:49,466 INFO L225 Difference]: With dead ends: 515 [2019-12-07 14:36:49,466 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 14:36:49,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:49,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 14:36:49,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-12-07 14:36:49,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 384 transitions. [2019-12-07 14:36:49,471 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 384 transitions. Word has length 96 [2019-12-07 14:36:49,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:49,471 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 384 transitions. [2019-12-07 14:36:49,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:49,471 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 384 transitions. [2019-12-07 14:36:49,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:36:49,471 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:49,471 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:49,471 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:49,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:49,472 INFO L82 PathProgramCache]: Analyzing trace with hash -506910212, now seen corresponding path program 1 times [2019-12-07 14:36:49,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:49,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047801956] [2019-12-07 14:36:49,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:49,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047801956] [2019-12-07 14:36:49,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:49,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:49,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814734983] [2019-12-07 14:36:49,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:49,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:49,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:49,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:49,507 INFO L87 Difference]: Start difference. First operand 256 states and 384 transitions. Second operand 4 states. [2019-12-07 14:36:49,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:49,783 INFO L93 Difference]: Finished difference Result 550 states and 826 transitions. [2019-12-07 14:36:49,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:49,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 14:36:49,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:49,785 INFO L225 Difference]: With dead ends: 550 [2019-12-07 14:36:49,785 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 14:36:49,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:49,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 14:36:49,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 256. [2019-12-07 14:36:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 383 transitions. [2019-12-07 14:36:49,790 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 383 transitions. Word has length 97 [2019-12-07 14:36:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:49,791 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 383 transitions. [2019-12-07 14:36:49,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 383 transitions. [2019-12-07 14:36:49,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:36:49,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:49,792 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:49,792 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash -466235462, now seen corresponding path program 1 times [2019-12-07 14:36:49,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:49,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554318177] [2019-12-07 14:36:49,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:49,823 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:49,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554318177] [2019-12-07 14:36:49,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:49,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:49,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354600078] [2019-12-07 14:36:49,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:49,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:49,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:49,824 INFO L87 Difference]: Start difference. First operand 256 states and 383 transitions. Second operand 4 states. [2019-12-07 14:36:50,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:50,041 INFO L93 Difference]: Finished difference Result 515 states and 773 transitions. [2019-12-07 14:36:50,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:50,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 14:36:50,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:50,043 INFO L225 Difference]: With dead ends: 515 [2019-12-07 14:36:50,043 INFO L226 Difference]: Without dead ends: 278 [2019-12-07 14:36:50,043 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:50,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-12-07 14:36:50,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 256. [2019-12-07 14:36:50,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:50,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 382 transitions. [2019-12-07 14:36:50,048 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 382 transitions. Word has length 97 [2019-12-07 14:36:50,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:50,048 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 382 transitions. [2019-12-07 14:36:50,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:50,048 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 382 transitions. [2019-12-07 14:36:50,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:36:50,049 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:50,049 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:50,049 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:50,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:50,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1364818879, now seen corresponding path program 1 times [2019-12-07 14:36:50,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:50,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917059302] [2019-12-07 14:36:50,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:50,083 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:50,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917059302] [2019-12-07 14:36:50,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:50,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:50,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354803948] [2019-12-07 14:36:50,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:50,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:50,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:50,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:50,084 INFO L87 Difference]: Start difference. First operand 256 states and 382 transitions. Second operand 4 states. [2019-12-07 14:36:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:50,333 INFO L93 Difference]: Finished difference Result 540 states and 810 transitions. [2019-12-07 14:36:50,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:50,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:36:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:50,334 INFO L225 Difference]: With dead ends: 540 [2019-12-07 14:36:50,334 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 14:36:50,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:50,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 14:36:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2019-12-07 14:36:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 381 transitions. [2019-12-07 14:36:50,340 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 381 transitions. Word has length 98 [2019-12-07 14:36:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:50,340 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 381 transitions. [2019-12-07 14:36:50,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 381 transitions. [2019-12-07 14:36:50,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:36:50,340 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:50,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:50,341 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:50,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:50,341 INFO L82 PathProgramCache]: Analyzing trace with hash -103901629, now seen corresponding path program 1 times [2019-12-07 14:36:50,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:50,341 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238837190] [2019-12-07 14:36:50,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:50,372 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:50,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238837190] [2019-12-07 14:36:50,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:50,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:50,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582847734] [2019-12-07 14:36:50,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:50,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:50,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:50,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:50,374 INFO L87 Difference]: Start difference. First operand 256 states and 381 transitions. Second operand 4 states. [2019-12-07 14:36:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:50,583 INFO L93 Difference]: Finished difference Result 505 states and 757 transitions. [2019-12-07 14:36:50,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:50,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 14:36:50,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:50,584 INFO L225 Difference]: With dead ends: 505 [2019-12-07 14:36:50,584 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 14:36:50,585 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:50,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 14:36:50,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 256. [2019-12-07 14:36:50,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:50,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 380 transitions. [2019-12-07 14:36:50,592 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 380 transitions. Word has length 98 [2019-12-07 14:36:50,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:50,592 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 380 transitions. [2019-12-07 14:36:50,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:50,592 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 380 transitions. [2019-12-07 14:36:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 14:36:50,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:50,593 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:50,594 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:50,594 INFO L82 PathProgramCache]: Analyzing trace with hash -620164665, now seen corresponding path program 1 times [2019-12-07 14:36:50,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:50,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240774594] [2019-12-07 14:36:50,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:50,635 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:50,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240774594] [2019-12-07 14:36:50,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:50,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:50,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749394198] [2019-12-07 14:36:50,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:50,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:50,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:50,637 INFO L87 Difference]: Start difference. First operand 256 states and 380 transitions. Second operand 4 states. [2019-12-07 14:36:50,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:50,935 INFO L93 Difference]: Finished difference Result 540 states and 806 transitions. [2019-12-07 14:36:50,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:50,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 14:36:50,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:50,937 INFO L225 Difference]: With dead ends: 540 [2019-12-07 14:36:50,937 INFO L226 Difference]: Without dead ends: 303 [2019-12-07 14:36:50,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:50,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2019-12-07 14:36:50,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 256. [2019-12-07 14:36:50,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-12-07 14:36:50,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2019-12-07 14:36:50,942 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 102 [2019-12-07 14:36:50,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:50,942 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2019-12-07 14:36:50,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2019-12-07 14:36:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 14:36:50,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:50,943 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:50,943 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:50,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:50,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1341409993, now seen corresponding path program 1 times [2019-12-07 14:36:50,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:50,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46264365] [2019-12-07 14:36:50,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:50,986 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:50,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46264365] [2019-12-07 14:36:50,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:50,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:50,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347528064] [2019-12-07 14:36:50,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:50,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:50,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:50,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:50,987 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand 4 states. [2019-12-07 14:36:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:51,207 INFO L93 Difference]: Finished difference Result 546 states and 817 transitions. [2019-12-07 14:36:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:51,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 14:36:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:51,209 INFO L225 Difference]: With dead ends: 546 [2019-12-07 14:36:51,209 INFO L226 Difference]: Without dead ends: 309 [2019-12-07 14:36:51,209 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:51,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-12-07 14:36:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 282. [2019-12-07 14:36:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 424 transitions. [2019-12-07 14:36:51,213 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 424 transitions. Word has length 102 [2019-12-07 14:36:51,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:51,213 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 424 transitions. [2019-12-07 14:36:51,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 424 transitions. [2019-12-07 14:36:51,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 14:36:51,214 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:51,214 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:51,214 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:51,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:51,214 INFO L82 PathProgramCache]: Analyzing trace with hash -369071582, now seen corresponding path program 1 times [2019-12-07 14:36:51,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:51,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105821950] [2019-12-07 14:36:51,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:51,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105821950] [2019-12-07 14:36:51,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:51,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:51,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292586956] [2019-12-07 14:36:51,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:51,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:51,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:51,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:51,252 INFO L87 Difference]: Start difference. First operand 282 states and 424 transitions. Second operand 4 states. [2019-12-07 14:36:51,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:51,507 INFO L93 Difference]: Finished difference Result 592 states and 894 transitions. [2019-12-07 14:36:51,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:51,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-12-07 14:36:51,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:51,509 INFO L225 Difference]: With dead ends: 592 [2019-12-07 14:36:51,509 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 14:36:51,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 14:36:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 282. [2019-12-07 14:36:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 423 transitions. [2019-12-07 14:36:51,514 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 423 transitions. Word has length 105 [2019-12-07 14:36:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:51,514 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 423 transitions. [2019-12-07 14:36:51,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:51,514 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 423 transitions. [2019-12-07 14:36:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-12-07 14:36:51,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:51,515 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:51,515 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:51,515 INFO L82 PathProgramCache]: Analyzing trace with hash 802506503, now seen corresponding path program 1 times [2019-12-07 14:36:51,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:51,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998410952] [2019-12-07 14:36:51,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:51,553 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:51,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998410952] [2019-12-07 14:36:51,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:51,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:51,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88903135] [2019-12-07 14:36:51,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:51,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:51,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:51,554 INFO L87 Difference]: Start difference. First operand 282 states and 423 transitions. Second operand 4 states. [2019-12-07 14:36:51,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:51,822 INFO L93 Difference]: Finished difference Result 584 states and 879 transitions. [2019-12-07 14:36:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:51,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-12-07 14:36:51,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:51,824 INFO L225 Difference]: With dead ends: 584 [2019-12-07 14:36:51,824 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 14:36:51,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 14:36:51,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 282. [2019-12-07 14:36:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:51,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 422 transitions. [2019-12-07 14:36:51,830 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 422 transitions. Word has length 106 [2019-12-07 14:36:51,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:51,831 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 422 transitions. [2019-12-07 14:36:51,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:51,831 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 422 transitions. [2019-12-07 14:36:51,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 14:36:51,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:51,832 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:51,832 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:51,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:51,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1208871294, now seen corresponding path program 1 times [2019-12-07 14:36:51,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:51,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371300728] [2019-12-07 14:36:51,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:51,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:51,877 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:51,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371300728] [2019-12-07 14:36:51,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:51,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:51,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277803652] [2019-12-07 14:36:51,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:51,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:51,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:51,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:51,878 INFO L87 Difference]: Start difference. First operand 282 states and 422 transitions. Second operand 4 states. [2019-12-07 14:36:52,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:52,130 INFO L93 Difference]: Finished difference Result 584 states and 877 transitions. [2019-12-07 14:36:52,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:52,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 14:36:52,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:52,133 INFO L225 Difference]: With dead ends: 584 [2019-12-07 14:36:52,133 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 14:36:52,133 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 14:36:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 282. [2019-12-07 14:36:52,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 421 transitions. [2019-12-07 14:36:52,141 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 421 transitions. Word has length 107 [2019-12-07 14:36:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:52,142 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 421 transitions. [2019-12-07 14:36:52,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 421 transitions. [2019-12-07 14:36:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 14:36:52,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:52,143 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:52,143 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash -819208804, now seen corresponding path program 1 times [2019-12-07 14:36:52,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:52,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887103862] [2019-12-07 14:36:52,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:52,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887103862] [2019-12-07 14:36:52,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:52,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:52,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842428909] [2019-12-07 14:36:52,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:52,195 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:52,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:52,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:52,195 INFO L87 Difference]: Start difference. First operand 282 states and 421 transitions. Second operand 4 states. [2019-12-07 14:36:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:52,435 INFO L93 Difference]: Finished difference Result 584 states and 875 transitions. [2019-12-07 14:36:52,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:52,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 14:36:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:52,436 INFO L225 Difference]: With dead ends: 584 [2019-12-07 14:36:52,436 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 14:36:52,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 14:36:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 282. [2019-12-07 14:36:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:52,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 420 transitions. [2019-12-07 14:36:52,441 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 420 transitions. Word has length 108 [2019-12-07 14:36:52,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:52,441 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 420 transitions. [2019-12-07 14:36:52,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 420 transitions. [2019-12-07 14:36:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 14:36:52,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:52,442 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:52,442 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:52,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1320802695, now seen corresponding path program 1 times [2019-12-07 14:36:52,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:52,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725877464] [2019-12-07 14:36:52,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:52,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:52,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725877464] [2019-12-07 14:36:52,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:52,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:52,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277994004] [2019-12-07 14:36:52,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:52,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:52,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:52,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:52,483 INFO L87 Difference]: Start difference. First operand 282 states and 420 transitions. Second operand 4 states. [2019-12-07 14:36:52,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:52,806 INFO L93 Difference]: Finished difference Result 582 states and 871 transitions. [2019-12-07 14:36:52,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:52,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 14:36:52,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:52,808 INFO L225 Difference]: With dead ends: 582 [2019-12-07 14:36:52,808 INFO L226 Difference]: Without dead ends: 319 [2019-12-07 14:36:52,808 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:52,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-12-07 14:36:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 282. [2019-12-07 14:36:52,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:52,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 419 transitions. [2019-12-07 14:36:52,813 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 419 transitions. Word has length 108 [2019-12-07 14:36:52,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:52,813 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 419 transitions. [2019-12-07 14:36:52,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:52,813 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 419 transitions. [2019-12-07 14:36:52,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 14:36:52,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:52,813 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:52,814 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:52,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:52,814 INFO L82 PathProgramCache]: Analyzing trace with hash -463707657, now seen corresponding path program 1 times [2019-12-07 14:36:52,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:52,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792931879] [2019-12-07 14:36:52,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:52,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792931879] [2019-12-07 14:36:52,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:52,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:52,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316636995] [2019-12-07 14:36:52,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:52,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:52,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:52,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:52,862 INFO L87 Difference]: Start difference. First operand 282 states and 419 transitions. Second operand 4 states. [2019-12-07 14:36:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:53,243 INFO L93 Difference]: Finished difference Result 580 states and 866 transitions. [2019-12-07 14:36:53,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:53,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 14:36:53,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:53,246 INFO L225 Difference]: With dead ends: 580 [2019-12-07 14:36:53,247 INFO L226 Difference]: Without dead ends: 317 [2019-12-07 14:36:53,247 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:53,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-12-07 14:36:53,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 282. [2019-12-07 14:36:53,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 418 transitions. [2019-12-07 14:36:53,257 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 418 transitions. Word has length 109 [2019-12-07 14:36:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:53,257 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 418 transitions. [2019-12-07 14:36:53,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 418 transitions. [2019-12-07 14:36:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 14:36:53,258 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:53,259 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:53,259 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash -977169504, now seen corresponding path program 1 times [2019-12-07 14:36:53,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:53,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12318541] [2019-12-07 14:36:53,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:53,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12318541] [2019-12-07 14:36:53,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:53,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:53,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127006928] [2019-12-07 14:36:53,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:53,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:53,310 INFO L87 Difference]: Start difference. First operand 282 states and 418 transitions. Second operand 4 states. [2019-12-07 14:36:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:53,659 INFO L93 Difference]: Finished difference Result 577 states and 860 transitions. [2019-12-07 14:36:53,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:53,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 14:36:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:53,663 INFO L225 Difference]: With dead ends: 577 [2019-12-07 14:36:53,663 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 14:36:53,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 14:36:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2019-12-07 14:36:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 417 transitions. [2019-12-07 14:36:53,673 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 417 transitions. Word has length 109 [2019-12-07 14:36:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:53,673 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 417 transitions. [2019-12-07 14:36:53,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 417 transitions. [2019-12-07 14:36:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 14:36:53,674 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:53,675 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:53,675 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:53,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:53,675 INFO L82 PathProgramCache]: Analyzing trace with hash 863494017, now seen corresponding path program 1 times [2019-12-07 14:36:53,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:53,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32696994] [2019-12-07 14:36:53,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:53,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32696994] [2019-12-07 14:36:53,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:53,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:53,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972509055] [2019-12-07 14:36:53,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:53,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:53,724 INFO L87 Difference]: Start difference. First operand 282 states and 417 transitions. Second operand 4 states. [2019-12-07 14:36:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:53,943 INFO L93 Difference]: Finished difference Result 577 states and 858 transitions. [2019-12-07 14:36:53,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:53,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-12-07 14:36:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:53,945 INFO L225 Difference]: With dead ends: 577 [2019-12-07 14:36:53,945 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 14:36:53,945 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 14:36:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 282. [2019-12-07 14:36:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 416 transitions. [2019-12-07 14:36:53,949 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 416 transitions. Word has length 112 [2019-12-07 14:36:53,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:53,950 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 416 transitions. [2019-12-07 14:36:53,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 416 transitions. [2019-12-07 14:36:53,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 14:36:53,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:53,950 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:53,950 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:53,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:53,951 INFO L82 PathProgramCache]: Analyzing trace with hash -126256681, now seen corresponding path program 1 times [2019-12-07 14:36:53,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:53,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835027803] [2019-12-07 14:36:53,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:53,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:53,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835027803] [2019-12-07 14:36:53,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:53,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:53,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92103999] [2019-12-07 14:36:53,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:53,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:53,990 INFO L87 Difference]: Start difference. First operand 282 states and 416 transitions. Second operand 4 states. [2019-12-07 14:36:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:54,358 INFO L93 Difference]: Finished difference Result 571 states and 847 transitions. [2019-12-07 14:36:54,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:54,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 14:36:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:54,361 INFO L225 Difference]: With dead ends: 571 [2019-12-07 14:36:54,361 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 14:36:54,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:54,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 14:36:54,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 282. [2019-12-07 14:36:54,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:54,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 415 transitions. [2019-12-07 14:36:54,368 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 415 transitions. Word has length 113 [2019-12-07 14:36:54,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:54,368 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 415 transitions. [2019-12-07 14:36:54,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:54,368 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 415 transitions. [2019-12-07 14:36:54,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 14:36:54,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:54,369 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:54,369 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:54,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:54,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1518797521, now seen corresponding path program 1 times [2019-12-07 14:36:54,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:54,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572138698] [2019-12-07 14:36:54,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:54,419 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:54,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572138698] [2019-12-07 14:36:54,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:54,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:54,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189720157] [2019-12-07 14:36:54,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:54,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:54,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:54,420 INFO L87 Difference]: Start difference. First operand 282 states and 415 transitions. Second operand 4 states. [2019-12-07 14:36:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:54,635 INFO L93 Difference]: Finished difference Result 571 states and 845 transitions. [2019-12-07 14:36:54,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:54,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-12-07 14:36:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:54,637 INFO L225 Difference]: With dead ends: 571 [2019-12-07 14:36:54,637 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 14:36:54,637 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 14:36:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 282. [2019-12-07 14:36:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:54,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 414 transitions. [2019-12-07 14:36:54,642 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 414 transitions. Word has length 113 [2019-12-07 14:36:54,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:54,642 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 414 transitions. [2019-12-07 14:36:54,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:54,642 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 414 transitions. [2019-12-07 14:36:54,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 14:36:54,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:54,643 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:54,643 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:54,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:54,643 INFO L82 PathProgramCache]: Analyzing trace with hash 433296347, now seen corresponding path program 1 times [2019-12-07 14:36:54,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:54,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609790669] [2019-12-07 14:36:54,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:54,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609790669] [2019-12-07 14:36:54,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:54,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:54,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703688161] [2019-12-07 14:36:54,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:54,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:54,683 INFO L87 Difference]: Start difference. First operand 282 states and 414 transitions. Second operand 4 states. [2019-12-07 14:36:54,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:54,916 INFO L93 Difference]: Finished difference Result 568 states and 839 transitions. [2019-12-07 14:36:54,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:54,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 14:36:54,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:54,918 INFO L225 Difference]: With dead ends: 568 [2019-12-07 14:36:54,918 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 14:36:54,918 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:54,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 14:36:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 282. [2019-12-07 14:36:54,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 413 transitions. [2019-12-07 14:36:54,923 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 413 transitions. Word has length 114 [2019-12-07 14:36:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:54,923 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 413 transitions. [2019-12-07 14:36:54,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 413 transitions. [2019-12-07 14:36:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 14:36:54,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:54,924 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:54,924 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:54,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1778534199, now seen corresponding path program 1 times [2019-12-07 14:36:54,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:54,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642424787] [2019-12-07 14:36:54,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:54,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642424787] [2019-12-07 14:36:54,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:54,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:54,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832316170] [2019-12-07 14:36:54,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:54,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:54,970 INFO L87 Difference]: Start difference. First operand 282 states and 413 transitions. Second operand 4 states. [2019-12-07 14:36:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:55,226 INFO L93 Difference]: Finished difference Result 568 states and 837 transitions. [2019-12-07 14:36:55,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:55,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 14:36:55,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:55,228 INFO L225 Difference]: With dead ends: 568 [2019-12-07 14:36:55,228 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 14:36:55,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 14:36:55,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 282. [2019-12-07 14:36:55,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 14:36:55,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 412 transitions. [2019-12-07 14:36:55,234 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 412 transitions. Word has length 115 [2019-12-07 14:36:55,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:55,234 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 412 transitions. [2019-12-07 14:36:55,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:55,234 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 412 transitions. [2019-12-07 14:36:55,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 14:36:55,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:55,235 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:55,235 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:55,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:55,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1965605648, now seen corresponding path program 1 times [2019-12-07 14:36:55,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:55,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130568121] [2019-12-07 14:36:55,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 14:36:55,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130568121] [2019-12-07 14:36:55,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:55,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:55,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499801775] [2019-12-07 14:36:55,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:55,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:55,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:55,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:55,274 INFO L87 Difference]: Start difference. First operand 282 states and 412 transitions. Second operand 4 states. [2019-12-07 14:36:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:55,537 INFO L93 Difference]: Finished difference Result 617 states and 914 transitions. [2019-12-07 14:36:55,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:55,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 14:36:55,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:55,539 INFO L225 Difference]: With dead ends: 617 [2019-12-07 14:36:55,540 INFO L226 Difference]: Without dead ends: 354 [2019-12-07 14:36:55,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-07 14:36:55,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 314. [2019-12-07 14:36:55,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 14:36:55,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 469 transitions. [2019-12-07 14:36:55,545 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 469 transitions. Word has length 115 [2019-12-07 14:36:55,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:55,545 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 469 transitions. [2019-12-07 14:36:55,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:55,545 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 469 transitions. [2019-12-07 14:36:55,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 14:36:55,546 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:55,546 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:55,546 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:55,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:55,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1736110093, now seen corresponding path program 1 times [2019-12-07 14:36:55,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:55,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116056030] [2019-12-07 14:36:55,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:55,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116056030] [2019-12-07 14:36:55,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:55,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:55,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738085746] [2019-12-07 14:36:55,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:55,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:55,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:55,588 INFO L87 Difference]: Start difference. First operand 314 states and 469 transitions. Second operand 4 states. [2019-12-07 14:36:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:55,807 INFO L93 Difference]: Finished difference Result 629 states and 945 transitions. [2019-12-07 14:36:55,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:55,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 14:36:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:55,809 INFO L225 Difference]: With dead ends: 629 [2019-12-07 14:36:55,809 INFO L226 Difference]: Without dead ends: 334 [2019-12-07 14:36:55,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-12-07 14:36:55,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 314. [2019-12-07 14:36:55,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 14:36:55,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 468 transitions. [2019-12-07 14:36:55,815 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 468 transitions. Word has length 116 [2019-12-07 14:36:55,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:55,815 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 468 transitions. [2019-12-07 14:36:55,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 468 transitions. [2019-12-07 14:36:55,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 14:36:55,816 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:55,816 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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-12-07 14:36:55,816 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:55,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 498059615, now seen corresponding path program 1 times [2019-12-07 14:36:55,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:55,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361541209] [2019-12-07 14:36:55,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:55,861 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:36:55,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361541209] [2019-12-07 14:36:55,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:55,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:55,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458741285] [2019-12-07 14:36:55,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:55,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:55,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:55,863 INFO L87 Difference]: Start difference. First operand 314 states and 468 transitions. Second operand 4 states. [2019-12-07 14:36:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:56,155 INFO L93 Difference]: Finished difference Result 715 states and 1078 transitions. [2019-12-07 14:36:56,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:56,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 14:36:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:56,157 INFO L225 Difference]: With dead ends: 715 [2019-12-07 14:36:56,157 INFO L226 Difference]: Without dead ends: 420 [2019-12-07 14:36:56,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2019-12-07 14:36:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 353. [2019-12-07 14:36:56,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2019-12-07 14:36:56,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 539 transitions. [2019-12-07 14:36:56,163 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 539 transitions. Word has length 116 [2019-12-07 14:36:56,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:56,163 INFO L462 AbstractCegarLoop]: Abstraction has 353 states and 539 transitions. [2019-12-07 14:36:56,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:56,163 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 539 transitions. [2019-12-07 14:36:56,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 14:36:56,164 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:56,164 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:56,164 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:56,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:56,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1747804641, now seen corresponding path program 1 times [2019-12-07 14:36:56,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:56,164 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822295471] [2019-12-07 14:36:56,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:56,207 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:36:56,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822295471] [2019-12-07 14:36:56,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:56,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:56,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556080338] [2019-12-07 14:36:56,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:56,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:56,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:56,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:56,208 INFO L87 Difference]: Start difference. First operand 353 states and 539 transitions. Second operand 4 states. [2019-12-07 14:36:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:56,533 INFO L93 Difference]: Finished difference Result 748 states and 1141 transitions. [2019-12-07 14:36:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:56,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 14:36:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:56,535 INFO L225 Difference]: With dead ends: 748 [2019-12-07 14:36:56,535 INFO L226 Difference]: Without dead ends: 414 [2019-12-07 14:36:56,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-12-07 14:36:56,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 352. [2019-12-07 14:36:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 14:36:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 538 transitions. [2019-12-07 14:36:56,542 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 538 transitions. Word has length 117 [2019-12-07 14:36:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:56,542 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 538 transitions. [2019-12-07 14:36:56,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 538 transitions. [2019-12-07 14:36:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 14:36:56,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:56,543 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:56,543 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:56,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1970836820, now seen corresponding path program 1 times [2019-12-07 14:36:56,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:56,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411839430] [2019-12-07 14:36:56,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:56,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411839430] [2019-12-07 14:36:56,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:56,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:56,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655948837] [2019-12-07 14:36:56,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:56,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:56,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:56,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:56,583 INFO L87 Difference]: Start difference. First operand 352 states and 538 transitions. Second operand 4 states. [2019-12-07 14:36:56,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:56,828 INFO L93 Difference]: Finished difference Result 712 states and 1089 transitions. [2019-12-07 14:36:56,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:56,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 14:36:56,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:56,830 INFO L225 Difference]: With dead ends: 712 [2019-12-07 14:36:56,830 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 14:36:56,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 14:36:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2019-12-07 14:36:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 14:36:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 537 transitions. [2019-12-07 14:36:56,836 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 537 transitions. Word has length 117 [2019-12-07 14:36:56,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:56,837 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 537 transitions. [2019-12-07 14:36:56,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:56,837 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 537 transitions. [2019-12-07 14:36:56,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 14:36:56,837 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:56,837 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:56,837 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:56,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:56,838 INFO L82 PathProgramCache]: Analyzing trace with hash -553332389, now seen corresponding path program 1 times [2019-12-07 14:36:56,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:56,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408225231] [2019-12-07 14:36:56,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:56,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408225231] [2019-12-07 14:36:56,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:56,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:56,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209349103] [2019-12-07 14:36:56,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:56,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:56,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:56,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:56,871 INFO L87 Difference]: Start difference. First operand 352 states and 537 transitions. Second operand 4 states. [2019-12-07 14:36:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:57,111 INFO L93 Difference]: Finished difference Result 712 states and 1087 transitions. [2019-12-07 14:36:57,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:57,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 14:36:57,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:57,113 INFO L225 Difference]: With dead ends: 712 [2019-12-07 14:36:57,113 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 14:36:57,114 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:57,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 14:36:57,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2019-12-07 14:36:57,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 14:36:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 536 transitions. [2019-12-07 14:36:57,119 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 536 transitions. Word has length 118 [2019-12-07 14:36:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:57,119 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 536 transitions. [2019-12-07 14:36:57,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 536 transitions. [2019-12-07 14:36:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 14:36:57,120 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:57,120 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:57,120 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:57,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:57,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1182137177, now seen corresponding path program 1 times [2019-12-07 14:36:57,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:57,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104420248] [2019-12-07 14:36:57,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:57,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:57,164 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:57,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104420248] [2019-12-07 14:36:57,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:57,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:57,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432424756] [2019-12-07 14:36:57,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:57,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:57,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:57,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:57,165 INFO L87 Difference]: Start difference. First operand 352 states and 536 transitions. Second operand 4 states. [2019-12-07 14:36:57,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:57,383 INFO L93 Difference]: Finished difference Result 712 states and 1085 transitions. [2019-12-07 14:36:57,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:57,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 14:36:57,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:57,385 INFO L225 Difference]: With dead ends: 712 [2019-12-07 14:36:57,385 INFO L226 Difference]: Without dead ends: 379 [2019-12-07 14:36:57,385 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:57,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-12-07 14:36:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 352. [2019-12-07 14:36:57,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 14:36:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 535 transitions. [2019-12-07 14:36:57,391 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 535 transitions. Word has length 119 [2019-12-07 14:36:57,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:57,391 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 535 transitions. [2019-12-07 14:36:57,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:57,391 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 535 transitions. [2019-12-07 14:36:57,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 14:36:57,392 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:57,392 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:57,392 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:57,392 INFO L82 PathProgramCache]: Analyzing trace with hash -822018314, now seen corresponding path program 1 times [2019-12-07 14:36:57,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:57,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072443814] [2019-12-07 14:36:57,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:57,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072443814] [2019-12-07 14:36:57,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:57,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:57,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579803603] [2019-12-07 14:36:57,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:57,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:57,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:57,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:57,427 INFO L87 Difference]: Start difference. First operand 352 states and 535 transitions. Second operand 4 states. [2019-12-07 14:36:57,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:57,652 INFO L93 Difference]: Finished difference Result 702 states and 1071 transitions. [2019-12-07 14:36:57,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:57,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 14:36:57,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:57,654 INFO L225 Difference]: With dead ends: 702 [2019-12-07 14:36:57,654 INFO L226 Difference]: Without dead ends: 369 [2019-12-07 14:36:57,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-12-07 14:36:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 352. [2019-12-07 14:36:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2019-12-07 14:36:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 534 transitions. [2019-12-07 14:36:57,660 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 534 transitions. Word has length 120 [2019-12-07 14:36:57,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:57,660 INFO L462 AbstractCegarLoop]: Abstraction has 352 states and 534 transitions. [2019-12-07 14:36:57,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 534 transitions. [2019-12-07 14:36:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 14:36:57,661 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:57,661 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:57,661 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1871688814, now seen corresponding path program 1 times [2019-12-07 14:36:57,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:57,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987925003] [2019-12-07 14:36:57,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:57,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987925003] [2019-12-07 14:36:57,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:57,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 14:36:57,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320039352] [2019-12-07 14:36:57,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 14:36:57,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:57,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 14:36:57,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:57,710 INFO L87 Difference]: Start difference. First operand 352 states and 534 transitions. Second operand 3 states. [2019-12-07 14:36:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:57,755 INFO L93 Difference]: Finished difference Result 1014 states and 1553 transitions. [2019-12-07 14:36:57,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 14:36:57,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-12-07 14:36:57,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:57,758 INFO L225 Difference]: With dead ends: 1014 [2019-12-07 14:36:57,759 INFO L226 Difference]: Without dead ends: 681 [2019-12-07 14:36:57,759 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 14:36:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-12-07 14:36:57,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 679. [2019-12-07 14:36:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-12-07 14:36:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1031 transitions. [2019-12-07 14:36:57,776 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1031 transitions. Word has length 121 [2019-12-07 14:36:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:57,776 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 1031 transitions. [2019-12-07 14:36:57,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 14:36:57,776 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1031 transitions. [2019-12-07 14:36:57,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 14:36:57,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:57,777 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:57,778 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:57,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:57,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1051471184, now seen corresponding path program 1 times [2019-12-07 14:36:57,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:57,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907611365] [2019-12-07 14:36:57,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:57,828 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:57,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907611365] [2019-12-07 14:36:57,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:57,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:57,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396516940] [2019-12-07 14:36:57,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:57,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:57,829 INFO L87 Difference]: Start difference. First operand 679 states and 1031 transitions. Second operand 4 states. [2019-12-07 14:36:58,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:58,148 INFO L93 Difference]: Finished difference Result 1547 states and 2358 transitions. [2019-12-07 14:36:58,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:58,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 14:36:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:58,152 INFO L225 Difference]: With dead ends: 1547 [2019-12-07 14:36:58,152 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 14:36:58,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:58,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 14:36:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 757. [2019-12-07 14:36:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-12-07 14:36:58,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1173 transitions. [2019-12-07 14:36:58,165 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1173 transitions. Word has length 121 [2019-12-07 14:36:58,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:58,165 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1173 transitions. [2019-12-07 14:36:58,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1173 transitions. [2019-12-07 14:36:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 14:36:58,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:58,166 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:58,166 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:58,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1771915186, now seen corresponding path program 1 times [2019-12-07 14:36:58,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:58,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111612200] [2019-12-07 14:36:58,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:58,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:58,218 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:36:58,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111612200] [2019-12-07 14:36:58,218 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:58,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:58,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029540019] [2019-12-07 14:36:58,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:58,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:58,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:58,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:58,219 INFO L87 Difference]: Start difference. First operand 757 states and 1173 transitions. Second operand 4 states. [2019-12-07 14:36:58,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:58,521 INFO L93 Difference]: Finished difference Result 1617 states and 2489 transitions. [2019-12-07 14:36:58,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:58,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 14:36:58,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:58,526 INFO L225 Difference]: With dead ends: 1617 [2019-12-07 14:36:58,526 INFO L226 Difference]: Without dead ends: 879 [2019-12-07 14:36:58,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2019-12-07 14:36:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 679. [2019-12-07 14:36:58,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-12-07 14:36:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1031 transitions. [2019-12-07 14:36:58,547 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1031 transitions. Word has length 122 [2019-12-07 14:36:58,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:58,547 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 1031 transitions. [2019-12-07 14:36:58,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1031 transitions. [2019-12-07 14:36:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 14:36:58,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:58,549 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:58,549 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:58,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:58,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1718013730, now seen corresponding path program 1 times [2019-12-07 14:36:58,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:58,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827433690] [2019-12-07 14:36:58,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 14:36:58,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827433690] [2019-12-07 14:36:58,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:58,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:58,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167161961] [2019-12-07 14:36:58,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:58,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:58,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:58,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:58,599 INFO L87 Difference]: Start difference. First operand 679 states and 1031 transitions. Second operand 4 states. [2019-12-07 14:36:58,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:58,861 INFO L93 Difference]: Finished difference Result 1371 states and 2084 transitions. [2019-12-07 14:36:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:58,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-12-07 14:36:58,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:58,863 INFO L225 Difference]: With dead ends: 1371 [2019-12-07 14:36:58,863 INFO L226 Difference]: Without dead ends: 711 [2019-12-07 14:36:58,864 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-12-07 14:36:58,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 685. [2019-12-07 14:36:58,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 14:36:58,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1037 transitions. [2019-12-07 14:36:58,876 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1037 transitions. Word has length 123 [2019-12-07 14:36:58,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:58,876 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1037 transitions. [2019-12-07 14:36:58,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1037 transitions. [2019-12-07 14:36:58,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:36:58,877 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:58,877 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:58,877 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:58,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:58,877 INFO L82 PathProgramCache]: Analyzing trace with hash 811271589, now seen corresponding path program 1 times [2019-12-07 14:36:58,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:58,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615960865] [2019-12-07 14:36:58,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 14:36:58,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615960865] [2019-12-07 14:36:58,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:58,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:58,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565741790] [2019-12-07 14:36:58,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:58,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:58,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:58,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:58,918 INFO L87 Difference]: Start difference. First operand 685 states and 1037 transitions. Second operand 4 states. [2019-12-07 14:36:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:59,150 INFO L93 Difference]: Finished difference Result 1385 states and 2098 transitions. [2019-12-07 14:36:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:59,151 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 14:36:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:59,154 INFO L225 Difference]: With dead ends: 1385 [2019-12-07 14:36:59,154 INFO L226 Difference]: Without dead ends: 719 [2019-12-07 14:36:59,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:59,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2019-12-07 14:36:59,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 685. [2019-12-07 14:36:59,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-12-07 14:36:59,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1035 transitions. [2019-12-07 14:36:59,177 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1035 transitions. Word has length 130 [2019-12-07 14:36:59,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:59,177 INFO L462 AbstractCegarLoop]: Abstraction has 685 states and 1035 transitions. [2019-12-07 14:36:59,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:59,177 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1035 transitions. [2019-12-07 14:36:59,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-12-07 14:36:59,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:59,178 INFO L410 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, 1, 1, 1] [2019-12-07 14:36:59,178 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:59,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:59,178 INFO L82 PathProgramCache]: Analyzing trace with hash 166214161, now seen corresponding path program 1 times [2019-12-07 14:36:59,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:59,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470986024] [2019-12-07 14:36:59,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:36:59,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470986024] [2019-12-07 14:36:59,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:59,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:59,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890290667] [2019-12-07 14:36:59,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:59,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:59,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:59,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:59,220 INFO L87 Difference]: Start difference. First operand 685 states and 1035 transitions. Second operand 4 states. [2019-12-07 14:36:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:59,478 INFO L93 Difference]: Finished difference Result 1477 states and 2244 transitions. [2019-12-07 14:36:59,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:59,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-12-07 14:36:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:59,481 INFO L225 Difference]: With dead ends: 1477 [2019-12-07 14:36:59,481 INFO L226 Difference]: Without dead ends: 811 [2019-12-07 14:36:59,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2019-12-07 14:36:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 741. [2019-12-07 14:36:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-07 14:36:59,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1133 transitions. [2019-12-07 14:36:59,494 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1133 transitions. Word has length 130 [2019-12-07 14:36:59,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:59,495 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1133 transitions. [2019-12-07 14:36:59,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1133 transitions. [2019-12-07 14:36:59,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 14:36:59,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:59,496 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:59,496 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:59,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:59,496 INFO L82 PathProgramCache]: Analyzing trace with hash -450159466, now seen corresponding path program 1 times [2019-12-07 14:36:59,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:59,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393209268] [2019-12-07 14:36:59,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 14:36:59,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393209268] [2019-12-07 14:36:59,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:59,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:59,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514811327] [2019-12-07 14:36:59,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:59,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:59,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:59,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:59,532 INFO L87 Difference]: Start difference. First operand 741 states and 1133 transitions. Second operand 4 states. [2019-12-07 14:36:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:36:59,747 INFO L93 Difference]: Finished difference Result 1493 states and 2286 transitions. [2019-12-07 14:36:59,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:36:59,748 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 14:36:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:36:59,751 INFO L225 Difference]: With dead ends: 1493 [2019-12-07 14:36:59,751 INFO L226 Difference]: Without dead ends: 771 [2019-12-07 14:36:59,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:36:59,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-12-07 14:36:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 741. [2019-12-07 14:36:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-07 14:36:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1131 transitions. [2019-12-07 14:36:59,764 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1131 transitions. Word has length 131 [2019-12-07 14:36:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:36:59,764 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1131 transitions. [2019-12-07 14:36:59,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:36:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1131 transitions. [2019-12-07 14:36:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 14:36:59,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:36:59,765 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:36:59,765 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:36:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:36:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash 639118678, now seen corresponding path program 1 times [2019-12-07 14:36:59,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:36:59,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190937349] [2019-12-07 14:36:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:36:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:36:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:36:59,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190937349] [2019-12-07 14:36:59,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:36:59,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:36:59,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81925674] [2019-12-07 14:36:59,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:36:59,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:36:59,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:36:59,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:36:59,800 INFO L87 Difference]: Start difference. First operand 741 states and 1131 transitions. Second operand 4 states. [2019-12-07 14:37:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:00,149 INFO L93 Difference]: Finished difference Result 1663 states and 2545 transitions. [2019-12-07 14:37:00,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:00,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-12-07 14:37:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:00,155 INFO L225 Difference]: With dead ends: 1663 [2019-12-07 14:37:00,155 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:37:00,156 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:00,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:37:00,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 765. [2019-12-07 14:37:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-12-07 14:37:00,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1165 transitions. [2019-12-07 14:37:00,177 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1165 transitions. Word has length 131 [2019-12-07 14:37:00,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:00,177 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1165 transitions. [2019-12-07 14:37:00,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1165 transitions. [2019-12-07 14:37:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 14:37:00,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:00,178 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:00,178 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:00,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:00,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1249090575, now seen corresponding path program 1 times [2019-12-07 14:37:00,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:00,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969789060] [2019-12-07 14:37:00,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:00,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969789060] [2019-12-07 14:37:00,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:00,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:00,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118006806] [2019-12-07 14:37:00,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:00,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:00,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:00,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:00,214 INFO L87 Difference]: Start difference. First operand 765 states and 1165 transitions. Second operand 4 states. [2019-12-07 14:37:00,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:00,522 INFO L93 Difference]: Finished difference Result 1687 states and 2577 transitions. [2019-12-07 14:37:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:00,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 14:37:00,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:00,526 INFO L225 Difference]: With dead ends: 1687 [2019-12-07 14:37:00,526 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:37:00,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:37:00,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 767. [2019-12-07 14:37:00,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-12-07 14:37:00,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1167 transitions. [2019-12-07 14:37:00,542 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1167 transitions. Word has length 132 [2019-12-07 14:37:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:00,542 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1167 transitions. [2019-12-07 14:37:00,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1167 transitions. [2019-12-07 14:37:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 14:37:00,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:00,544 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:00,544 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:00,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:00,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1275804463, now seen corresponding path program 1 times [2019-12-07 14:37:00,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:00,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866739218] [2019-12-07 14:37:00,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:00,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:00,578 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:00,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866739218] [2019-12-07 14:37:00,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:00,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:00,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964971994] [2019-12-07 14:37:00,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:00,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:00,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:00,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:00,579 INFO L87 Difference]: Start difference. First operand 767 states and 1167 transitions. Second operand 4 states. [2019-12-07 14:37:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:00,871 INFO L93 Difference]: Finished difference Result 1689 states and 2577 transitions. [2019-12-07 14:37:00,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:00,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 14:37:00,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:00,874 INFO L225 Difference]: With dead ends: 1689 [2019-12-07 14:37:00,875 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:37:00,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:37:00,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 769. [2019-12-07 14:37:00,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-07 14:37:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1169 transitions. [2019-12-07 14:37:00,890 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1169 transitions. Word has length 133 [2019-12-07 14:37:00,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:00,890 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1169 transitions. [2019-12-07 14:37:00,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1169 transitions. [2019-12-07 14:37:00,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 14:37:00,891 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:00,891 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:00,891 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash 569263116, now seen corresponding path program 1 times [2019-12-07 14:37:00,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:00,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106061030] [2019-12-07 14:37:00,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:00,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106061030] [2019-12-07 14:37:00,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:00,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:00,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830525862] [2019-12-07 14:37:00,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:00,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:00,926 INFO L87 Difference]: Start difference. First operand 769 states and 1169 transitions. Second operand 4 states. [2019-12-07 14:37:01,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:01,226 INFO L93 Difference]: Finished difference Result 1671 states and 2553 transitions. [2019-12-07 14:37:01,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:01,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 14:37:01,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:01,229 INFO L225 Difference]: With dead ends: 1671 [2019-12-07 14:37:01,229 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 14:37:01,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:01,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 14:37:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 771. [2019-12-07 14:37:01,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-07 14:37:01,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1171 transitions. [2019-12-07 14:37:01,245 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1171 transitions. Word has length 134 [2019-12-07 14:37:01,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:01,245 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1171 transitions. [2019-12-07 14:37:01,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:01,245 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1171 transitions. [2019-12-07 14:37:01,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 14:37:01,246 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:01,246 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:01,246 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:01,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:01,246 INFO L82 PathProgramCache]: Analyzing trace with hash 817580357, now seen corresponding path program 1 times [2019-12-07 14:37:01,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:01,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135383168] [2019-12-07 14:37:01,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:01,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:01,281 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:01,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135383168] [2019-12-07 14:37:01,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:01,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:01,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332225533] [2019-12-07 14:37:01,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:01,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:01,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:01,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:01,282 INFO L87 Difference]: Start difference. First operand 771 states and 1171 transitions. Second operand 4 states. [2019-12-07 14:37:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:01,599 INFO L93 Difference]: Finished difference Result 1693 states and 2577 transitions. [2019-12-07 14:37:01,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:01,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 14:37:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:01,602 INFO L225 Difference]: With dead ends: 1693 [2019-12-07 14:37:01,602 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:37:01,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:37:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 771. [2019-12-07 14:37:01,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-07 14:37:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1169 transitions. [2019-12-07 14:37:01,617 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1169 transitions. Word has length 136 [2019-12-07 14:37:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:01,617 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1169 transitions. [2019-12-07 14:37:01,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1169 transitions. [2019-12-07 14:37:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-12-07 14:37:01,618 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:01,618 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:01,619 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:01,619 INFO L82 PathProgramCache]: Analyzing trace with hash -11745822, now seen corresponding path program 1 times [2019-12-07 14:37:01,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:01,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217357809] [2019-12-07 14:37:01,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:01,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:01,654 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:01,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217357809] [2019-12-07 14:37:01,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:01,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:01,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846603051] [2019-12-07 14:37:01,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:01,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:01,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:01,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:01,655 INFO L87 Difference]: Start difference. First operand 771 states and 1169 transitions. Second operand 4 states. [2019-12-07 14:37:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:01,976 INFO L93 Difference]: Finished difference Result 1693 states and 2573 transitions. [2019-12-07 14:37:01,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:01,976 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-12-07 14:37:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:01,978 INFO L225 Difference]: With dead ends: 1693 [2019-12-07 14:37:01,978 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:37:01,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:37:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 771. [2019-12-07 14:37:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-07 14:37:01,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1167 transitions. [2019-12-07 14:37:01,994 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1167 transitions. Word has length 137 [2019-12-07 14:37:01,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:01,994 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1167 transitions. [2019-12-07 14:37:01,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:01,994 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1167 transitions. [2019-12-07 14:37:01,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-12-07 14:37:01,995 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:01,995 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:01,995 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:01,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1572822784, now seen corresponding path program 1 times [2019-12-07 14:37:01,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:01,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696149246] [2019-12-07 14:37:01,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:02,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696149246] [2019-12-07 14:37:02,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:02,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:02,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181439866] [2019-12-07 14:37:02,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:02,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:02,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:02,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:02,032 INFO L87 Difference]: Start difference. First operand 771 states and 1167 transitions. Second operand 4 states. [2019-12-07 14:37:02,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:02,376 INFO L93 Difference]: Finished difference Result 1693 states and 2569 transitions. [2019-12-07 14:37:02,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:02,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-12-07 14:37:02,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:02,378 INFO L225 Difference]: With dead ends: 1693 [2019-12-07 14:37:02,378 INFO L226 Difference]: Without dead ends: 941 [2019-12-07 14:37:02,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:02,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 941 states. [2019-12-07 14:37:02,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 941 to 771. [2019-12-07 14:37:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-12-07 14:37:02,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1165 transitions. [2019-12-07 14:37:02,396 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1165 transitions. Word has length 138 [2019-12-07 14:37:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:02,396 INFO L462 AbstractCegarLoop]: Abstraction has 771 states and 1165 transitions. [2019-12-07 14:37:02,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1165 transitions. [2019-12-07 14:37:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 14:37:02,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:02,397 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:02,397 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:02,397 INFO L82 PathProgramCache]: Analyzing trace with hash -48370243, now seen corresponding path program 1 times [2019-12-07 14:37:02,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:02,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893994772] [2019-12-07 14:37:02,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:02,440 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:02,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893994772] [2019-12-07 14:37:02,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:02,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:02,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484293652] [2019-12-07 14:37:02,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:02,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:02,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:02,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:02,441 INFO L87 Difference]: Start difference. First operand 771 states and 1165 transitions. Second operand 4 states. [2019-12-07 14:37:02,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:02,754 INFO L93 Difference]: Finished difference Result 1673 states and 2541 transitions. [2019-12-07 14:37:02,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:02,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-12-07 14:37:02,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:02,755 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 14:37:02,755 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 14:37:02,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:02,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 14:37:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 741. [2019-12-07 14:37:02,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2019-12-07 14:37:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1123 transitions. [2019-12-07 14:37:02,771 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1123 transitions. Word has length 139 [2019-12-07 14:37:02,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:02,771 INFO L462 AbstractCegarLoop]: Abstraction has 741 states and 1123 transitions. [2019-12-07 14:37:02,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:02,771 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1123 transitions. [2019-12-07 14:37:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 14:37:02,772 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:02,772 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2019-12-07 14:37:02,772 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash -387817481, now seen corresponding path program 1 times [2019-12-07 14:37:02,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:02,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616114968] [2019-12-07 14:37:02,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:02,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:02,810 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:02,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616114968] [2019-12-07 14:37:02,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:02,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:02,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44800618] [2019-12-07 14:37:02,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:02,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:02,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:02,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:02,811 INFO L87 Difference]: Start difference. First operand 741 states and 1123 transitions. Second operand 4 states. [2019-12-07 14:37:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:03,097 INFO L93 Difference]: Finished difference Result 1643 states and 2497 transitions. [2019-12-07 14:37:03,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:03,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 14:37:03,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:03,098 INFO L225 Difference]: With dead ends: 1643 [2019-12-07 14:37:03,098 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 14:37:03,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 14:37:03,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 797. [2019-12-07 14:37:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-07 14:37:03,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1213 transitions. [2019-12-07 14:37:03,116 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1213 transitions. Word has length 141 [2019-12-07 14:37:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:03,116 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1213 transitions. [2019-12-07 14:37:03,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1213 transitions. [2019-12-07 14:37:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 14:37:03,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:03,117 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:03,117 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:03,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:03,117 INFO L82 PathProgramCache]: Analyzing trace with hash 221383634, now seen corresponding path program 1 times [2019-12-07 14:37:03,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:03,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201906204] [2019-12-07 14:37:03,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:03,158 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:03,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201906204] [2019-12-07 14:37:03,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:03,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:03,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970862938] [2019-12-07 14:37:03,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:03,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:03,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:03,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:03,159 INFO L87 Difference]: Start difference. First operand 797 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:03,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:03,463 INFO L93 Difference]: Finished difference Result 1683 states and 2559 transitions. [2019-12-07 14:37:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:03,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 14:37:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:03,464 INFO L225 Difference]: With dead ends: 1683 [2019-12-07 14:37:03,464 INFO L226 Difference]: Without dead ends: 905 [2019-12-07 14:37:03,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-12-07 14:37:03,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 799. [2019-12-07 14:37:03,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-07 14:37:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1215 transitions. [2019-12-07 14:37:03,484 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1215 transitions. Word has length 142 [2019-12-07 14:37:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:03,484 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1215 transitions. [2019-12-07 14:37:03,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:03,484 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1215 transitions. [2019-12-07 14:37:03,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 14:37:03,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:03,485 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:03,485 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:03,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:03,486 INFO L82 PathProgramCache]: Analyzing trace with hash -287480005, now seen corresponding path program 1 times [2019-12-07 14:37:03,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:03,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602128694] [2019-12-07 14:37:03,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 14:37:03,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602128694] [2019-12-07 14:37:03,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:03,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:03,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900352792] [2019-12-07 14:37:03,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:03,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:03,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:03,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:03,524 INFO L87 Difference]: Start difference. First operand 799 states and 1215 transitions. Second operand 4 states. [2019-12-07 14:37:03,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:03,785 INFO L93 Difference]: Finished difference Result 1685 states and 2559 transitions. [2019-12-07 14:37:03,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:03,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-12-07 14:37:03,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:03,787 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 14:37:03,787 INFO L226 Difference]: Without dead ends: 905 [2019-12-07 14:37:03,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-12-07 14:37:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 799. [2019-12-07 14:37:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-07 14:37:03,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1213 transitions. [2019-12-07 14:37:03,804 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1213 transitions. Word has length 144 [2019-12-07 14:37:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:03,805 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1213 transitions. [2019-12-07 14:37:03,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1213 transitions. [2019-12-07 14:37:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 14:37:03,806 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:03,806 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:03,806 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:03,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:03,806 INFO L82 PathProgramCache]: Analyzing trace with hash -151720512, now seen corresponding path program 1 times [2019-12-07 14:37:03,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:03,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869870712] [2019-12-07 14:37:03,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:03,844 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 14:37:03,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869870712] [2019-12-07 14:37:03,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:03,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:03,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497163639] [2019-12-07 14:37:03,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:03,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:03,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:03,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:03,845 INFO L87 Difference]: Start difference. First operand 799 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:04,115 INFO L93 Difference]: Finished difference Result 1681 states and 2551 transitions. [2019-12-07 14:37:04,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:04,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 14:37:04,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:04,116 INFO L225 Difference]: With dead ends: 1681 [2019-12-07 14:37:04,117 INFO L226 Difference]: Without dead ends: 901 [2019-12-07 14:37:04,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-07 14:37:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 799. [2019-12-07 14:37:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2019-12-07 14:37:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1211 transitions. [2019-12-07 14:37:04,142 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1211 transitions. Word has length 145 [2019-12-07 14:37:04,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:04,143 INFO L462 AbstractCegarLoop]: Abstraction has 799 states and 1211 transitions. [2019-12-07 14:37:04,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:04,143 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1211 transitions. [2019-12-07 14:37:04,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 14:37:04,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:04,144 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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-12-07 14:37:04,144 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash -195389707, now seen corresponding path program 1 times [2019-12-07 14:37:04,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:04,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651911186] [2019-12-07 14:37:04,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:04,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:04,185 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:04,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651911186] [2019-12-07 14:37:04,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:04,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:04,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9237540] [2019-12-07 14:37:04,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:04,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:04,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:04,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:04,186 INFO L87 Difference]: Start difference. First operand 799 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:04,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:04,464 INFO L93 Difference]: Finished difference Result 1675 states and 2539 transitions. [2019-12-07 14:37:04,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:04,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 14:37:04,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:04,466 INFO L225 Difference]: With dead ends: 1675 [2019-12-07 14:37:04,466 INFO L226 Difference]: Without dead ends: 895 [2019-12-07 14:37:04,466 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:04,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-07 14:37:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 805. [2019-12-07 14:37:04,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 14:37:04,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1221 transitions. [2019-12-07 14:37:04,483 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1221 transitions. Word has length 145 [2019-12-07 14:37:04,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:04,483 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1221 transitions. [2019-12-07 14:37:04,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:04,483 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1221 transitions. [2019-12-07 14:37:04,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 14:37:04,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:04,484 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:04,485 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:04,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:04,485 INFO L82 PathProgramCache]: Analyzing trace with hash -346160540, now seen corresponding path program 1 times [2019-12-07 14:37:04,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:04,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369975636] [2019-12-07 14:37:04,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:37:04,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369975636] [2019-12-07 14:37:04,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:04,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:04,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878888502] [2019-12-07 14:37:04,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:04,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:04,526 INFO L87 Difference]: Start difference. First operand 805 states and 1221 transitions. Second operand 4 states. [2019-12-07 14:37:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:04,796 INFO L93 Difference]: Finished difference Result 1661 states and 2516 transitions. [2019-12-07 14:37:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:04,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-12-07 14:37:04,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:04,798 INFO L225 Difference]: With dead ends: 1661 [2019-12-07 14:37:04,798 INFO L226 Difference]: Without dead ends: 875 [2019-12-07 14:37:04,798 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-07 14:37:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 805. [2019-12-07 14:37:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 14:37:04,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1219 transitions. [2019-12-07 14:37:04,815 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1219 transitions. Word has length 145 [2019-12-07 14:37:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:04,816 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1219 transitions. [2019-12-07 14:37:04,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:04,816 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1219 transitions. [2019-12-07 14:37:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 14:37:04,817 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:04,817 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:04,817 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:04,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:04,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1679990054, now seen corresponding path program 1 times [2019-12-07 14:37:04,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:04,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514389127] [2019-12-07 14:37:04,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:04,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514389127] [2019-12-07 14:37:04,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:04,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:04,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934734635] [2019-12-07 14:37:04,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:04,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:04,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:04,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:04,859 INFO L87 Difference]: Start difference. First operand 805 states and 1219 transitions. Second operand 4 states. [2019-12-07 14:37:05,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:05,176 INFO L93 Difference]: Finished difference Result 1707 states and 2581 transitions. [2019-12-07 14:37:05,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:05,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 14:37:05,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:05,178 INFO L225 Difference]: With dead ends: 1707 [2019-12-07 14:37:05,178 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 14:37:05,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:05,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 14:37:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 805. [2019-12-07 14:37:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 14:37:05,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1217 transitions. [2019-12-07 14:37:05,196 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1217 transitions. Word has length 146 [2019-12-07 14:37:05,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:05,196 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1217 transitions. [2019-12-07 14:37:05,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1217 transitions. [2019-12-07 14:37:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 14:37:05,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:05,197 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:05,197 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:05,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:05,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1727975261, now seen corresponding path program 1 times [2019-12-07 14:37:05,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:05,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446766011] [2019-12-07 14:37:05,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:05,246 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:37:05,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446766011] [2019-12-07 14:37:05,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:05,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:05,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419492629] [2019-12-07 14:37:05,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:05,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:05,247 INFO L87 Difference]: Start difference. First operand 805 states and 1217 transitions. Second operand 4 states. [2019-12-07 14:37:05,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:05,535 INFO L93 Difference]: Finished difference Result 1661 states and 2508 transitions. [2019-12-07 14:37:05,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:05,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 14:37:05,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:05,536 INFO L225 Difference]: With dead ends: 1661 [2019-12-07 14:37:05,536 INFO L226 Difference]: Without dead ends: 875 [2019-12-07 14:37:05,537 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:05,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-07 14:37:05,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 805. [2019-12-07 14:37:05,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 14:37:05,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1215 transitions. [2019-12-07 14:37:05,558 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1215 transitions. Word has length 146 [2019-12-07 14:37:05,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:05,558 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1215 transitions. [2019-12-07 14:37:05,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1215 transitions. [2019-12-07 14:37:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 14:37:05,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:05,560 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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-12-07 14:37:05,560 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:05,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:05,560 INFO L82 PathProgramCache]: Analyzing trace with hash -101092221, now seen corresponding path program 1 times [2019-12-07 14:37:05,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:05,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76262583] [2019-12-07 14:37:05,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:05,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76262583] [2019-12-07 14:37:05,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:05,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:05,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453816950] [2019-12-07 14:37:05,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:05,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:05,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:05,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:05,611 INFO L87 Difference]: Start difference. First operand 805 states and 1215 transitions. Second operand 4 states. [2019-12-07 14:37:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:05,889 INFO L93 Difference]: Finished difference Result 1691 states and 2547 transitions. [2019-12-07 14:37:05,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:05,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 14:37:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:05,891 INFO L225 Difference]: With dead ends: 1691 [2019-12-07 14:37:05,891 INFO L226 Difference]: Without dead ends: 905 [2019-12-07 14:37:05,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:05,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-12-07 14:37:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 805. [2019-12-07 14:37:05,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 14:37:05,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1213 transitions. [2019-12-07 14:37:05,909 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1213 transitions. Word has length 147 [2019-12-07 14:37:05,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:05,910 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1213 transitions. [2019-12-07 14:37:05,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:05,910 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1213 transitions. [2019-12-07 14:37:05,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 14:37:05,911 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:05,911 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:05,911 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:05,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:05,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1058639455, now seen corresponding path program 1 times [2019-12-07 14:37:05,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:05,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530510775] [2019-12-07 14:37:05,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:05,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:37:05,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530510775] [2019-12-07 14:37:05,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:05,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:05,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79655907] [2019-12-07 14:37:05,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:05,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:05,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:05,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:05,950 INFO L87 Difference]: Start difference. First operand 805 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:06,217 INFO L93 Difference]: Finished difference Result 1661 states and 2500 transitions. [2019-12-07 14:37:06,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:06,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 14:37:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:06,218 INFO L225 Difference]: With dead ends: 1661 [2019-12-07 14:37:06,219 INFO L226 Difference]: Without dead ends: 875 [2019-12-07 14:37:06,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-07 14:37:06,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 805. [2019-12-07 14:37:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-12-07 14:37:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1211 transitions. [2019-12-07 14:37:06,237 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1211 transitions. Word has length 147 [2019-12-07 14:37:06,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:06,237 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1211 transitions. [2019-12-07 14:37:06,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:06,237 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1211 transitions. [2019-12-07 14:37:06,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 14:37:06,238 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:06,238 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:06,238 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:06,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:06,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2114027062, now seen corresponding path program 1 times [2019-12-07 14:37:06,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:06,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321776962] [2019-12-07 14:37:06,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:06,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321776962] [2019-12-07 14:37:06,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:06,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:06,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542026748] [2019-12-07 14:37:06,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:06,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:06,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:06,280 INFO L87 Difference]: Start difference. First operand 805 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:06,554 INFO L93 Difference]: Finished difference Result 1681 states and 2527 transitions. [2019-12-07 14:37:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:06,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 14:37:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:06,555 INFO L225 Difference]: With dead ends: 1681 [2019-12-07 14:37:06,555 INFO L226 Difference]: Without dead ends: 895 [2019-12-07 14:37:06,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:06,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-07 14:37:06,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 807. [2019-12-07 14:37:06,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-07 14:37:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1213 transitions. [2019-12-07 14:37:06,573 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1213 transitions. Word has length 148 [2019-12-07 14:37:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:06,573 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1213 transitions. [2019-12-07 14:37:06,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1213 transitions. [2019-12-07 14:37:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 14:37:06,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:06,574 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:06,574 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:06,575 INFO L82 PathProgramCache]: Analyzing trace with hash -77419458, now seen corresponding path program 1 times [2019-12-07 14:37:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519683804] [2019-12-07 14:37:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 14:37:06,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519683804] [2019-12-07 14:37:06,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:06,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:06,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420558079] [2019-12-07 14:37:06,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:06,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:06,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:06,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:06,617 INFO L87 Difference]: Start difference. First operand 807 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:06,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:06,881 INFO L93 Difference]: Finished difference Result 1645 states and 2476 transitions. [2019-12-07 14:37:06,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:06,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 14:37:06,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:06,882 INFO L225 Difference]: With dead ends: 1645 [2019-12-07 14:37:06,882 INFO L226 Difference]: Without dead ends: 857 [2019-12-07 14:37:06,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:06,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2019-12-07 14:37:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 807. [2019-12-07 14:37:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-07 14:37:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1211 transitions. [2019-12-07 14:37:06,901 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1211 transitions. Word has length 148 [2019-12-07 14:37:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:06,901 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1211 transitions. [2019-12-07 14:37:06,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1211 transitions. [2019-12-07 14:37:06,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 14:37:06,902 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:06,903 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:06,903 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:06,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:06,903 INFO L82 PathProgramCache]: Analyzing trace with hash -949131348, now seen corresponding path program 1 times [2019-12-07 14:37:06,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:06,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471762366] [2019-12-07 14:37:06,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 14:37:06,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471762366] [2019-12-07 14:37:06,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:06,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:06,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028159348] [2019-12-07 14:37:06,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:06,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:06,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:06,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:06,943 INFO L87 Difference]: Start difference. First operand 807 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:07,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:07,237 INFO L93 Difference]: Finished difference Result 1693 states and 2535 transitions. [2019-12-07 14:37:07,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:07,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 14:37:07,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:07,238 INFO L225 Difference]: With dead ends: 1693 [2019-12-07 14:37:07,238 INFO L226 Difference]: Without dead ends: 905 [2019-12-07 14:37:07,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:07,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2019-12-07 14:37:07,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 807. [2019-12-07 14:37:07,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2019-12-07 14:37:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 1209 transitions. [2019-12-07 14:37:07,260 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 1209 transitions. Word has length 149 [2019-12-07 14:37:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:07,260 INFO L462 AbstractCegarLoop]: Abstraction has 807 states and 1209 transitions. [2019-12-07 14:37:07,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1209 transitions. [2019-12-07 14:37:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 14:37:07,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:07,261 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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-12-07 14:37:07,261 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash 264416362, now seen corresponding path program 1 times [2019-12-07 14:37:07,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:07,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586070078] [2019-12-07 14:37:07,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:07,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586070078] [2019-12-07 14:37:07,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:07,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:07,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514834599] [2019-12-07 14:37:07,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:07,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:07,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:07,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:07,314 INFO L87 Difference]: Start difference. First operand 807 states and 1209 transitions. Second operand 4 states. [2019-12-07 14:37:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:07,602 INFO L93 Difference]: Finished difference Result 1671 states and 2503 transitions. [2019-12-07 14:37:07,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:07,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 14:37:07,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:07,603 INFO L225 Difference]: With dead ends: 1671 [2019-12-07 14:37:07,603 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 14:37:07,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:07,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 14:37:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 809. [2019-12-07 14:37:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-12-07 14:37:07,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1211 transitions. [2019-12-07 14:37:07,625 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1211 transitions. Word has length 149 [2019-12-07 14:37:07,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:07,625 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 1211 transitions. [2019-12-07 14:37:07,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:07,625 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1211 transitions. [2019-12-07 14:37:07,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 14:37:07,626 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:07,627 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 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] [2019-12-07 14:37:07,627 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:07,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:07,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1435910696, now seen corresponding path program 1 times [2019-12-07 14:37:07,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:07,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164770322] [2019-12-07 14:37:07,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:07,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164770322] [2019-12-07 14:37:07,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:07,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:07,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499385602] [2019-12-07 14:37:07,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:07,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:07,669 INFO L87 Difference]: Start difference. First operand 809 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:07,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:07,946 INFO L93 Difference]: Finished difference Result 1673 states and 2503 transitions. [2019-12-07 14:37:07,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:07,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 14:37:07,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:07,947 INFO L225 Difference]: With dead ends: 1673 [2019-12-07 14:37:07,947 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 14:37:07,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 14:37:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 811. [2019-12-07 14:37:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 14:37:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1213 transitions. [2019-12-07 14:37:07,966 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1213 transitions. Word has length 149 [2019-12-07 14:37:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:07,967 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1213 transitions. [2019-12-07 14:37:07,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1213 transitions. [2019-12-07 14:37:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 14:37:07,968 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:07,968 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:07,968 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:07,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:07,968 INFO L82 PathProgramCache]: Analyzing trace with hash 811924335, now seen corresponding path program 1 times [2019-12-07 14:37:07,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:07,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011383657] [2019-12-07 14:37:07,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:08,009 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 14:37:08,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011383657] [2019-12-07 14:37:08,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:08,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:08,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272629743] [2019-12-07 14:37:08,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:08,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:08,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:08,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:08,010 INFO L87 Difference]: Start difference. First operand 811 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:08,299 INFO L93 Difference]: Finished difference Result 1693 states and 2527 transitions. [2019-12-07 14:37:08,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:08,299 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 14:37:08,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:08,300 INFO L225 Difference]: With dead ends: 1693 [2019-12-07 14:37:08,300 INFO L226 Difference]: Without dead ends: 901 [2019-12-07 14:37:08,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2019-12-07 14:37:08,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 811. [2019-12-07 14:37:08,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 14:37:08,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1211 transitions. [2019-12-07 14:37:08,320 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1211 transitions. Word has length 150 [2019-12-07 14:37:08,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:08,320 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1211 transitions. [2019-12-07 14:37:08,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:08,320 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1211 transitions. [2019-12-07 14:37:08,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 14:37:08,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:08,321 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 14:37:08,321 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:08,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:08,321 INFO L82 PathProgramCache]: Analyzing trace with hash 768255140, now seen corresponding path program 1 times [2019-12-07 14:37:08,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:08,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647450286] [2019-12-07 14:37:08,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:08,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647450286] [2019-12-07 14:37:08,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:08,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:08,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471402828] [2019-12-07 14:37:08,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:08,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:08,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:08,363 INFO L87 Difference]: Start difference. First operand 811 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:08,629 INFO L93 Difference]: Finished difference Result 1687 states and 2515 transitions. [2019-12-07 14:37:08,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:08,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 14:37:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:08,630 INFO L225 Difference]: With dead ends: 1687 [2019-12-07 14:37:08,630 INFO L226 Difference]: Without dead ends: 895 [2019-12-07 14:37:08,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-07 14:37:08,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 811. [2019-12-07 14:37:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 14:37:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1209 transitions. [2019-12-07 14:37:08,650 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1209 transitions. Word has length 150 [2019-12-07 14:37:08,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:08,650 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1209 transitions. [2019-12-07 14:37:08,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1209 transitions. [2019-12-07 14:37:08,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 14:37:08,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:08,651 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:08,652 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:08,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:08,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1685212200, now seen corresponding path program 1 times [2019-12-07 14:37:08,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:08,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473758304] [2019-12-07 14:37:08,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:08,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473758304] [2019-12-07 14:37:08,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:08,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:08,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289549424] [2019-12-07 14:37:08,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:08,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:08,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:08,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:08,695 INFO L87 Difference]: Start difference. First operand 811 states and 1209 transitions. Second operand 4 states. [2019-12-07 14:37:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:08,961 INFO L93 Difference]: Finished difference Result 1669 states and 2488 transitions. [2019-12-07 14:37:08,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:08,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 14:37:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:08,962 INFO L225 Difference]: With dead ends: 1669 [2019-12-07 14:37:08,962 INFO L226 Difference]: Without dead ends: 877 [2019-12-07 14:37:08,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:08,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-07 14:37:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 813. [2019-12-07 14:37:08,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-12-07 14:37:08,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1211 transitions. [2019-12-07 14:37:08,982 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1211 transitions. Word has length 150 [2019-12-07 14:37:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:08,982 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1211 transitions. [2019-12-07 14:37:08,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:08,982 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1211 transitions. [2019-12-07 14:37:08,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 14:37:08,983 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:08,983 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2019-12-07 14:37:08,983 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:08,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash -2097408288, now seen corresponding path program 1 times [2019-12-07 14:37:08,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:08,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44944335] [2019-12-07 14:37:08,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:09,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44944335] [2019-12-07 14:37:09,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:09,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:09,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678542642] [2019-12-07 14:37:09,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:09,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:09,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:09,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:09,025 INFO L87 Difference]: Start difference. First operand 813 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:09,271 INFO L93 Difference]: Finished difference Result 1671 states and 2488 transitions. [2019-12-07 14:37:09,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:09,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 14:37:09,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:09,272 INFO L225 Difference]: With dead ends: 1671 [2019-12-07 14:37:09,272 INFO L226 Difference]: Without dead ends: 877 [2019-12-07 14:37:09,272 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-07 14:37:09,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 815. [2019-12-07 14:37:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-12-07 14:37:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1213 transitions. [2019-12-07 14:37:09,293 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1213 transitions. Word has length 151 [2019-12-07 14:37:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:09,293 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1213 transitions. [2019-12-07 14:37:09,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1213 transitions. [2019-12-07 14:37:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 14:37:09,294 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:09,294 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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] [2019-12-07 14:37:09,294 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:09,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:09,294 INFO L82 PathProgramCache]: Analyzing trace with hash 790135168, now seen corresponding path program 1 times [2019-12-07 14:37:09,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:09,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197592030] [2019-12-07 14:37:09,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:09,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197592030] [2019-12-07 14:37:09,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:09,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:09,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876387533] [2019-12-07 14:37:09,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:09,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:09,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:09,338 INFO L87 Difference]: Start difference. First operand 815 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:09,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:09,625 INFO L93 Difference]: Finished difference Result 1667 states and 2481 transitions. [2019-12-07 14:37:09,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:09,626 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 14:37:09,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:09,626 INFO L225 Difference]: With dead ends: 1667 [2019-12-07 14:37:09,626 INFO L226 Difference]: Without dead ends: 871 [2019-12-07 14:37:09,627 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:09,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2019-12-07 14:37:09,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 817. [2019-12-07 14:37:09,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 14:37:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1215 transitions. [2019-12-07 14:37:09,647 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1215 transitions. Word has length 152 [2019-12-07 14:37:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:09,647 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1215 transitions. [2019-12-07 14:37:09,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1215 transitions. [2019-12-07 14:37:09,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 14:37:09,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:09,648 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 14:37:09,649 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:09,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:09,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1731796549, now seen corresponding path program 1 times [2019-12-07 14:37:09,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:09,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604956757] [2019-12-07 14:37:09,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:09,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604956757] [2019-12-07 14:37:09,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:09,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:09,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729219600] [2019-12-07 14:37:09,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:09,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:09,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:09,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:09,690 INFO L87 Difference]: Start difference. First operand 817 states and 1215 transitions. Second operand 4 states. [2019-12-07 14:37:09,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:09,961 INFO L93 Difference]: Finished difference Result 1693 states and 2511 transitions. [2019-12-07 14:37:09,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:09,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 14:37:09,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:09,962 INFO L225 Difference]: With dead ends: 1693 [2019-12-07 14:37:09,962 INFO L226 Difference]: Without dead ends: 895 [2019-12-07 14:37:09,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:09,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-07 14:37:09,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 817. [2019-12-07 14:37:09,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 14:37:09,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1213 transitions. [2019-12-07 14:37:09,984 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1213 transitions. Word has length 153 [2019-12-07 14:37:09,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:09,985 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1213 transitions. [2019-12-07 14:37:09,985 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:09,985 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1213 transitions. [2019-12-07 14:37:09,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 14:37:09,986 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:09,986 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 14:37:09,986 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:09,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:09,986 INFO L82 PathProgramCache]: Analyzing trace with hash -771339623, now seen corresponding path program 1 times [2019-12-07 14:37:09,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:09,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612548494] [2019-12-07 14:37:09,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:10,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612548494] [2019-12-07 14:37:10,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:10,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:10,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384491336] [2019-12-07 14:37:10,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:10,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:10,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:10,035 INFO L87 Difference]: Start difference. First operand 817 states and 1213 transitions. Second operand 4 states. [2019-12-07 14:37:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:10,304 INFO L93 Difference]: Finished difference Result 1681 states and 2491 transitions. [2019-12-07 14:37:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:10,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 14:37:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:10,305 INFO L225 Difference]: With dead ends: 1681 [2019-12-07 14:37:10,305 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 14:37:10,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 14:37:10,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 817. [2019-12-07 14:37:10,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 14:37:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1211 transitions. [2019-12-07 14:37:10,327 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1211 transitions. Word has length 154 [2019-12-07 14:37:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:10,327 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1211 transitions. [2019-12-07 14:37:10,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1211 transitions. [2019-12-07 14:37:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 14:37:10,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:10,328 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-12-07 14:37:10,328 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:10,328 INFO L82 PathProgramCache]: Analyzing trace with hash 400154711, now seen corresponding path program 1 times [2019-12-07 14:37:10,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:10,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465621432] [2019-12-07 14:37:10,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:10,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:10,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465621432] [2019-12-07 14:37:10,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:10,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:10,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290823856] [2019-12-07 14:37:10,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:10,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:10,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:10,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:10,372 INFO L87 Difference]: Start difference. First operand 817 states and 1211 transitions. Second operand 4 states. [2019-12-07 14:37:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:10,643 INFO L93 Difference]: Finished difference Result 1681 states and 2487 transitions. [2019-12-07 14:37:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:10,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 14:37:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:10,644 INFO L225 Difference]: With dead ends: 1681 [2019-12-07 14:37:10,644 INFO L226 Difference]: Without dead ends: 883 [2019-12-07 14:37:10,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:10,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2019-12-07 14:37:10,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 817. [2019-12-07 14:37:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 14:37:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1209 transitions. [2019-12-07 14:37:10,665 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1209 transitions. Word has length 154 [2019-12-07 14:37:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:10,665 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1209 transitions. [2019-12-07 14:37:10,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:10,665 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1209 transitions. [2019-12-07 14:37:10,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 14:37:10,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:10,666 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:10,667 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:10,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:10,667 INFO L82 PathProgramCache]: Analyzing trace with hash -358452263, now seen corresponding path program 1 times [2019-12-07 14:37:10,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:10,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967281370] [2019-12-07 14:37:10,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:10,709 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:10,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967281370] [2019-12-07 14:37:10,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:10,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:10,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487491071] [2019-12-07 14:37:10,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:10,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:10,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:10,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:10,710 INFO L87 Difference]: Start difference. First operand 817 states and 1209 transitions. Second operand 4 states. [2019-12-07 14:37:10,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:10,988 INFO L93 Difference]: Finished difference Result 1675 states and 2476 transitions. [2019-12-07 14:37:10,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:10,989 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 14:37:10,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:10,989 INFO L225 Difference]: With dead ends: 1675 [2019-12-07 14:37:10,989 INFO L226 Difference]: Without dead ends: 877 [2019-12-07 14:37:10,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:10,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2019-12-07 14:37:11,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 817. [2019-12-07 14:37:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 14:37:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1207 transitions. [2019-12-07 14:37:11,014 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1207 transitions. Word has length 155 [2019-12-07 14:37:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:11,014 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1207 transitions. [2019-12-07 14:37:11,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:11,014 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1207 transitions. [2019-12-07 14:37:11,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 14:37:11,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:11,015 INFO L410 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] [2019-12-07 14:37:11,015 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:11,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:11,015 INFO L82 PathProgramCache]: Analyzing trace with hash 153336709, now seen corresponding path program 1 times [2019-12-07 14:37:11,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:11,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622865770] [2019-12-07 14:37:11,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:11,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:11,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622865770] [2019-12-07 14:37:11,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:11,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:11,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895270760] [2019-12-07 14:37:11,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:11,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:11,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:11,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:11,059 INFO L87 Difference]: Start difference. First operand 817 states and 1207 transitions. Second operand 4 states. [2019-12-07 14:37:11,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:11,344 INFO L93 Difference]: Finished difference Result 1749 states and 2600 transitions. [2019-12-07 14:37:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:11,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-12-07 14:37:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:11,345 INFO L225 Difference]: With dead ends: 1749 [2019-12-07 14:37:11,345 INFO L226 Difference]: Without dead ends: 951 [2019-12-07 14:37:11,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:11,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2019-12-07 14:37:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 877. [2019-12-07 14:37:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-07 14:37:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1313 transitions. [2019-12-07 14:37:11,368 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1313 transitions. Word has length 155 [2019-12-07 14:37:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:11,368 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1313 transitions. [2019-12-07 14:37:11,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1313 transitions. [2019-12-07 14:37:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-12-07 14:37:11,369 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:11,369 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:11,369 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:11,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:11,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1026497201, now seen corresponding path program 1 times [2019-12-07 14:37:11,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:11,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472640891] [2019-12-07 14:37:11,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:11,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:11,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472640891] [2019-12-07 14:37:11,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:11,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:11,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797507288] [2019-12-07 14:37:11,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:11,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:11,416 INFO L87 Difference]: Start difference. First operand 877 states and 1313 transitions. Second operand 4 states. [2019-12-07 14:37:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:11,693 INFO L93 Difference]: Finished difference Result 1795 states and 2684 transitions. [2019-12-07 14:37:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:11,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-12-07 14:37:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:11,694 INFO L225 Difference]: With dead ends: 1795 [2019-12-07 14:37:11,694 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 14:37:11,695 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:11,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 14:37:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 877. [2019-12-07 14:37:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 877 states. [2019-12-07 14:37:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1311 transitions. [2019-12-07 14:37:11,717 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1311 transitions. Word has length 156 [2019-12-07 14:37:11,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:11,718 INFO L462 AbstractCegarLoop]: Abstraction has 877 states and 1311 transitions. [2019-12-07 14:37:11,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:11,718 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1311 transitions. [2019-12-07 14:37:11,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 14:37:11,719 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:11,719 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:11,719 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:11,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:11,719 INFO L82 PathProgramCache]: Analyzing trace with hash -371359503, now seen corresponding path program 1 times [2019-12-07 14:37:11,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:11,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360337302] [2019-12-07 14:37:11,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:11,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360337302] [2019-12-07 14:37:11,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:11,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:11,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148335571] [2019-12-07 14:37:11,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:11,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:11,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:11,764 INFO L87 Difference]: Start difference. First operand 877 states and 1311 transitions. Second operand 4 states. [2019-12-07 14:37:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:12,076 INFO L93 Difference]: Finished difference Result 1789 states and 2673 transitions. [2019-12-07 14:37:12,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:12,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 14:37:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:12,078 INFO L225 Difference]: With dead ends: 1789 [2019-12-07 14:37:12,078 INFO L226 Difference]: Without dead ends: 931 [2019-12-07 14:37:12,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:12,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-07 14:37:12,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 801. [2019-12-07 14:37:12,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2019-12-07 14:37:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1199 transitions. [2019-12-07 14:37:12,107 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1199 transitions. Word has length 157 [2019-12-07 14:37:12,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:12,107 INFO L462 AbstractCegarLoop]: Abstraction has 801 states and 1199 transitions. [2019-12-07 14:37:12,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:12,107 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1199 transitions. [2019-12-07 14:37:12,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 14:37:12,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:12,108 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 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] [2019-12-07 14:37:12,108 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:12,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:12,108 INFO L82 PathProgramCache]: Analyzing trace with hash -531929954, now seen corresponding path program 1 times [2019-12-07 14:37:12,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:12,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358967710] [2019-12-07 14:37:12,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:12,151 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 14:37:12,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358967710] [2019-12-07 14:37:12,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:12,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:12,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542770501] [2019-12-07 14:37:12,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:12,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:12,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:12,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:12,152 INFO L87 Difference]: Start difference. First operand 801 states and 1199 transitions. Second operand 4 states. [2019-12-07 14:37:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:12,445 INFO L93 Difference]: Finished difference Result 1713 states and 2559 transitions. [2019-12-07 14:37:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:12,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 14:37:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:12,446 INFO L225 Difference]: With dead ends: 1713 [2019-12-07 14:37:12,446 INFO L226 Difference]: Without dead ends: 931 [2019-12-07 14:37:12,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 931 states. [2019-12-07 14:37:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 931 to 861. [2019-12-07 14:37:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-12-07 14:37:12,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1289 transitions. [2019-12-07 14:37:12,469 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1289 transitions. Word has length 158 [2019-12-07 14:37:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:12,469 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1289 transitions. [2019-12-07 14:37:12,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1289 transitions. [2019-12-07 14:37:12,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 14:37:12,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:12,470 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:12,470 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:12,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:12,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2070234899, now seen corresponding path program 1 times [2019-12-07 14:37:12,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:12,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641085345] [2019-12-07 14:37:12,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:12,511 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 14:37:12,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641085345] [2019-12-07 14:37:12,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:12,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:12,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259577913] [2019-12-07 14:37:12,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:12,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:12,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:12,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:12,512 INFO L87 Difference]: Start difference. First operand 861 states and 1289 transitions. Second operand 4 states. [2019-12-07 14:37:12,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:12,825 INFO L93 Difference]: Finished difference Result 1753 states and 2628 transitions. [2019-12-07 14:37:12,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:12,826 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 14:37:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:12,828 INFO L225 Difference]: With dead ends: 1753 [2019-12-07 14:37:12,828 INFO L226 Difference]: Without dead ends: 911 [2019-12-07 14:37:12,829 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:12,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-12-07 14:37:12,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 861. [2019-12-07 14:37:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-12-07 14:37:12,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1287 transitions. [2019-12-07 14:37:12,868 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1287 transitions. Word has length 158 [2019-12-07 14:37:12,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:12,869 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1287 transitions. [2019-12-07 14:37:12,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1287 transitions. [2019-12-07 14:37:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 14:37:12,869 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:12,869 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:12,870 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:12,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:12,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1936249539, now seen corresponding path program 1 times [2019-12-07 14:37:12,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:12,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440994218] [2019-12-07 14:37:12,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:12,911 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 14:37:12,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440994218] [2019-12-07 14:37:12,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:12,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:12,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700196353] [2019-12-07 14:37:12,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:12,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:12,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:12,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:12,912 INFO L87 Difference]: Start difference. First operand 861 states and 1287 transitions. Second operand 4 states. [2019-12-07 14:37:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:13,384 INFO L93 Difference]: Finished difference Result 1769 states and 2639 transitions. [2019-12-07 14:37:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:13,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 14:37:13,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:13,386 INFO L225 Difference]: With dead ends: 1769 [2019-12-07 14:37:13,386 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 14:37:13,387 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 14:37:13,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 863. [2019-12-07 14:37:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-12-07 14:37:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1289 transitions. [2019-12-07 14:37:13,423 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1289 transitions. Word has length 159 [2019-12-07 14:37:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:13,424 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1289 transitions. [2019-12-07 14:37:13,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:13,424 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1289 transitions. [2019-12-07 14:37:13,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 14:37:13,424 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:13,424 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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] [2019-12-07 14:37:13,425 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:13,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:13,425 INFO L82 PathProgramCache]: Analyzing trace with hash 814431091, now seen corresponding path program 1 times [2019-12-07 14:37:13,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:13,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484123433] [2019-12-07 14:37:13,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:13,469 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:13,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484123433] [2019-12-07 14:37:13,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:13,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:13,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167308494] [2019-12-07 14:37:13,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:13,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:13,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:13,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:13,470 INFO L87 Difference]: Start difference. First operand 863 states and 1289 transitions. Second operand 4 states. [2019-12-07 14:37:13,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:13,890 INFO L93 Difference]: Finished difference Result 1771 states and 2639 transitions. [2019-12-07 14:37:13,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:13,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 14:37:13,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:13,893 INFO L225 Difference]: With dead ends: 1771 [2019-12-07 14:37:13,893 INFO L226 Difference]: Without dead ends: 927 [2019-12-07 14:37:13,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:13,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2019-12-07 14:37:13,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 887. [2019-12-07 14:37:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-12-07 14:37:13,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1317 transitions. [2019-12-07 14:37:13,936 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1317 transitions. Word has length 159 [2019-12-07 14:37:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:13,936 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1317 transitions. [2019-12-07 14:37:13,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1317 transitions. [2019-12-07 14:37:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 14:37:13,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:13,937 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:13,937 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:13,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:13,937 INFO L82 PathProgramCache]: Analyzing trace with hash 417452622, now seen corresponding path program 1 times [2019-12-07 14:37:13,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:13,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273473679] [2019-12-07 14:37:13,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:13,983 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 14:37:13,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273473679] [2019-12-07 14:37:13,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:13,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:13,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828635186] [2019-12-07 14:37:13,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:13,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:13,984 INFO L87 Difference]: Start difference. First operand 887 states and 1317 transitions. Second operand 4 states. [2019-12-07 14:37:14,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:14,532 INFO L93 Difference]: Finished difference Result 1801 states and 2680 transitions. [2019-12-07 14:37:14,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:14,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 14:37:14,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:14,535 INFO L225 Difference]: With dead ends: 1801 [2019-12-07 14:37:14,535 INFO L226 Difference]: Without dead ends: 933 [2019-12-07 14:37:14,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:14,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2019-12-07 14:37:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 887. [2019-12-07 14:37:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-12-07 14:37:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1315 transitions. [2019-12-07 14:37:14,572 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1315 transitions. Word has length 159 [2019-12-07 14:37:14,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:14,572 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1315 transitions. [2019-12-07 14:37:14,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1315 transitions. [2019-12-07 14:37:14,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 14:37:14,573 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:14,573 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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-12-07 14:37:14,573 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:14,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:14,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1528412147, now seen corresponding path program 1 times [2019-12-07 14:37:14,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:14,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695317350] [2019-12-07 14:37:14,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:14,618 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 14:37:14,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695317350] [2019-12-07 14:37:14,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:14,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:14,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885074780] [2019-12-07 14:37:14,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:14,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:14,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:14,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:14,619 INFO L87 Difference]: Start difference. First operand 887 states and 1315 transitions. Second operand 4 states. [2019-12-07 14:37:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:14,891 INFO L93 Difference]: Finished difference Result 1789 states and 2654 transitions. [2019-12-07 14:37:14,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:14,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 14:37:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:14,892 INFO L225 Difference]: With dead ends: 1789 [2019-12-07 14:37:14,892 INFO L226 Difference]: Without dead ends: 917 [2019-12-07 14:37:14,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-07 14:37:14,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 885. [2019-12-07 14:37:14,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-12-07 14:37:14,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1311 transitions. [2019-12-07 14:37:14,917 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1311 transitions. Word has length 160 [2019-12-07 14:37:14,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:14,917 INFO L462 AbstractCegarLoop]: Abstraction has 885 states and 1311 transitions. [2019-12-07 14:37:14,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:14,917 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1311 transitions. [2019-12-07 14:37:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 14:37:14,918 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:14,918 INFO L410 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] [2019-12-07 14:37:14,918 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:14,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash -565142878, now seen corresponding path program 1 times [2019-12-07 14:37:14,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:14,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146580445] [2019-12-07 14:37:14,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:15,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146580445] [2019-12-07 14:37:15,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:15,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:37:15,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52568675] [2019-12-07 14:37:15,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:37:15,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:37:15,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:15,006 INFO L87 Difference]: Start difference. First operand 885 states and 1311 transitions. Second operand 5 states. [2019-12-07 14:37:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:15,623 INFO L93 Difference]: Finished difference Result 1909 states and 2844 transitions. [2019-12-07 14:37:15,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:37:15,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-12-07 14:37:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:15,624 INFO L225 Difference]: With dead ends: 1909 [2019-12-07 14:37:15,624 INFO L226 Difference]: Without dead ends: 1043 [2019-12-07 14:37:15,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 14:37:15,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2019-12-07 14:37:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 951. [2019-12-07 14:37:15,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-07 14:37:15,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1429 transitions. [2019-12-07 14:37:15,650 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1429 transitions. Word has length 161 [2019-12-07 14:37:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:15,651 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1429 transitions. [2019-12-07 14:37:15,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:37:15,651 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1429 transitions. [2019-12-07 14:37:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 14:37:15,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:15,652 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:15,652 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:15,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:15,652 INFO L82 PathProgramCache]: Analyzing trace with hash 649415503, now seen corresponding path program 1 times [2019-12-07 14:37:15,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:15,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991934455] [2019-12-07 14:37:15,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:15,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:15,705 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 14:37:15,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991934455] [2019-12-07 14:37:15,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:15,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:15,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927058422] [2019-12-07 14:37:15,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:15,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:15,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:15,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:15,706 INFO L87 Difference]: Start difference. First operand 951 states and 1429 transitions. Second operand 4 states. [2019-12-07 14:37:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:15,978 INFO L93 Difference]: Finished difference Result 1933 states and 2905 transitions. [2019-12-07 14:37:15,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:15,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 14:37:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:15,979 INFO L225 Difference]: With dead ends: 1933 [2019-12-07 14:37:15,979 INFO L226 Difference]: Without dead ends: 1001 [2019-12-07 14:37:15,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:15,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2019-12-07 14:37:16,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 951. [2019-12-07 14:37:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-07 14:37:16,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1427 transitions. [2019-12-07 14:37:16,005 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1427 transitions. Word has length 163 [2019-12-07 14:37:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:16,005 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1427 transitions. [2019-12-07 14:37:16,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1427 transitions. [2019-12-07 14:37:16,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 14:37:16,006 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:16,006 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:16,006 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:16,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:16,006 INFO L82 PathProgramCache]: Analyzing trace with hash -96746958, now seen corresponding path program 1 times [2019-12-07 14:37:16,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:16,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118181850] [2019-12-07 14:37:16,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:16,052 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 14:37:16,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118181850] [2019-12-07 14:37:16,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:16,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:16,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348680162] [2019-12-07 14:37:16,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:16,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:16,053 INFO L87 Difference]: Start difference. First operand 951 states and 1427 transitions. Second operand 4 states. [2019-12-07 14:37:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:16,304 INFO L93 Difference]: Finished difference Result 1929 states and 2897 transitions. [2019-12-07 14:37:16,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:16,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 14:37:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:16,305 INFO L225 Difference]: With dead ends: 1929 [2019-12-07 14:37:16,305 INFO L226 Difference]: Without dead ends: 997 [2019-12-07 14:37:16,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:16,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-12-07 14:37:16,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 951. [2019-12-07 14:37:16,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-07 14:37:16,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1425 transitions. [2019-12-07 14:37:16,332 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1425 transitions. Word has length 164 [2019-12-07 14:37:16,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:16,332 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 1425 transitions. [2019-12-07 14:37:16,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1425 transitions. [2019-12-07 14:37:16,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 14:37:16,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:16,333 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:16,333 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:16,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:16,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1218565406, now seen corresponding path program 1 times [2019-12-07 14:37:16,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:16,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930930132] [2019-12-07 14:37:16,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:16,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930930132] [2019-12-07 14:37:16,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700995780] [2019-12-07 14:37:16,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/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-12-07 14:37:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:16,657 INFO L264 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 14:37:16,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:37:16,750 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 14:37:16,751 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,777 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 14:37:16,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:37:16,807 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:16,839 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:16,840 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,853 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,874 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:16,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:16,875 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,884 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,884 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 14:37:16,918 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:16,919 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:16,919 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,926 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:16,953 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:16,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:16,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:16,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:16,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:16,962 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 14:37:16,965 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:16,975 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:17,009 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:37:17,009 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:37:17,010 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:17,017 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:17,017 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:17,017 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:37:17,044 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:17,044 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:17,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:17,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:17,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:17,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:17,071 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:17,071 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:17,072 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:17,077 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:17,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:17,078 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:17,083 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 14:37:17,086 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:17,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 14:37:17,087 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:17,095 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:17,210 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 14:37:17,211 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 14:37:17,211 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-12-07 14:37:17,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:17,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:17,567 INFO L534 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-12-07 14:37:19,305 WARN L192 SmtUtils]: Spent 1.74 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-12-07 14:37:19,306 INFO L614 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-12-07 14:37:19,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:19,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 14:37:19,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:19,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:19,321 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-12-07 14:37:19,321 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-12-07 14:37:21,536 WARN L192 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-12-07 14:37:21,540 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 14:37:21,541 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:21,555 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:21,678 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 14:37:21,679 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 14:37:21,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-12-07 14:37:21,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,680 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:21,707 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 14:37:21,708 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:21,708 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 14:37:21,727 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 14:37:21,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:37:21,730 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:21,747 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:21,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:21,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:21,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:21,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:21,752 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:21,753 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:21,856 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 14:37:21,856 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 14:37:21,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-12-07 14:37:21,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:21,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:21,861 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:21,988 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2019-12-07 14:37:21,988 INFO L614 ElimStorePlain]: treesize reduction 7769, result has 1.1 percent of original size [2019-12-07 14:37:21,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:21,989 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 14:37:22,012 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 14:37:22,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 14:37:22,015 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:22,028 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:22,031 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-12-07 14:37:22,031 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:22,043 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:22,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:22,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:22,046 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:22,080 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:22,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-12-07 14:37:22,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:22,157 INFO L534 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 16 xjuncts. [2019-12-07 14:37:24,620 WARN L192 SmtUtils]: Spent 2.46 s on a formula simplification that was a NOOP. DAG size: 1002 [2019-12-07 14:37:24,621 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:24,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:37:24,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:37:24,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:24,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:24,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 14:37:24,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 14:37:24,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:37:24,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:37:24,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 14:37:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 14:37:24,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:24,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 14:37:24,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:24,663 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:24,664 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1761 [2019-12-07 14:37:25,449 WARN L192 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 1263 DAG size of output: 22 [2019-12-07 14:37:25,459 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:37:25,460 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 14:37:25,460 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:25,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:25,466 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:25,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 14:37:25,497 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 14:37:25,497 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 14:37:25,497 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:25,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:25,500 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:25,501 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 14:37:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:37:25,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:37:25,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-12-07 14:37:25,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387921868] [2019-12-07 14:37:25,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 14:37:25,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:25,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 14:37:25,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 14:37:25,691 INFO L87 Difference]: Start difference. First operand 951 states and 1425 transitions. Second operand 13 states. [2019-12-07 14:37:28,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:28,504 INFO L93 Difference]: Finished difference Result 3573 states and 5330 transitions. [2019-12-07 14:37:28,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 14:37:28,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 164 [2019-12-07 14:37:28,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:28,510 INFO L225 Difference]: With dead ends: 3573 [2019-12-07 14:37:28,510 INFO L226 Difference]: Without dead ends: 2641 [2019-12-07 14:37:28,511 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 165 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-07 14:37:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2019-12-07 14:37:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 1773. [2019-12-07 14:37:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-07 14:37:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2657 transitions. [2019-12-07 14:37:28,587 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2657 transitions. Word has length 164 [2019-12-07 14:37:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:28,588 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2657 transitions. [2019-12-07 14:37:28,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 14:37:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2657 transitions. [2019-12-07 14:37:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 14:37:28,589 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:28,589 INFO L410 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] [2019-12-07 14:37:28,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:37:28,791 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:28,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:28,791 INFO L82 PathProgramCache]: Analyzing trace with hash -441914768, now seen corresponding path program 1 times [2019-12-07 14:37:28,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:28,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418623952] [2019-12-07 14:37:28,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:28,869 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:28,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418623952] [2019-12-07 14:37:28,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:28,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:28,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758197947] [2019-12-07 14:37:28,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:28,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:28,870 INFO L87 Difference]: Start difference. First operand 1773 states and 2657 transitions. Second operand 4 states. [2019-12-07 14:37:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:29,211 INFO L93 Difference]: Finished difference Result 2833 states and 4236 transitions. [2019-12-07 14:37:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:29,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 170 [2019-12-07 14:37:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:29,214 INFO L225 Difference]: With dead ends: 2833 [2019-12-07 14:37:29,214 INFO L226 Difference]: Without dead ends: 1901 [2019-12-07 14:37:29,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-07 14:37:29,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1773. [2019-12-07 14:37:29,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-07 14:37:29,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2653 transitions. [2019-12-07 14:37:29,274 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2653 transitions. Word has length 170 [2019-12-07 14:37:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:29,274 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2653 transitions. [2019-12-07 14:37:29,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:29,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2653 transitions. [2019-12-07 14:37:29,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-12-07 14:37:29,275 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:29,275 INFO L410 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] [2019-12-07 14:37:29,275 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:29,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:29,275 INFO L82 PathProgramCache]: Analyzing trace with hash -401389033, now seen corresponding path program 1 times [2019-12-07 14:37:29,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:29,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299622576] [2019-12-07 14:37:29,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:29,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:29,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299622576] [2019-12-07 14:37:29,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:29,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:29,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365963417] [2019-12-07 14:37:29,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:29,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:29,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:29,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:29,320 INFO L87 Difference]: Start difference. First operand 1773 states and 2653 transitions. Second operand 4 states. [2019-12-07 14:37:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:29,737 INFO L93 Difference]: Finished difference Result 2833 states and 4230 transitions. [2019-12-07 14:37:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:29,738 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-12-07 14:37:29,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:29,740 INFO L225 Difference]: With dead ends: 2833 [2019-12-07 14:37:29,740 INFO L226 Difference]: Without dead ends: 1901 [2019-12-07 14:37:29,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:29,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-07 14:37:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1773. [2019-12-07 14:37:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-07 14:37:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2649 transitions. [2019-12-07 14:37:29,810 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2649 transitions. Word has length 171 [2019-12-07 14:37:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:29,811 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2649 transitions. [2019-12-07 14:37:29,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2649 transitions. [2019-12-07 14:37:29,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 14:37:29,812 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:29,812 INFO L410 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] [2019-12-07 14:37:29,812 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:29,812 INFO L82 PathProgramCache]: Analyzing trace with hash -766860437, now seen corresponding path program 1 times [2019-12-07 14:37:29,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:29,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138259540] [2019-12-07 14:37:29,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:29,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138259540] [2019-12-07 14:37:29,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:29,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:29,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778992191] [2019-12-07 14:37:29,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:29,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:29,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:29,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:29,864 INFO L87 Difference]: Start difference. First operand 1773 states and 2649 transitions. Second operand 4 states. [2019-12-07 14:37:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:30,223 INFO L93 Difference]: Finished difference Result 2833 states and 4224 transitions. [2019-12-07 14:37:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:30,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 14:37:30,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:30,225 INFO L225 Difference]: With dead ends: 2833 [2019-12-07 14:37:30,225 INFO L226 Difference]: Without dead ends: 1901 [2019-12-07 14:37:30,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1901 states. [2019-12-07 14:37:30,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1901 to 1773. [2019-12-07 14:37:30,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-07 14:37:30,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2645 transitions. [2019-12-07 14:37:30,297 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2645 transitions. Word has length 172 [2019-12-07 14:37:30,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:30,297 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2645 transitions. [2019-12-07 14:37:30,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:30,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2645 transitions. [2019-12-07 14:37:30,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 14:37:30,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:30,298 INFO L410 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] [2019-12-07 14:37:30,298 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:30,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:30,298 INFO L82 PathProgramCache]: Analyzing trace with hash -833341262, now seen corresponding path program 1 times [2019-12-07 14:37:30,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:30,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265121529] [2019-12-07 14:37:30,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:30,348 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:30,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265121529] [2019-12-07 14:37:30,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:30,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 14:37:30,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632290345] [2019-12-07 14:37:30,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:30,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:30,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:30,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:30,349 INFO L87 Difference]: Start difference. First operand 1773 states and 2645 transitions. Second operand 4 states. [2019-12-07 14:37:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:30,698 INFO L93 Difference]: Finished difference Result 2813 states and 4194 transitions. [2019-12-07 14:37:30,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:30,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 14:37:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:30,699 INFO L225 Difference]: With dead ends: 2813 [2019-12-07 14:37:30,699 INFO L226 Difference]: Without dead ends: 1881 [2019-12-07 14:37:30,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:30,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2019-12-07 14:37:30,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1773. [2019-12-07 14:37:30,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-07 14:37:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2641 transitions. [2019-12-07 14:37:30,757 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2641 transitions. Word has length 173 [2019-12-07 14:37:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:30,757 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 2641 transitions. [2019-12-07 14:37:30,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2641 transitions. [2019-12-07 14:37:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-12-07 14:37:30,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:30,758 INFO L410 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] [2019-12-07 14:37:30,758 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:30,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:30,759 INFO L82 PathProgramCache]: Analyzing trace with hash 818433459, now seen corresponding path program 1 times [2019-12-07 14:37:30,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:30,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723553899] [2019-12-07 14:37:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:30,834 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 14:37:30,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723553899] [2019-12-07 14:37:30,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:30,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:37:30,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801438757] [2019-12-07 14:37:30,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:37:30,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:30,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:37:30,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:30,835 INFO L87 Difference]: Start difference. First operand 1773 states and 2641 transitions. Second operand 5 states. [2019-12-07 14:37:31,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:31,240 INFO L93 Difference]: Finished difference Result 4043 states and 6075 transitions. [2019-12-07 14:37:31,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:31,241 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-12-07 14:37:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:31,242 INFO L225 Difference]: With dead ends: 4043 [2019-12-07 14:37:31,242 INFO L226 Difference]: Without dead ends: 2289 [2019-12-07 14:37:31,243 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:37:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2019-12-07 14:37:31,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1931. [2019-12-07 14:37:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1931 states. [2019-12-07 14:37:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2927 transitions. [2019-12-07 14:37:31,304 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2927 transitions. Word has length 176 [2019-12-07 14:37:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:31,304 INFO L462 AbstractCegarLoop]: Abstraction has 1931 states and 2927 transitions. [2019-12-07 14:37:31,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:37:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2927 transitions. [2019-12-07 14:37:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 14:37:31,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:31,305 INFO L410 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] [2019-12-07 14:37:31,305 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:31,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:31,306 INFO L82 PathProgramCache]: Analyzing trace with hash -406150069, now seen corresponding path program 1 times [2019-12-07 14:37:31,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:31,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703522627] [2019-12-07 14:37:31,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 14:37:31,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703522627] [2019-12-07 14:37:31,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:31,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 14:37:31,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652507180] [2019-12-07 14:37:31,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:37:31,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:37:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 14:37:31,383 INFO L87 Difference]: Start difference. First operand 1931 states and 2927 transitions. Second operand 5 states. [2019-12-07 14:37:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:31,789 INFO L93 Difference]: Finished difference Result 4247 states and 6465 transitions. [2019-12-07 14:37:31,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:31,789 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 177 [2019-12-07 14:37:31,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:31,791 INFO L225 Difference]: With dead ends: 4247 [2019-12-07 14:37:31,791 INFO L226 Difference]: Without dead ends: 2335 [2019-12-07 14:37:31,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:37:31,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-07 14:37:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 2039. [2019-12-07 14:37:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-12-07 14:37:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 3147 transitions. [2019-12-07 14:37:31,862 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 3147 transitions. Word has length 177 [2019-12-07 14:37:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:31,863 INFO L462 AbstractCegarLoop]: Abstraction has 2039 states and 3147 transitions. [2019-12-07 14:37:31,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:37:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 3147 transitions. [2019-12-07 14:37:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 14:37:31,864 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:31,864 INFO L410 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] [2019-12-07 14:37:31,864 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1660399470, now seen corresponding path program 1 times [2019-12-07 14:37:31,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:31,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111250864] [2019-12-07 14:37:31,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:31,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:32,062 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:32,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111250864] [2019-12-07 14:37:32,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1025964708] [2019-12-07 14:37:32,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:37:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:32,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 14:37:32,194 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:37:32,224 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,224 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 14:37:32,225 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,259 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,260 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-12-07 14:37:32,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:37:32,281 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:32,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:32,310 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,342 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:32,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:32,343 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,353 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,353 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 14:37:32,384 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:32,385 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:32,385 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,390 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,390 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,390 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:32,411 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:32,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:32,411 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,416 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:32,418 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-12-07 14:37:32,420 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:32,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,464 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:37:32,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:37:32,465 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,475 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,475 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,475 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:37:32,501 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:32,501 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:32,501 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:32,528 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:32,528 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:32,528 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,533 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,533 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,534 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:32,537 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 12=[|v_#memory_$Pointer$.base_183|]} [2019-12-07 14:37:32,538 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:32,549 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,581 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:37:32,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:37:32,581 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,588 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,588 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:37:32,593 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_181|], 2=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_184|]} [2019-12-07 14:37:32,596 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 14:37:32,596 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,609 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,612 INFO L377 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 120 treesize of output 92 [2019-12-07 14:37:32,612 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,622 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,696 INFO L343 Elim1Store]: treesize reduction 36, result has 84.9 percent of original size [2019-12-07 14:37:32,697 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 263 [2019-12-07 14:37:32,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:32,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:32,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:32,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:32,700 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,768 INFO L614 ElimStorePlain]: treesize reduction 1074, result has 6.4 percent of original size [2019-12-07 14:37:32,768 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,768 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:182, output treesize:74 [2019-12-07 14:37:32,786 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-12-07 14:37:32,786 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:32,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 7 [2019-12-07 14:37:32,797 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:32,803 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:32,803 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:56 [2019-12-07 14:37:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 14:37:32,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 14:37:32,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 14:37:32,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544131125] [2019-12-07 14:37:32,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 14:37:32,917 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:32,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 14:37:32,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:37:32,917 INFO L87 Difference]: Start difference. First operand 2039 states and 3147 transitions. Second operand 5 states. [2019-12-07 14:37:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:33,772 INFO L93 Difference]: Finished difference Result 5089 states and 7830 transitions. [2019-12-07 14:37:33,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:37:33,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-12-07 14:37:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:33,774 INFO L225 Difference]: With dead ends: 5089 [2019-12-07 14:37:33,774 INFO L226 Difference]: Without dead ends: 3069 [2019-12-07 14:37:33,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:37:33,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-12-07 14:37:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2043. [2019-12-07 14:37:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-12-07 14:37:33,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 3151 transitions. [2019-12-07 14:37:33,841 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 3151 transitions. Word has length 190 [2019-12-07 14:37:33,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:33,841 INFO L462 AbstractCegarLoop]: Abstraction has 2043 states and 3151 transitions. [2019-12-07 14:37:33,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 14:37:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 3151 transitions. [2019-12-07 14:37:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 14:37:33,842 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:33,842 INFO L410 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] [2019-12-07 14:37:34,043 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:37:34,043 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:34,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:34,043 INFO L82 PathProgramCache]: Analyzing trace with hash 601173780, now seen corresponding path program 1 times [2019-12-07 14:37:34,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:34,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805643952] [2019-12-07 14:37:34,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:34,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:34,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805643952] [2019-12-07 14:37:34,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78077880] [2019-12-07 14:37:34,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:37:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:34,386 INFO L264 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 14:37:34,392 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:37:34,418 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 14:37:34,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,452 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_192|], 2=[|v_#memory_$Pointer$.base_186|, |v_#memory_$Pointer$.base_185|]} [2019-12-07 14:37:34,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:37:34,476 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:34,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:34,503 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,536 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:34,536 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:34,536 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,545 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,545 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 14:37:34,576 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:34,577 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:34,577 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,583 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,583 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:34,606 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:34,607 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:34,607 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,612 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,612 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:34,614 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 12=[|v_#memory_$Pointer$.base_195|]} [2019-12-07 14:37:34,615 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:34,626 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,658 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:37:34,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:37:34,659 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,665 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,666 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:37:34,686 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:34,687 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:34,687 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,692 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,692 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:34,712 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 14:37:34,712 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 14:37:34,712 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,718 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,718 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,718 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 14:37:34,721 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_188|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-12-07 14:37:34,722 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:34,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,768 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:37:34,769 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:37:34,769 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,775 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:37:34,778 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 14:37:34,780 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 14:37:34,780 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:34,790 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,869 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 14:37:34,870 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 14:37:34,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:34,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:34,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:34,872 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,897 INFO L614 ElimStorePlain]: treesize reduction 139, result has 27.6 percent of original size [2019-12-07 14:37:34,897 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,897 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 14:37:34,899 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_189|], 12=[|v_#memory_$Pointer$.base_200|]} [2019-12-07 14:37:34,900 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:34,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,964 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 14:37:34,964 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 14:37:34,965 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:34,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:34,974 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 14:37:34,979 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_201|]} [2019-12-07 14:37:34,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 14:37:34,982 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:34,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,064 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 14:37:35,064 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 14:37:35,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,069 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 14:37:35,121 INFO L614 ElimStorePlain]: treesize reduction 619, result has 7.9 percent of original size [2019-12-07 14:37:35,121 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,121 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 14:37:35,123 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_191|, |v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_190|], 12=[|v_#memory_$Pointer$.base_202|]} [2019-12-07 14:37:35,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,132 INFO L377 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-12-07 14:37:35,132 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,185 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,191 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 14:37:35,191 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,238 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,240 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:35,277 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 88 [2019-12-07 14:37:35,285 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,312 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,314 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:35,339 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-12-07 14:37:35,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-12-07 14:37:35,354 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,371 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,377 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,378 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,463 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 14:37:35,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-12-07 14:37:35,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:37:35,465 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,493 INFO L614 ElimStorePlain]: treesize reduction 48, result has 68.4 percent of original size [2019-12-07 14:37:35,493 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,511 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,511 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 14:37:35,541 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 6=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_int_183|]} [2019-12-07 14:37:35,544 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 14:37:35,545 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:35,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,564 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:37:35,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-12-07 14:37:35,565 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:35,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,579 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 14:37:35,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:37:35,579 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:35,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:35,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:35,585 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-12-07 14:37:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:37:35,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:37:35,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 14:37:35,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568368948] [2019-12-07 14:37:35,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 14:37:35,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 14:37:35,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 14:37:35,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 14:37:35,844 INFO L87 Difference]: Start difference. First operand 2043 states and 3151 transitions. Second operand 10 states. [2019-12-07 14:37:37,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:37,875 INFO L93 Difference]: Finished difference Result 5537 states and 8476 transitions. [2019-12-07 14:37:37,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 14:37:37,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 190 [2019-12-07 14:37:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:37,877 INFO L225 Difference]: With dead ends: 5537 [2019-12-07 14:37:37,878 INFO L226 Difference]: Without dead ends: 3513 [2019-12-07 14:37:37,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 14:37:37,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2019-12-07 14:37:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 2355. [2019-12-07 14:37:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2019-12-07 14:37:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 3703 transitions. [2019-12-07 14:37:37,952 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 3703 transitions. Word has length 190 [2019-12-07 14:37:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:37,952 INFO L462 AbstractCegarLoop]: Abstraction has 2355 states and 3703 transitions. [2019-12-07 14:37:37,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 14:37:37,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 3703 transitions. [2019-12-07 14:37:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-12-07 14:37:37,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:37,953 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:38,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:37:38,154 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:38,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:38,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1724885074, now seen corresponding path program 1 times [2019-12-07 14:37:38,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 14:37:38,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025317796] [2019-12-07 14:37:38,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 14:37:38,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:38,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 14:37:38,357 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 14:37:38,357 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:37:38,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:37:38 BoogieIcfgContainer [2019-12-07 14:37:38,473 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:37:38,474 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:37:38,474 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:37:38,474 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:37:38,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:36:39" (3/4) ... [2019-12-07 14:37:38,476 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:37:38,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:37:38,477 INFO L168 Benchmark]: Toolchain (without parser) took 60396.13 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 532.7 MB). Free memory was 936.0 MB in the beginning and 1.0 GB in the end (delta: -108.4 MB). Peak memory consumption was 424.3 MB. Max. memory is 11.5 GB. [2019-12-07 14:37:38,477 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:37:38,478 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:37:38,478 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:37:38,478 INFO L168 Benchmark]: Boogie Preprocessor took 53.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:37:38,478 INFO L168 Benchmark]: RCFGBuilder took 681.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.1 MB in the end (delta: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. [2019-12-07 14:37:38,479 INFO L168 Benchmark]: TraceAbstraction took 59180.76 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 421.5 MB). Free memory was 975.1 MB in the beginning and 1.0 GB in the end (delta: -69.3 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:37:38,479 INFO L168 Benchmark]: Witness Printer took 2.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:37:38,480 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.1 MB). Free memory was 936.0 MB in the beginning and 1.1 GB in the end (delta: -146.9 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.20 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 681.78 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 975.1 MB in the end (delta: 97.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 59180.76 ms. Allocated memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: 421.5 MB). Free memory was 975.1 MB in the beginning and 1.0 GB in the end (delta: -69.3 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.87 ms. Allocated memory is still 1.6 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1738]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1590] EXPR s->session [L1590] EXPR s->s3 [L1590] EXPR (s->s3)->tmp.new_cipher [L1590] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1591] COND FALSE !(! tmp___9) [L1597] ret = __VERIFIER_nondet_int() [L1598] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1603] COND FALSE !(ret <= 0) [L1608] s->state = 8672 [L1609] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1610] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1619] ret = __VERIFIER_nondet_int() [L1620] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1625] COND FALSE !(ret <= 0) [L1630] s->state = 8448 [L1631] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1631] COND TRUE s->hit [L1632] EXPR s->s3 [L1632] (s->s3)->tmp.next_state = 8640 [L1636] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1738] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 59.0s, OverallIterations: 120, TraceHistogramMax: 7, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 26478 SDtfs, 9678 SDslu, 41637 SDs, 0 SdLazy, 27979 SolverSat, 1461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1231 GetRequests, 796 SyntacticMatches, 45 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2355occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 119 MinimizatonAttempts, 10558 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 15096 NumberOfCodeBlocks, 15096 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 14781 ConstructedInterpolants, 108 QuantifiedInterpolants, 9794657 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1994 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 122 InterpolantComputations, 117 PerfectInterpolantSequences, 16265/17043 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 14:37:39,860 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 14:37:39,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 14:37:39,869 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 14:37:39,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 14:37:39,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 14:37:39,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 14:37:39,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 14:37:39,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 14:37:39,874 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 14:37:39,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 14:37:39,876 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 14:37:39,876 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 14:37:39,877 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 14:37:39,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 14:37:39,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 14:37:39,878 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 14:37:39,879 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 14:37:39,880 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 14:37:39,882 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 14:37:39,883 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 14:37:39,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 14:37:39,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 14:37:39,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 14:37:39,888 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 14:37:39,888 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 14:37:39,888 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 14:37:39,888 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 14:37:39,889 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 14:37:39,889 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 14:37:39,890 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 14:37:39,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 14:37:39,890 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 14:37:39,891 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 14:37:39,892 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 14:37:39,892 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 14:37:39,892 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 14:37:39,892 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 14:37:39,892 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 14:37:39,893 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 14:37:39,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 14:37:39,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 14:37:39,904 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 14:37:39,904 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 14:37:39,905 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 14:37:39,905 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 14:37:39,905 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 14:37:39,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 14:37:39,906 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 14:37:39,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 14:37:39,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 14:37:39,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 14:37:39,908 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 14:37:39,909 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 14:37:39,909 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_999810dc-8a9b-48c5-8cc0-f3f409a46448/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 -> 8d1c32ee092f2b5f261264054761f302681bc07a [2019-12-07 14:37:40,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 14:37:40,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 14:37:40,081 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 14:37:40,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 14:37:40,082 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 14:37:40,082 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-12-07 14:37:40,119 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/87fef6132/09d8a9ee239a4f0a991b78f24c355735/FLAGb3eb33b40 [2019-12-07 14:37:40,650 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 14:37:40,651 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/sv-benchmarks/c/ssh/s3_srvr.blast.12.i.cil-1.c [2019-12-07 14:37:40,664 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/87fef6132/09d8a9ee239a4f0a991b78f24c355735/FLAGb3eb33b40 [2019-12-07 14:37:41,152 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/data/87fef6132/09d8a9ee239a4f0a991b78f24c355735 [2019-12-07 14:37:41,154 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 14:37:41,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 14:37:41,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 14:37:41,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 14:37:41,158 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 14:37:41,159 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a94c128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41, skipping insertion in model container [2019-12-07 14:37:41,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,166 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 14:37:41,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 14:37:41,477 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:37:41,489 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 14:37:41,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 14:37:41,573 INFO L208 MainTranslator]: Completed translation [2019-12-07 14:37:41,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41 WrapperNode [2019-12-07 14:37:41,573 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 14:37:41,574 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 14:37:41,574 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 14:37:41,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 14:37:41,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,598 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,629 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 14:37:41,629 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 14:37:41,629 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 14:37:41,629 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 14:37:41,636 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,636 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... [2019-12-07 14:37:41,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 14:37:41,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 14:37:41,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 14:37:41,684 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 14:37:41,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/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-12-07 14:37:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 14:37:41,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 14:37:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 14:37:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 14:37:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 14:37:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 14:37:41,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 14:37:41,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 14:37:41,856 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 14:37:43,829 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 14:37:43,829 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 14:37:43,830 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 14:37:43,830 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 14:37:43,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:37:43 BoogieIcfgContainer [2019-12-07 14:37:43,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 14:37:43,832 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 14:37:43,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 14:37:43,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 14:37:43,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 02:37:41" (1/3) ... [2019-12-07 14:37:43,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d20dd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:37:43, skipping insertion in model container [2019-12-07 14:37:43,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 02:37:41" (2/3) ... [2019-12-07 14:37:43,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d20dd49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 02:37:43, skipping insertion in model container [2019-12-07 14:37:43,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:37:43" (3/3) ... [2019-12-07 14:37:43,836 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.12.i.cil-1.c [2019-12-07 14:37:43,843 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 14:37:43,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 14:37:43,855 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 14:37:43,872 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 14:37:43,872 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 14:37:43,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 14:37:43,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 14:37:43,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 14:37:43,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 14:37:43,873 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 14:37:43,873 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 14:37:43,886 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-12-07 14:37:43,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 14:37:43,893 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:43,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:43,894 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:43,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:43,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1126362112, now seen corresponding path program 1 times [2019-12-07 14:37:43,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:37:43,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [307755070] [2019-12-07 14:37:43,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 14:37:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:44,049 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:37:44,055 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:37:44,112 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:37:44,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:37:44,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:44,123 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:44,124 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:44,124 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:37:44,154 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:37:44,154 INFO L377 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 31 treesize of output 24 [2019-12-07 14:37:44,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:44,159 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:44,160 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:44,160 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:37:44,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:37:44,166 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:44,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:44,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:44,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:37:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:44,184 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:37:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:44,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [307755070] [2019-12-07 14:37:44,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:44,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:37:44,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373089820] [2019-12-07 14:37:44,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:37:44,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:37:44,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:37:44,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:37:44,225 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 4 states. [2019-12-07 14:37:46,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:46,712 INFO L93 Difference]: Finished difference Result 327 states and 555 transitions. [2019-12-07 14:37:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:37:46,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 14:37:46,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:46,723 INFO L225 Difference]: With dead ends: 327 [2019-12-07 14:37:46,723 INFO L226 Difference]: Without dead ends: 165 [2019-12-07 14:37:46,725 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 77 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-12-07 14:37:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-12-07 14:37:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2019-12-07 14:37:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-12-07 14:37:46,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 230 transitions. [2019-12-07 14:37:46,758 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 230 transitions. Word has length 41 [2019-12-07 14:37:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:46,758 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 230 transitions. [2019-12-07 14:37:46,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:37:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 230 transitions. [2019-12-07 14:37:46,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-07 14:37:46,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:46,761 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:46,961 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 14:37:46,962 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:46,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:46,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1260614375, now seen corresponding path program 1 times [2019-12-07 14:37:46,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:37:46,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152983348] [2019-12-07 14:37:46,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 14:37:47,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:47,137 INFO L264 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:37:47,140 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:37:47,155 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:37:47,155 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:37:47,155 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:47,163 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:47,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:47,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:37:47,184 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:37:47,184 INFO L377 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 31 treesize of output 24 [2019-12-07 14:37:47,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:47,187 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:47,188 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:47,188 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:37:47,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:37:47,193 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:37:47,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:47,194 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:37:47,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:37:47,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:47,203 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:37:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:37:47,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152983348] [2019-12-07 14:37:47,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:37:47,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:37:47,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331134346] [2019-12-07 14:37:47,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:37:47,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:37:47,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:37:47,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:37:47,238 INFO L87 Difference]: Start difference. First operand 148 states and 230 transitions. Second operand 6 states. [2019-12-07 14:37:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:37:55,266 INFO L93 Difference]: Finished difference Result 415 states and 641 transitions. [2019-12-07 14:37:55,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:37:55,267 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-07 14:37:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:37:55,270 INFO L225 Difference]: With dead ends: 415 [2019-12-07 14:37:55,270 INFO L226 Difference]: Without dead ends: 286 [2019-12-07 14:37:55,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:37:55,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-12-07 14:37:55,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 164. [2019-12-07 14:37:55,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 14:37:55,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 255 transitions. [2019-12-07 14:37:55,286 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 255 transitions. Word has length 54 [2019-12-07 14:37:55,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:37:55,286 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 255 transitions. [2019-12-07 14:37:55,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:37:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 255 transitions. [2019-12-07 14:37:55,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:37:55,288 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:37:55,289 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:37:55,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 14:37:55,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:37:55,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:37:55,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1545467861, now seen corresponding path program 1 times [2019-12-07 14:37:55,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:37:55,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284630701] [2019-12-07 14:37:55,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 14:37:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:37:55,633 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:37:55,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:37:55,640 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 14:37:55,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2019-12-07 14:37:55,645 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:55,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:55,658 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2019-12-07 14:37:55,658 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:37:55,669 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:55,711 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:37:55,711 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 14:37:55,712 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:03,820 WARN L192 SmtUtils]: Spent 8.11 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 14:38:03,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:03,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:03,822 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 14:38:03,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:03,831 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:03,832 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:03,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:03,833 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:38:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:03,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:03,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:03,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284630701] [2019-12-07 14:38:03,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:03,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 14:38:03,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664715700] [2019-12-07 14:38:03,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:38:03,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:03,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:38:03,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:38:03,848 INFO L87 Difference]: Start difference. First operand 164 states and 255 transitions. Second operand 4 states. [2019-12-07 14:38:06,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:06,821 INFO L93 Difference]: Finished difference Result 338 states and 524 transitions. [2019-12-07 14:38:06,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:38:06,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-07 14:38:06,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:06,824 INFO L225 Difference]: With dead ends: 338 [2019-12-07 14:38:06,824 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 14:38:06,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-12-07 14:38:06,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 14:38:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 180. [2019-12-07 14:38:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-12-07 14:38:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 281 transitions. [2019-12-07 14:38:06,832 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 281 transitions. Word has length 55 [2019-12-07 14:38:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:06,832 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 281 transitions. [2019-12-07 14:38:06,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:38:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 281 transitions. [2019-12-07 14:38:06,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:38:06,834 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:06,834 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:07,034 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 14:38:07,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:07,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:07,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1613297430, now seen corresponding path program 1 times [2019-12-07 14:38:07,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:07,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594573426] [2019-12-07 14:38:07,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:07,198 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:38:07,200 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:07,219 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:38:07,219 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:38:07,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:07,229 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:07,229 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:07,229 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:38:07,249 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:38:07,250 INFO L377 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 31 treesize of output 24 [2019-12-07 14:38:07,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:07,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:07,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:07,253 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:38:07,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:07,257 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:07,258 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:07,259 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:07,259 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:38:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:07,267 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:07,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594573426] [2019-12-07 14:38:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998125364] [2019-12-07 14:38:07,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:07,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:07,296 INFO L87 Difference]: Start difference. First operand 180 states and 281 transitions. Second operand 6 states. [2019-12-07 14:38:12,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:12,361 INFO L93 Difference]: Finished difference Result 461 states and 715 transitions. [2019-12-07 14:38:12,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:12,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 14:38:12,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:12,363 INFO L225 Difference]: With dead ends: 461 [2019-12-07 14:38:12,363 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 14:38:12,364 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:12,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 14:38:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 181. [2019-12-07 14:38:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-12-07 14:38:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 281 transitions. [2019-12-07 14:38:12,370 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 281 transitions. Word has length 55 [2019-12-07 14:38:12,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:12,370 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 281 transitions. [2019-12-07 14:38:12,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:12,370 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 281 transitions. [2019-12-07 14:38:12,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 14:38:12,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:12,372 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:12,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 14:38:12,573 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash 877952598, now seen corresponding path program 1 times [2019-12-07 14:38:12,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:12,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [33515897] [2019-12-07 14:38:12,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:12,683 INFO L264 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:38:12,685 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:12,688 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:38:12,689 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:12,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:12,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:12,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:38:12,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:12,701 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:12,703 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:12,703 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:12,703 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:38:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:12,712 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:12,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [33515897] [2019-12-07 14:38:12,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:12,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:12,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035120536] [2019-12-07 14:38:12,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:12,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:12,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:12,733 INFO L87 Difference]: Start difference. First operand 181 states and 281 transitions. Second operand 6 states. [2019-12-07 14:38:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:18,161 INFO L93 Difference]: Finished difference Result 571 states and 887 transitions. [2019-12-07 14:38:18,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:18,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-07 14:38:18,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:18,164 INFO L225 Difference]: With dead ends: 571 [2019-12-07 14:38:18,164 INFO L226 Difference]: Without dead ends: 409 [2019-12-07 14:38:18,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:18,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-12-07 14:38:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 221. [2019-12-07 14:38:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-12-07 14:38:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 352 transitions. [2019-12-07 14:38:18,174 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 352 transitions. Word has length 55 [2019-12-07 14:38:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:18,174 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 352 transitions. [2019-12-07 14:38:18,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:18,174 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 352 transitions. [2019-12-07 14:38:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 14:38:18,175 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:18,175 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:18,376 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 14:38:18,377 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:18,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:18,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1438943240, now seen corresponding path program 1 times [2019-12-07 14:38:18,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:18,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71299961] [2019-12-07 14:38:18,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:18,506 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:38:18,508 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:18,511 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:38:18,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:18,514 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:18,514 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:18,514 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:38:18,522 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:18,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:18,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:18,524 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:18,524 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:38:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:18,535 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:18,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71299961] [2019-12-07 14:38:18,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:18,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:18,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138194315] [2019-12-07 14:38:18,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:18,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:18,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:18,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:18,556 INFO L87 Difference]: Start difference. First operand 221 states and 352 transitions. Second operand 6 states. [2019-12-07 14:38:26,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:26,443 INFO L93 Difference]: Finished difference Result 627 states and 993 transitions. [2019-12-07 14:38:26,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:26,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 14:38:26,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:26,447 INFO L225 Difference]: With dead ends: 627 [2019-12-07 14:38:26,447 INFO L226 Difference]: Without dead ends: 425 [2019-12-07 14:38:26,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2019-12-07 14:38:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 244. [2019-12-07 14:38:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-12-07 14:38:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 397 transitions. [2019-12-07 14:38:26,456 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 397 transitions. Word has length 56 [2019-12-07 14:38:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:26,457 INFO L462 AbstractCegarLoop]: Abstraction has 244 states and 397 transitions. [2019-12-07 14:38:26,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:26,457 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 397 transitions. [2019-12-07 14:38:26,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 14:38:26,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:26,458 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:26,658 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 14:38:26,659 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1619265186, now seen corresponding path program 1 times [2019-12-07 14:38:26,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:26,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649126213] [2019-12-07 14:38:26,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:26,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:26,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:38:26,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:26,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:38:26,763 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:26,765 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:26,766 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:26,766 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:38:26,773 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:26,774 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:26,775 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:26,775 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:26,776 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:38:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:26,787 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:26,810 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:26,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649126213] [2019-12-07 14:38:26,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:26,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:26,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776147996] [2019-12-07 14:38:26,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:26,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:26,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:26,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:26,811 INFO L87 Difference]: Start difference. First operand 244 states and 397 transitions. Second operand 6 states. [2019-12-07 14:38:31,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:31,754 INFO L93 Difference]: Finished difference Result 723 states and 1170 transitions. [2019-12-07 14:38:31,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:31,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-12-07 14:38:31,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:31,757 INFO L225 Difference]: With dead ends: 723 [2019-12-07 14:38:31,757 INFO L226 Difference]: Without dead ends: 498 [2019-12-07 14:38:31,758 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:31,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-12-07 14:38:31,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 308. [2019-12-07 14:38:31,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-12-07 14:38:31,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 509 transitions. [2019-12-07 14:38:31,764 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 509 transitions. Word has length 84 [2019-12-07 14:38:31,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:31,765 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 509 transitions. [2019-12-07 14:38:31,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 509 transitions. [2019-12-07 14:38:31,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-12-07 14:38:31,766 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:31,766 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:31,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 14:38:31,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash -730310649, now seen corresponding path program 1 times [2019-12-07 14:38:31,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:31,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714183488] [2019-12-07 14:38:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:32,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:38:32,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:32,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:38:32,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:32,090 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:32,090 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:32,090 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:38:32,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:32,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:32,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:32,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:32,101 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:38:32,118 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:32,118 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:32,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714183488] [2019-12-07 14:38:32,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266174299] [2019-12-07 14:38:32,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:32,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:32,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:32,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:32,151 INFO L87 Difference]: Start difference. First operand 308 states and 509 transitions. Second operand 6 states. [2019-12-07 14:38:38,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:38,868 INFO L93 Difference]: Finished difference Result 815 states and 1325 transitions. [2019-12-07 14:38:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:38,869 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-12-07 14:38:38,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:38,872 INFO L225 Difference]: With dead ends: 815 [2019-12-07 14:38:38,873 INFO L226 Difference]: Without dead ends: 526 [2019-12-07 14:38:38,873 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:38,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-12-07 14:38:38,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 345. [2019-12-07 14:38:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 14:38:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 573 transitions. [2019-12-07 14:38:38,887 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 573 transitions. Word has length 90 [2019-12-07 14:38:38,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:38,887 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 573 transitions. [2019-12-07 14:38:38,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:38,887 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 573 transitions. [2019-12-07 14:38:38,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-12-07 14:38:38,889 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:38,889 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:39,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 14:38:39,091 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:39,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:39,092 INFO L82 PathProgramCache]: Analyzing trace with hash 694048885, now seen corresponding path program 1 times [2019-12-07 14:38:39,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:39,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340940502] [2019-12-07 14:38:39,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:39,235 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:38:39,237 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:39,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:38:39,240 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:39,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:39,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:39,243 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:38:39,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:39,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:39,254 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:39,254 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:39,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:38:39,267 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:39,267 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:38:39,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340940502] [2019-12-07 14:38:39,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:39,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:39,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979683932] [2019-12-07 14:38:39,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:39,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:39,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:39,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:39,292 INFO L87 Difference]: Start difference. First operand 345 states and 573 transitions. Second operand 6 states. [2019-12-07 14:38:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:46,792 INFO L93 Difference]: Finished difference Result 846 states and 1378 transitions. [2019-12-07 14:38:46,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:46,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-12-07 14:38:46,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:46,794 INFO L225 Difference]: With dead ends: 846 [2019-12-07 14:38:46,795 INFO L226 Difference]: Without dead ends: 520 [2019-12-07 14:38:46,795 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-12-07 14:38:46,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 345. [2019-12-07 14:38:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 14:38:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 571 transitions. [2019-12-07 14:38:46,805 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 571 transitions. Word has length 91 [2019-12-07 14:38:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:46,805 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 571 transitions. [2019-12-07 14:38:46,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 571 transitions. [2019-12-07 14:38:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:38:46,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:46,807 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:47,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 14:38:47,008 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:47,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash -319349786, now seen corresponding path program 1 times [2019-12-07 14:38:47,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:47,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429904599] [2019-12-07 14:38:47,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:47,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:47,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:38:47,217 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:47,232 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:38:47,232 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:38:47,232 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:47,240 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:47,241 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:47,241 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:38:47,259 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:38:47,260 INFO L377 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 31 treesize of output 24 [2019-12-07 14:38:47,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:47,263 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:47,263 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:47,263 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:38:47,266 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:47,266 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:47,268 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:47,268 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:47,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:38:47,277 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:38:47,278 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:47,308 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:38:47,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429904599] [2019-12-07 14:38:47,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:47,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:47,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784346781] [2019-12-07 14:38:47,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:47,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:47,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:47,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:47,309 INFO L87 Difference]: Start difference. First operand 345 states and 571 transitions. Second operand 6 states. [2019-12-07 14:38:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:52,305 INFO L93 Difference]: Finished difference Result 765 states and 1246 transitions. [2019-12-07 14:38:52,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:52,306 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-07 14:38:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:52,307 INFO L225 Difference]: With dead ends: 765 [2019-12-07 14:38:52,308 INFO L226 Difference]: Without dead ends: 439 [2019-12-07 14:38:52,308 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-07 14:38:52,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 345. [2019-12-07 14:38:52,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 14:38:52,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 564 transitions. [2019-12-07 14:38:52,314 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 564 transitions. Word has length 97 [2019-12-07 14:38:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:52,314 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 564 transitions. [2019-12-07 14:38:52,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:52,315 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 564 transitions. [2019-12-07 14:38:52,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 14:38:52,315 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:52,315 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:52,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 14:38:52,516 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:52,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1274795130, now seen corresponding path program 1 times [2019-12-07 14:38:52,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:52,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [137756176] [2019-12-07 14:38:52,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:52,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:38:52,764 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:52,777 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:38:52,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:38:52,777 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:52,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:52,786 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:52,786 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:38:52,806 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:38:52,807 INFO L377 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 31 treesize of output 24 [2019-12-07 14:38:52,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:52,811 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:52,811 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:52,811 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:38:52,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:52,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:52,816 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:52,816 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:52,816 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:38:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:38:52,826 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:38:52,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [137756176] [2019-12-07 14:38:52,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:52,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:52,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977020242] [2019-12-07 14:38:52,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:52,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:52,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:52,858 INFO L87 Difference]: Start difference. First operand 345 states and 564 transitions. Second operand 6 states. [2019-12-07 14:38:57,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:38:57,045 INFO L93 Difference]: Finished difference Result 765 states and 1233 transitions. [2019-12-07 14:38:57,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:38:57,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-07 14:38:57,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:38:57,047 INFO L225 Difference]: With dead ends: 765 [2019-12-07 14:38:57,047 INFO L226 Difference]: Without dead ends: 439 [2019-12-07 14:38:57,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:38:57,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-07 14:38:57,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 345. [2019-12-07 14:38:57,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 14:38:57,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 557 transitions. [2019-12-07 14:38:57,054 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 557 transitions. Word has length 97 [2019-12-07 14:38:57,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:38:57,054 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 557 transitions. [2019-12-07 14:38:57,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:38:57,054 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 557 transitions. [2019-12-07 14:38:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:38:57,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:38:57,055 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:38:57,256 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 14:38:57,256 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:38:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:38:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash 48194845, now seen corresponding path program 1 times [2019-12-07 14:38:57,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:38:57,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1285638917] [2019-12-07 14:38:57,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 14:38:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:38:57,467 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:38:57,469 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:38:57,483 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:38:57,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:38:57,484 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:57,491 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:57,491 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:57,492 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:38:57,510 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:38:57,510 INFO L377 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 31 treesize of output 24 [2019-12-07 14:38:57,511 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:57,513 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:57,513 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:57,513 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:38:57,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:38:57,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:38:57,517 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:38:57,517 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:38:57,517 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:38:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:38:57,527 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:38:57,555 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:38:57,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1285638917] [2019-12-07 14:38:57,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:38:57,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:38:57,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882606292] [2019-12-07 14:38:57,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:38:57,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:38:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:38:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:38:57,556 INFO L87 Difference]: Start difference. First operand 345 states and 557 transitions. Second operand 6 states. [2019-12-07 14:39:03,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:03,397 INFO L93 Difference]: Finished difference Result 765 states and 1220 transitions. [2019-12-07 14:39:03,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:03,398 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 14:39:03,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:03,399 INFO L225 Difference]: With dead ends: 765 [2019-12-07 14:39:03,400 INFO L226 Difference]: Without dead ends: 439 [2019-12-07 14:39:03,400 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 189 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2019-12-07 14:39:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 345. [2019-12-07 14:39:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-07 14:39:03,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 550 transitions. [2019-12-07 14:39:03,406 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 550 transitions. Word has length 98 [2019-12-07 14:39:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:03,406 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 550 transitions. [2019-12-07 14:39:03,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 550 transitions. [2019-12-07 14:39:03,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 14:39:03,407 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:03,407 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:03,607 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 14:39:03,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:03,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:03,609 INFO L82 PathProgramCache]: Analyzing trace with hash 240606234, now seen corresponding path program 1 times [2019-12-07 14:39:03,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:03,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1012738455] [2019-12-07 14:39:03,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:03,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:39:03,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:03,771 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:39:03,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:03,774 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:03,774 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:03,774 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:39:03,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:03,782 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:03,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:03,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:03,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:39:03,797 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:39:03,797 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:39:03,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1012738455] [2019-12-07 14:39:03,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:03,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:03,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115599936] [2019-12-07 14:39:03,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:03,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:03,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:03,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:03,824 INFO L87 Difference]: Start difference. First operand 345 states and 550 transitions. Second operand 6 states. [2019-12-07 14:39:12,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:12,959 INFO L93 Difference]: Finished difference Result 884 states and 1394 transitions. [2019-12-07 14:39:12,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:12,960 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-07 14:39:12,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:12,962 INFO L225 Difference]: With dead ends: 884 [2019-12-07 14:39:12,962 INFO L226 Difference]: Without dead ends: 558 [2019-12-07 14:39:12,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:12,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2019-12-07 14:39:12,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 388. [2019-12-07 14:39:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-07 14:39:12,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 620 transitions. [2019-12-07 14:39:12,972 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 620 transitions. Word has length 98 [2019-12-07 14:39:12,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:12,972 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 620 transitions. [2019-12-07 14:39:12,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 620 transitions. [2019-12-07 14:39:12,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:39:12,973 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:12,973 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:13,174 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 14:39:13,174 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:13,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1360084767, now seen corresponding path program 1 times [2019-12-07 14:39:13,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:13,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378830845] [2019-12-07 14:39:13,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:13,416 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:39:13,417 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:13,432 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:39:13,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:39:13,432 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:13,440 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:13,440 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:13,440 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:39:13,462 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:39:13,463 INFO L377 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 31 treesize of output 24 [2019-12-07 14:39:13,463 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:13,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:13,465 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:13,466 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:39:13,468 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:13,468 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:13,470 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:13,470 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:13,470 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:39:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:39:13,480 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:13,511 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:39:13,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378830845] [2019-12-07 14:39:13,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:13,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:13,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844161781] [2019-12-07 14:39:13,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:13,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:13,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:13,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:13,512 INFO L87 Difference]: Start difference. First operand 388 states and 620 transitions. Second operand 6 states. [2019-12-07 14:39:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:21,525 INFO L93 Difference]: Finished difference Result 851 states and 1347 transitions. [2019-12-07 14:39:21,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:21,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 14:39:21,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:21,528 INFO L225 Difference]: With dead ends: 851 [2019-12-07 14:39:21,528 INFO L226 Difference]: Without dead ends: 482 [2019-12-07 14:39:21,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:21,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2019-12-07 14:39:21,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 388. [2019-12-07 14:39:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-12-07 14:39:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 612 transitions. [2019-12-07 14:39:21,535 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 612 transitions. Word has length 99 [2019-12-07 14:39:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:21,535 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 612 transitions. [2019-12-07 14:39:21,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 612 transitions. [2019-12-07 14:39:21,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 14:39:21,535 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:21,536 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:21,736 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 14:39:21,736 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:21,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:21,737 INFO L82 PathProgramCache]: Analyzing trace with hash 744210536, now seen corresponding path program 1 times [2019-12-07 14:39:21,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:21,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1158691335] [2019-12-07 14:39:21,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:21,849 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:39:21,851 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:21,854 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:39:21,854 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:21,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:21,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:21,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:39:21,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:21,864 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:21,865 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:21,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:21,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:39:21,880 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:39:21,880 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:21,906 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:39:21,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1158691335] [2019-12-07 14:39:21,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:21,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:21,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394776279] [2019-12-07 14:39:21,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:21,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:21,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:21,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:21,907 INFO L87 Difference]: Start difference. First operand 388 states and 612 transitions. Second operand 6 states. [2019-12-07 14:39:30,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:30,484 INFO L93 Difference]: Finished difference Result 927 states and 1448 transitions. [2019-12-07 14:39:30,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:30,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 14:39:30,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:30,488 INFO L225 Difference]: With dead ends: 927 [2019-12-07 14:39:30,488 INFO L226 Difference]: Without dead ends: 554 [2019-12-07 14:39:30,488 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:30,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2019-12-07 14:39:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 390. [2019-12-07 14:39:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-07 14:39:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 615 transitions. [2019-12-07 14:39:30,496 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 615 transitions. Word has length 99 [2019-12-07 14:39:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:30,496 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 615 transitions. [2019-12-07 14:39:30,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:30,496 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 615 transitions. [2019-12-07 14:39:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 14:39:30,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:30,497 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:30,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 14:39:30,698 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:30,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:30,699 INFO L82 PathProgramCache]: Analyzing trace with hash -239207518, now seen corresponding path program 1 times [2019-12-07 14:39:30,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:30,700 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990218602] [2019-12-07 14:39:30,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:30,936 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 14:39:30,938 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:30,953 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 14:39:30,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 14:39:30,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:30,962 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:30,962 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:30,962 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 14:39:30,981 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 14:39:30,981 INFO L377 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 31 treesize of output 24 [2019-12-07 14:39:30,982 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:30,984 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:30,984 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:30,984 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 14:39:30,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:30,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:30,988 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:30,988 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:30,988 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 14:39:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:39:30,999 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:31,027 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 14:39:31,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990218602] [2019-12-07 14:39:31,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:31,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:31,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780119816] [2019-12-07 14:39:31,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:31,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:31,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:31,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:31,029 INFO L87 Difference]: Start difference. First operand 390 states and 615 transitions. Second operand 6 states. [2019-12-07 14:39:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:34,477 INFO L93 Difference]: Finished difference Result 831 states and 1305 transitions. [2019-12-07 14:39:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:34,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 14:39:34,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:34,480 INFO L225 Difference]: With dead ends: 831 [2019-12-07 14:39:34,480 INFO L226 Difference]: Without dead ends: 460 [2019-12-07 14:39:34,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:34,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-12-07 14:39:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 390. [2019-12-07 14:39:34,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2019-12-07 14:39:34,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 607 transitions. [2019-12-07 14:39:34,490 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 607 transitions. Word has length 100 [2019-12-07 14:39:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:34,490 INFO L462 AbstractCegarLoop]: Abstraction has 390 states and 607 transitions. [2019-12-07 14:39:34,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 607 transitions. [2019-12-07 14:39:34,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 14:39:34,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:34,491 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:34,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 14:39:34,692 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:34,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:34,693 INFO L82 PathProgramCache]: Analyzing trace with hash -173747148, now seen corresponding path program 1 times [2019-12-07 14:39:34,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:34,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632342978] [2019-12-07 14:39:34,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:34,848 INFO L264 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:39:34,850 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:34,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:39:34,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:34,855 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:34,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:34,856 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:39:34,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:34,863 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:34,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:34,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:34,864 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:39:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:34,879 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:34,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632342978] [2019-12-07 14:39:34,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:34,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:34,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063716810] [2019-12-07 14:39:34,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:34,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:34,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:34,906 INFO L87 Difference]: Start difference. First operand 390 states and 607 transitions. Second operand 6 states. [2019-12-07 14:39:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:41,539 INFO L93 Difference]: Finished difference Result 947 states and 1468 transitions. [2019-12-07 14:39:41,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:41,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-12-07 14:39:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:41,542 INFO L225 Difference]: With dead ends: 947 [2019-12-07 14:39:41,543 INFO L226 Difference]: Without dead ends: 576 [2019-12-07 14:39:41,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:41,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-12-07 14:39:41,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 420. [2019-12-07 14:39:41,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-07 14:39:41,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 649 transitions. [2019-12-07 14:39:41,550 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 649 transitions. Word has length 111 [2019-12-07 14:39:41,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:41,550 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 649 transitions. [2019-12-07 14:39:41,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:41,550 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 649 transitions. [2019-12-07 14:39:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 14:39:41,551 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:41,551 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:41,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 14:39:41,752 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:41,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:41,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1972251509, now seen corresponding path program 1 times [2019-12-07 14:39:41,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:41,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080465239] [2019-12-07 14:39:41,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:41,886 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:39:41,888 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:41,891 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:39:41,892 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:41,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:41,894 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:41,894 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:39:41,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:41,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:41,904 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:41,904 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:41,904 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:39:41,919 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:41,919 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:41,943 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:41,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080465239] [2019-12-07 14:39:41,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:41,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:41,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879575882] [2019-12-07 14:39:41,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:41,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:41,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:41,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:41,945 INFO L87 Difference]: Start difference. First operand 420 states and 649 transitions. Second operand 6 states. [2019-12-07 14:39:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:48,601 INFO L93 Difference]: Finished difference Result 963 states and 1483 transitions. [2019-12-07 14:39:48,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:48,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-12-07 14:39:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:48,604 INFO L225 Difference]: With dead ends: 963 [2019-12-07 14:39:48,604 INFO L226 Difference]: Without dead ends: 562 [2019-12-07 14:39:48,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-12-07 14:39:48,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 420. [2019-12-07 14:39:48,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2019-12-07 14:39:48,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 643 transitions. [2019-12-07 14:39:48,612 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 643 transitions. Word has length 112 [2019-12-07 14:39:48,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:48,612 INFO L462 AbstractCegarLoop]: Abstraction has 420 states and 643 transitions. [2019-12-07 14:39:48,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 643 transitions. [2019-12-07 14:39:48,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 14:39:48,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:48,613 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:48,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 14:39:48,814 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:48,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:48,814 INFO L82 PathProgramCache]: Analyzing trace with hash -990978407, now seen corresponding path program 1 times [2019-12-07 14:39:48,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:48,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7260933] [2019-12-07 14:39:48,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:48,932 INFO L264 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:39:48,933 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:48,936 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:39:48,937 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:48,939 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:48,939 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:48,939 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:39:48,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:48,946 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:48,947 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:48,947 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:48,947 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:39:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:48,961 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:48,989 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:48,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7260933] [2019-12-07 14:39:48,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:48,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:48,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362018551] [2019-12-07 14:39:48,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:48,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:48,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:48,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:48,991 INFO L87 Difference]: Start difference. First operand 420 states and 643 transitions. Second operand 6 states. [2019-12-07 14:39:57,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:39:57,018 INFO L93 Difference]: Finished difference Result 1005 states and 1534 transitions. [2019-12-07 14:39:57,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:39:57,019 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-12-07 14:39:57,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:39:57,021 INFO L225 Difference]: With dead ends: 1005 [2019-12-07 14:39:57,021 INFO L226 Difference]: Without dead ends: 604 [2019-12-07 14:39:57,021 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:39:57,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-12-07 14:39:57,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 448. [2019-12-07 14:39:57,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-07 14:39:57,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 680 transitions. [2019-12-07 14:39:57,029 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 680 transitions. Word has length 115 [2019-12-07 14:39:57,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:39:57,029 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 680 transitions. [2019-12-07 14:39:57,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:39:57,030 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 680 transitions. [2019-12-07 14:39:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 14:39:57,030 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:39:57,030 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:39:57,231 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 14:39:57,232 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:39:57,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:39:57,233 INFO L82 PathProgramCache]: Analyzing trace with hash -929727792, now seen corresponding path program 1 times [2019-12-07 14:39:57,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:39:57,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1199176858] [2019-12-07 14:39:57,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 14:39:57,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:39:57,412 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:39:57,413 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:39:57,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:39:57,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:57,419 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:57,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:57,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:39:57,428 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:39:57,429 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:39:57,430 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:39:57,430 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:39:57,430 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:39:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:57,445 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:39:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 14:39:57,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1199176858] [2019-12-07 14:39:57,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:39:57,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:39:57,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060316161] [2019-12-07 14:39:57,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:39:57,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:39:57,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:39:57,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:39:57,480 INFO L87 Difference]: Start difference. First operand 448 states and 680 transitions. Second operand 6 states. [2019-12-07 14:40:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:06,126 INFO L93 Difference]: Finished difference Result 1011 states and 1530 transitions. [2019-12-07 14:40:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:06,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-12-07 14:40:06,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:06,128 INFO L225 Difference]: With dead ends: 1011 [2019-12-07 14:40:06,128 INFO L226 Difference]: Without dead ends: 582 [2019-12-07 14:40:06,129 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-12-07 14:40:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 448. [2019-12-07 14:40:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-12-07 14:40:06,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 673 transitions. [2019-12-07 14:40:06,141 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 673 transitions. Word has length 116 [2019-12-07 14:40:06,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:06,141 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 673 transitions. [2019-12-07 14:40:06,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:06,141 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 673 transitions. [2019-12-07 14:40:06,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 14:40:06,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:06,142 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:40:06,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 14:40:06,343 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:06,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:06,344 INFO L82 PathProgramCache]: Analyzing trace with hash -440522194, now seen corresponding path program 1 times [2019-12-07 14:40:06,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:06,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779988290] [2019-12-07 14:40:06,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:06,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:06,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:06,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:06,508 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:06,511 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:06,511 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:06,511 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:06,518 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:06,518 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:06,519 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:06,520 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:06,520 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:06,536 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 14:40:06,536 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 14:40:06,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779988290] [2019-12-07 14:40:06,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:06,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:06,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805949193] [2019-12-07 14:40:06,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:06,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:06,564 INFO L87 Difference]: Start difference. First operand 448 states and 673 transitions. Second operand 6 states. [2019-12-07 14:40:11,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:11,725 INFO L93 Difference]: Finished difference Result 1053 states and 1577 transitions. [2019-12-07 14:40:11,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:11,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-12-07 14:40:11,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:11,728 INFO L225 Difference]: With dead ends: 1053 [2019-12-07 14:40:11,728 INFO L226 Difference]: Without dead ends: 624 [2019-12-07 14:40:11,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-07 14:40:11,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 483. [2019-12-07 14:40:11,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 14:40:11,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 722 transitions. [2019-12-07 14:40:11,737 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 722 transitions. Word has length 123 [2019-12-07 14:40:11,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:11,737 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 722 transitions. [2019-12-07 14:40:11,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:11,737 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 722 transitions. [2019-12-07 14:40:11,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-12-07 14:40:11,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:11,738 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:40:11,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 14:40:11,939 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:11,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:11,939 INFO L82 PathProgramCache]: Analyzing trace with hash 44219424, now seen corresponding path program 1 times [2019-12-07 14:40:11,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:11,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182384716] [2019-12-07 14:40:11,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:12,095 INFO L264 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:12,096 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:12,099 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:12,099 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:12,101 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:12,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:12,102 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:12,108 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:12,108 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:12,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:12,110 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:12,110 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 14:40:12,130 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:12,158 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 14:40:12,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182384716] [2019-12-07 14:40:12,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:12,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:12,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090799808] [2019-12-07 14:40:12,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:12,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:12,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:12,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:12,159 INFO L87 Difference]: Start difference. First operand 483 states and 722 transitions. Second operand 6 states. [2019-12-07 14:40:18,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:18,587 INFO L93 Difference]: Finished difference Result 1078 states and 1608 transitions. [2019-12-07 14:40:18,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:18,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-12-07 14:40:18,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:18,590 INFO L225 Difference]: With dead ends: 1078 [2019-12-07 14:40:18,590 INFO L226 Difference]: Without dead ends: 614 [2019-12-07 14:40:18,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:18,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-12-07 14:40:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 483. [2019-12-07 14:40:18,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2019-12-07 14:40:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 718 transitions. [2019-12-07 14:40:18,599 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 718 transitions. Word has length 124 [2019-12-07 14:40:18,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:18,599 INFO L462 AbstractCegarLoop]: Abstraction has 483 states and 718 transitions. [2019-12-07 14:40:18,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 718 transitions. [2019-12-07 14:40:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-12-07 14:40:18,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:18,600 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:40:18,800 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 14:40:18,801 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:18,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:18,801 INFO L82 PathProgramCache]: Analyzing trace with hash -516973088, now seen corresponding path program 1 times [2019-12-07 14:40:18,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:18,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1960014169] [2019-12-07 14:40:18,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:18,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:18,954 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:18,957 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:18,957 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:18,959 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:18,959 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:18,959 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:18,966 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:18,966 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:18,968 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:18,968 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:18,968 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 14:40:18,988 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 14:40:19,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1960014169] [2019-12-07 14:40:19,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:19,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:19,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891718587] [2019-12-07 14:40:19,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:19,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:19,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:19,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:19,022 INFO L87 Difference]: Start difference. First operand 483 states and 718 transitions. Second operand 6 states. [2019-12-07 14:40:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:30,148 INFO L93 Difference]: Finished difference Result 1121 states and 1660 transitions. [2019-12-07 14:40:30,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:30,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2019-12-07 14:40:30,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:30,151 INFO L225 Difference]: With dead ends: 1121 [2019-12-07 14:40:30,151 INFO L226 Difference]: Without dead ends: 657 [2019-12-07 14:40:30,152 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-12-07 14:40:30,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 526. [2019-12-07 14:40:30,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2019-12-07 14:40:30,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 777 transitions. [2019-12-07 14:40:30,161 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 777 transitions. Word has length 139 [2019-12-07 14:40:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:30,161 INFO L462 AbstractCegarLoop]: Abstraction has 526 states and 777 transitions. [2019-12-07 14:40:30,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 777 transitions. [2019-12-07 14:40:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 14:40:30,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:30,162 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 14:40:30,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 14:40:30,362 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash 564588018, now seen corresponding path program 1 times [2019-12-07 14:40:30,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:30,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894945947] [2019-12-07 14:40:30,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:30,528 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:30,529 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:30,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:30,533 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:30,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:30,536 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:30,536 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:30,543 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:30,543 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:30,544 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:30,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:30,544 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:30,565 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 14:40:30,565 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 14:40:30,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894945947] [2019-12-07 14:40:30,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:30,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:30,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295376618] [2019-12-07 14:40:30,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:30,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:30,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:30,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:30,599 INFO L87 Difference]: Start difference. First operand 526 states and 777 transitions. Second operand 6 states. [2019-12-07 14:40:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:37,947 INFO L93 Difference]: Finished difference Result 1162 states and 1714 transitions. [2019-12-07 14:40:37,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:37,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-12-07 14:40:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:37,951 INFO L225 Difference]: With dead ends: 1162 [2019-12-07 14:40:37,951 INFO L226 Difference]: Without dead ends: 639 [2019-12-07 14:40:37,951 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:37,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-12-07 14:40:37,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 518. [2019-12-07 14:40:37,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-12-07 14:40:37,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 763 transitions. [2019-12-07 14:40:37,960 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 763 transitions. Word has length 140 [2019-12-07 14:40:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:37,960 INFO L462 AbstractCegarLoop]: Abstraction has 518 states and 763 transitions. [2019-12-07 14:40:37,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 763 transitions. [2019-12-07 14:40:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 14:40:37,962 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:37,962 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 14:40:38,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 14:40:38,163 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 236129377, now seen corresponding path program 1 times [2019-12-07 14:40:38,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:38,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569177702] [2019-12-07 14:40:38,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:38,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:38,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:38,396 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:38,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:38,399 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:38,401 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:38,401 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:38,401 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:38,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:38,408 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:38,410 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:38,410 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:38,410 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 14:40:38,427 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:38,459 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 14:40:38,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569177702] [2019-12-07 14:40:38,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:38,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:38,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992034176] [2019-12-07 14:40:38,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:38,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:38,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:38,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:38,461 INFO L87 Difference]: Start difference. First operand 518 states and 763 transitions. Second operand 6 states. [2019-12-07 14:40:46,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:46,723 INFO L93 Difference]: Finished difference Result 1172 states and 1727 transitions. [2019-12-07 14:40:46,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:46,724 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-12-07 14:40:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:46,726 INFO L225 Difference]: With dead ends: 1172 [2019-12-07 14:40:46,726 INFO L226 Difference]: Without dead ends: 673 [2019-12-07 14:40:46,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-07 14:40:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 544. [2019-12-07 14:40:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-07 14:40:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 793 transitions. [2019-12-07 14:40:46,737 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 793 transitions. Word has length 143 [2019-12-07 14:40:46,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:46,737 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 793 transitions. [2019-12-07 14:40:46,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:46,737 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 793 transitions. [2019-12-07 14:40:46,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 14:40:46,738 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:46,738 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:40:46,938 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 14:40:46,939 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:46,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:46,940 INFO L82 PathProgramCache]: Analyzing trace with hash 740046712, now seen corresponding path program 1 times [2019-12-07 14:40:46,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:46,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7305344] [2019-12-07 14:40:46,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:47,126 INFO L264 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:47,127 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:47,130 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:47,130 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:47,133 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:47,133 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:47,133 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:47,140 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:47,140 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:47,141 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:47,142 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:47,142 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 14:40:47,160 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 14:40:47,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7305344] [2019-12-07 14:40:47,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:47,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:47,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688582142] [2019-12-07 14:40:47,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:47,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:47,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:47,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:47,190 INFO L87 Difference]: Start difference. First operand 544 states and 793 transitions. Second operand 6 states. [2019-12-07 14:40:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:52,438 INFO L93 Difference]: Finished difference Result 1188 states and 1733 transitions. [2019-12-07 14:40:52,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:52,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-12-07 14:40:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:52,441 INFO L225 Difference]: With dead ends: 1188 [2019-12-07 14:40:52,441 INFO L226 Difference]: Without dead ends: 663 [2019-12-07 14:40:52,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:52,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-12-07 14:40:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 544. [2019-12-07 14:40:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2019-12-07 14:40:52,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 783 transitions. [2019-12-07 14:40:52,460 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 783 transitions. Word has length 144 [2019-12-07 14:40:52,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:52,460 INFO L462 AbstractCegarLoop]: Abstraction has 544 states and 783 transitions. [2019-12-07 14:40:52,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:52,460 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 783 transitions. [2019-12-07 14:40:52,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 14:40:52,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:52,461 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:40:52,661 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 14:40:52,662 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash -730913263, now seen corresponding path program 1 times [2019-12-07 14:40:52,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:52,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049425758] [2019-12-07 14:40:52,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:52,841 INFO L264 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:52,842 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:52,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:52,846 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:52,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:52,849 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:52,849 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:52,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:52,855 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:52,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:52,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:52,857 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 14:40:52,878 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 14:40:52,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049425758] [2019-12-07 14:40:52,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:52,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:52,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809814144] [2019-12-07 14:40:52,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:52,910 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:52,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:52,911 INFO L87 Difference]: Start difference. First operand 544 states and 783 transitions. Second operand 6 states. [2019-12-07 14:40:58,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:40:58,458 INFO L93 Difference]: Finished difference Result 1222 states and 1761 transitions. [2019-12-07 14:40:58,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:40:58,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-12-07 14:40:58,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:40:58,461 INFO L225 Difference]: With dead ends: 1222 [2019-12-07 14:40:58,461 INFO L226 Difference]: Without dead ends: 697 [2019-12-07 14:40:58,462 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:40:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-12-07 14:40:58,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 577. [2019-12-07 14:40:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-12-07 14:40:58,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 825 transitions. [2019-12-07 14:40:58,472 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 825 transitions. Word has length 157 [2019-12-07 14:40:58,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:40:58,473 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 825 transitions. [2019-12-07 14:40:58,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:40:58,473 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 825 transitions. [2019-12-07 14:40:58,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 14:40:58,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:40:58,474 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:40:58,674 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 14:40:58,675 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:40:58,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:40:58,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1759983651, now seen corresponding path program 1 times [2019-12-07 14:40:58,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:40:58,677 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [152941764] [2019-12-07 14:40:58,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 14:40:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:40:58,834 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:40:58,835 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:40:58,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:40:58,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:58,841 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:58,841 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:58,841 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:40:58,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:40:58,848 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:40:58,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:40:58,849 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:40:58,849 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:40:58,871 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 14:40:58,871 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:40:58,904 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 14:40:58,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [152941764] [2019-12-07 14:40:58,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:40:58,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:40:58,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734748783] [2019-12-07 14:40:58,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:40:58,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:40:58,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:40:58,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:40:58,905 INFO L87 Difference]: Start difference. First operand 577 states and 825 transitions. Second operand 6 states. [2019-12-07 14:41:04,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:04,120 INFO L93 Difference]: Finished difference Result 1248 states and 1786 transitions. [2019-12-07 14:41:04,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:41:04,122 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-12-07 14:41:04,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:04,125 INFO L225 Difference]: With dead ends: 1248 [2019-12-07 14:41:04,125 INFO L226 Difference]: Without dead ends: 672 [2019-12-07 14:41:04,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:41:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-12-07 14:41:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 568. [2019-12-07 14:41:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-12-07 14:41:04,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 805 transitions. [2019-12-07 14:41:04,142 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 805 transitions. Word has length 158 [2019-12-07 14:41:04,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:04,142 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 805 transitions. [2019-12-07 14:41:04,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:41:04,142 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 805 transitions. [2019-12-07 14:41:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 14:41:04,143 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:04,144 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-12-07 14:41:04,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 14:41:04,344 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:04,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:04,345 INFO L82 PathProgramCache]: Analyzing trace with hash -2091510619, now seen corresponding path program 1 times [2019-12-07 14:41:04,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:41:04,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643301718] [2019-12-07 14:41:04,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 14:41:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:04,491 INFO L264 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:41:04,492 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:04,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:41:04,495 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:04,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:04,498 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:04,498 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:41:04,507 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:41:04,507 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:04,508 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:04,509 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:04,509 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:41:04,531 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 14:41:04,531 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:41:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 14:41:04,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643301718] [2019-12-07 14:41:04,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:04,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:41:04,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617921772] [2019-12-07 14:41:04,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:41:04,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:41:04,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:41:04,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:41:04,562 INFO L87 Difference]: Start difference. First operand 568 states and 805 transitions. Second operand 6 states. [2019-12-07 14:41:12,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:12,094 INFO L93 Difference]: Finished difference Result 1246 states and 1773 transitions. [2019-12-07 14:41:12,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:41:12,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-12-07 14:41:12,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:12,099 INFO L225 Difference]: With dead ends: 1246 [2019-12-07 14:41:12,099 INFO L226 Difference]: Without dead ends: 697 [2019-12-07 14:41:12,100 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:41:12,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-12-07 14:41:12,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 590. [2019-12-07 14:41:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-12-07 14:41:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 825 transitions. [2019-12-07 14:41:12,111 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 825 transitions. Word has length 161 [2019-12-07 14:41:12,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:12,111 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 825 transitions. [2019-12-07 14:41:12,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:41:12,112 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 825 transitions. [2019-12-07 14:41:12,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 14:41:12,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:12,112 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 14:41:12,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 14:41:12,314 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:12,314 INFO L82 PathProgramCache]: Analyzing trace with hash -979435844, now seen corresponding path program 1 times [2019-12-07 14:41:12,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:41:12,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991358846] [2019-12-07 14:41:12,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 14:41:12,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:12,498 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:41:12,500 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:12,504 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:41:12,504 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:12,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:12,508 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:12,508 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:41:12,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:41:12,516 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:12,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:12,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:12,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:41:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 14:41:12,538 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:41:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 14:41:12,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991358846] [2019-12-07 14:41:12,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:12,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:41:12,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200216340] [2019-12-07 14:41:12,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:41:12,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:41:12,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:41:12,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:41:12,568 INFO L87 Difference]: Start difference. First operand 590 states and 825 transitions. Second operand 6 states. [2019-12-07 14:41:18,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:18,377 INFO L93 Difference]: Finished difference Result 1261 states and 1769 transitions. [2019-12-07 14:41:18,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:41:18,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-12-07 14:41:18,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:18,381 INFO L225 Difference]: With dead ends: 1261 [2019-12-07 14:41:18,381 INFO L226 Difference]: Without dead ends: 690 [2019-12-07 14:41:18,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:41:18,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-12-07 14:41:18,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 590. [2019-12-07 14:41:18,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-12-07 14:41:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 813 transitions. [2019-12-07 14:41:18,393 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 813 transitions. Word has length 162 [2019-12-07 14:41:18,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:18,393 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 813 transitions. [2019-12-07 14:41:18,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:41:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 813 transitions. [2019-12-07 14:41:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 14:41:18,394 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:18,394 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:18,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 14:41:18,595 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:18,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1327898974, now seen corresponding path program 1 times [2019-12-07 14:41:18,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:41:18,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327166225] [2019-12-07 14:41:18,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 14:41:18,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:18,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 14:41:18,782 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 14:41:18,803 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:41:18,827 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 14:41:18,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327166225] [2019-12-07 14:41:18,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:41:18,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 14:41:18,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571049416] [2019-12-07 14:41:18,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 14:41:18,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:41:18,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 14:41:18,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 14:41:18,828 INFO L87 Difference]: Start difference. First operand 590 states and 813 transitions. Second operand 4 states. [2019-12-07 14:41:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:41:19,450 INFO L93 Difference]: Finished difference Result 2249 states and 3116 transitions. [2019-12-07 14:41:19,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 14:41:19,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 14:41:19,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:41:19,456 INFO L225 Difference]: With dead ends: 2249 [2019-12-07 14:41:19,456 INFO L226 Difference]: Without dead ends: 1678 [2019-12-07 14:41:19,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 324 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-12-07 14:41:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-07 14:41:19,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1658. [2019-12-07 14:41:19,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-12-07 14:41:19,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2294 transitions. [2019-12-07 14:41:19,489 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2294 transitions. Word has length 164 [2019-12-07 14:41:19,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:41:19,489 INFO L462 AbstractCegarLoop]: Abstraction has 1658 states and 2294 transitions. [2019-12-07 14:41:19,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 14:41:19,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2294 transitions. [2019-12-07 14:41:19,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 14:41:19,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:41:19,491 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 14:41:19,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 14:41:19,692 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:41:19,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:41:19,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1218565406, now seen corresponding path program 1 times [2019-12-07 14:41:19,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:41:19,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916633284] [2019-12-07 14:41:19,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 14:41:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:41:20,057 INFO L264 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 14:41:20,060 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:41:21,461 INFO L237 Elim1Store]: Index analysis took 415 ms [2019-12-07 14:41:21,477 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:21,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 14:41:21,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:24,678 WARN L192 SmtUtils]: Spent 3.20 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 14:41:24,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:24,681 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_310|, |v_#memory_$Pointer$.offset_311|], 2=[|v_#memory_$Pointer$.base_308|, |v_#memory_$Pointer$.base_307|, |v_#memory_$Pointer$.offset_307|, |v_#memory_$Pointer$.offset_308|]} [2019-12-07 14:41:24,856 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:24,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:24,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:24,957 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:24,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:25,099 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:25,437 INFO L237 Elim1Store]: Index analysis took 666 ms [2019-12-07 14:41:26,513 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 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-12-07 14:41:26,513 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:28,944 WARN L192 SmtUtils]: Spent 2.43 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:41:28,944 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:29,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:29,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:29,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:29,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:29,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:29,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:29,250 INFO L237 Elim1Store]: Index analysis took 228 ms [2019-12-07 14:41:29,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 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-12-07 14:41:29,440 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:30,462 WARN L192 SmtUtils]: Spent 1.02 s on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 14:41:30,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:30,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:30,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:30,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:30,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:30,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:30,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:30,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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-12-07 14:41:30,621 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,074 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 14:41:31,074 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,111 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,132 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 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-12-07 14:41:31,133 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,373 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 14:41:31,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,381 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:31,598 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 14:41:31,598 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 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-12-07 14:41:31,616 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,671 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,672 INFO L534 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-12-07 14:41:31,672 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 14:41:31,704 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_312|], 12=[|v_#memory_$Pointer$.base_311|]} [2019-12-07 14:41:31,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:31,718 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,792 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 14:41:31,796 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,821 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 14:41:31,826 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_313|], 12=[|v_#memory_$Pointer$.base_312|]} [2019-12-07 14:41:31,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:31,842 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,893 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:31,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 14:41:31,910 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:31,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:31,935 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 14:41:31,937 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_314|, |v_#memory_$Pointer$.base_309|, |v_#memory_$Pointer$.offset_309|], 12=[|v_#memory_$Pointer$.base_313|]} [2019-12-07 14:41:31,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,005 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:32,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,294 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:41:32,295 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,300 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:32,445 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-12-07 14:41:32,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:32,473 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,593 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-12-07 14:41:32,594 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,603 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 14:41:32,604 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,634 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,635 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 14:41:32,639 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_315|], 12=[|v_#memory_$Pointer$.base_314|]} [2019-12-07 14:41:32,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,654 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:32,654 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,725 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,728 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,729 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 14:41:32,729 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,752 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,752 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,752 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 14:41:32,754 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_316|], 12=[|v_#memory_$Pointer$.base_315|]} [2019-12-07 14:41:32,769 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,770 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:32,770 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,843 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,844 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 14:41:32,844 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,871 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,871 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,871 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 14:41:32,877 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_316|], 12=[|v_#memory_$Pointer$.offset_317|]} [2019-12-07 14:41:32,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,883 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 56 [2019-12-07 14:41:32,883 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:32,910 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:32,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-12-07 14:41:32,915 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:32,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:32,935 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:32,935 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:44 [2019-12-07 14:41:32,965 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_310|], 20=[|v_#memory_$Pointer$.offset_318|]} [2019-12-07 14:41:32,968 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,037 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2019-12-07 14:41:33,046 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,069 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,070 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2019-12-07 14:41:33,093 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_364|], 20=[|v_#memory_$Pointer$.offset_319|]} [2019-12-07 14:41:33,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:41:33,103 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,150 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-12-07 14:41:33,158 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,189 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,189 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,189 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2019-12-07 14:41:33,226 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_317|], 2=[|v_#memory_int_365|], 12=[|v_#memory_$Pointer$.offset_320|]} [2019-12-07 14:41:33,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 31 treesize of output 19 [2019-12-07 14:41:33,234 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,283 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 14:41:33,291 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2019-12-07 14:41:33,332 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,348 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,348 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:20 [2019-12-07 14:41:33,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,374 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:41:33,375 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,375 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 14:41:33,376 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-12-07 14:41:33,424 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 14:41:33,425 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,426 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,426 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,426 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-12-07 14:41:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 14:41:33,639 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:41:33,680 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-12-07 14:41:33,680 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 14:41:33,729 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:41:33,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,747 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,755 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,755 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,756 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:17 [2019-12-07 14:41:33,790 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_324|], 2=[|v_#memory_$Pointer$.offset_310|]} [2019-12-07 14:41:33,793 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,810 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,813 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,813 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,813 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 14:41:33,923 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_323|], 20=[|v_#memory_$Pointer$.offset_326|]} [2019-12-07 14:41:33,926 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,963 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:33,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:33,974 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 14:41:34,877 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_324|], 1=[|v_#memory_$Pointer$.offset_327|]} [2019-12-07 14:41:34,879 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:34,918 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:34,919 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:34,933 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:34,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:34,933 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 14:41:35,634 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_325|], 1=[|v_#memory_$Pointer$.offset_328|], 2=[|v_#memory_$Pointer$.base_309|, |v_#memory_$Pointer$.offset_309|]} [2019-12-07 14:41:35,640 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:35,773 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 14:41:35,773 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:35,777 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:35,901 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 14:41:35,902 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:35,904 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:35,970 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:35,971 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:35,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:35,989 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:35,989 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 14:41:37,780 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_326|], 1=[|v_#memory_$Pointer$.offset_329|]} [2019-12-07 14:41:37,783 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:37,848 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:37,849 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:37,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:37,867 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:37,867 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:199, output treesize:198 [2019-12-07 14:41:39,498 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_327|], 1=[|v_#memory_$Pointer$.offset_330|]} [2019-12-07 14:41:39,501 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:39,583 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:39,585 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:39,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:41:39,609 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 14:41:39,609 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 14:41:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 14:41:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916633284] [2019-12-07 14:41:42,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 14:41:42,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 16 [2019-12-07 14:41:42,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397624310] [2019-12-07 14:41:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 14:41:42,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:41:42,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 14:41:42,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-12-07 14:41:42,403 INFO L87 Difference]: Start difference. First operand 1658 states and 2294 transitions. Second operand 16 states. [2019-12-07 14:45:46,560 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 46 [2019-12-07 14:46:11,196 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-12-07 14:47:07,714 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-12-07 14:47:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:33,359 INFO L93 Difference]: Finished difference Result 3457 states and 4763 transitions. [2019-12-07 14:47:33,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 14:47:33,361 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 164 [2019-12-07 14:47:33,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:33,368 INFO L225 Difference]: With dead ends: 3457 [2019-12-07 14:47:33,368 INFO L226 Difference]: Without dead ends: 1818 [2019-12-07 14:47:33,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 309 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 49.2s TimeCoverageRelationStatistics Valid=150, Invalid=336, Unknown=20, NotChecked=0, Total=506 [2019-12-07 14:47:33,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2019-12-07 14:47:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1460. [2019-12-07 14:47:33,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1460 states. [2019-12-07 14:47:33,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1460 states to 1460 states and 2024 transitions. [2019-12-07 14:47:33,408 INFO L78 Accepts]: Start accepts. Automaton has 1460 states and 2024 transitions. Word has length 164 [2019-12-07 14:47:33,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:33,408 INFO L462 AbstractCegarLoop]: Abstraction has 1460 states and 2024 transitions. [2019-12-07 14:47:33,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 14:47:33,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1460 states and 2024 transitions. [2019-12-07 14:47:33,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-12-07 14:47:33,409 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:33,409 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 14:47:33,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 14:47:33,611 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:33,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:33,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1430096596, now seen corresponding path program 1 times [2019-12-07 14:47:33,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:47:33,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [876822073] [2019-12-07 14:47:33,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:33,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:33,818 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:33,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:47:33,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:33,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:33,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:33,823 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:47:33,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:47:33,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:33,831 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:33,832 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:33,832 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:47:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:47:33,852 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:47:33,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [876822073] [2019-12-07 14:47:33,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:33,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:47:33,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830211429] [2019-12-07 14:47:33,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:47:33,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:47:33,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:47:33,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:47:33,884 INFO L87 Difference]: Start difference. First operand 1460 states and 2024 transitions. Second operand 6 states. [2019-12-07 14:47:38,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:38,104 INFO L93 Difference]: Finished difference Result 3243 states and 4498 transitions. [2019-12-07 14:47:38,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:47:38,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 165 [2019-12-07 14:47:38,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:38,111 INFO L225 Difference]: With dead ends: 3243 [2019-12-07 14:47:38,111 INFO L226 Difference]: Without dead ends: 1802 [2019-12-07 14:47:38,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:47:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2019-12-07 14:47:38,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1532. [2019-12-07 14:47:38,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1532 states. [2019-12-07 14:47:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2097 transitions. [2019-12-07 14:47:38,152 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2097 transitions. Word has length 165 [2019-12-07 14:47:38,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:38,153 INFO L462 AbstractCegarLoop]: Abstraction has 1532 states and 2097 transitions. [2019-12-07 14:47:38,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:47:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2097 transitions. [2019-12-07 14:47:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 14:47:38,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:38,154 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2019-12-07 14:47:38,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 14:47:38,355 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1838912011, now seen corresponding path program 1 times [2019-12-07 14:47:38,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:47:38,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274542291] [2019-12-07 14:47:38,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:38,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:38,552 INFO L264 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 14:47:38,553 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:38,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 14:47:38,556 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:38,558 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:38,559 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:38,559 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 14:47:38,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 14:47:38,565 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:38,566 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:38,566 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:38,567 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 14:47:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:47:38,587 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:38,619 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 14:47:38,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274542291] [2019-12-07 14:47:38,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:38,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 14:47:38,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590228335] [2019-12-07 14:47:38,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 14:47:38,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:47:38,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 14:47:38,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 14:47:38,621 INFO L87 Difference]: Start difference. First operand 1532 states and 2097 transitions. Second operand 6 states. [2019-12-07 14:47:43,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:43,690 INFO L93 Difference]: Finished difference Result 3298 states and 4517 transitions. [2019-12-07 14:47:43,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 14:47:43,691 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-12-07 14:47:43,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:43,697 INFO L225 Difference]: With dead ends: 3298 [2019-12-07 14:47:43,697 INFO L226 Difference]: Without dead ends: 1761 [2019-12-07 14:47:43,698 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:47:43,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2019-12-07 14:47:43,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 1516. [2019-12-07 14:47:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1516 states. [2019-12-07 14:47:43,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1516 states to 1516 states and 2046 transitions. [2019-12-07 14:47:43,747 INFO L78 Accepts]: Start accepts. Automaton has 1516 states and 2046 transitions. Word has length 166 [2019-12-07 14:47:43,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:43,747 INFO L462 AbstractCegarLoop]: Abstraction has 1516 states and 2046 transitions. [2019-12-07 14:47:43,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 14:47:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1516 states and 2046 transitions. [2019-12-07 14:47:43,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 14:47:43,748 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:43,748 INFO L410 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] [2019-12-07 14:47:43,949 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 14:47:43,950 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:43,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:43,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1660399470, now seen corresponding path program 1 times [2019-12-07 14:47:43,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:47:43,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [511997821] [2019-12-07 14:47:43,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:44,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 14:47:44,306 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:44,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 14:47:44,369 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,564 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:47:44,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,565 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_347|], 2=[|v_#memory_$Pointer$.base_344|, |v_#memory_$Pointer$.base_343|]} [2019-12-07 14:47:44,573 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,578 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,580 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:47:44,617 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,726 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:47:44,727 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,731 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,732 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,734 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,736 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:47:44,747 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,791 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,792 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:47:44,792 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,806 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,806 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,806 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 14:47:44,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:44,816 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,821 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:44,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,825 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:44,825 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,830 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,830 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,830 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:44,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:44,838 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,849 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,851 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:44,852 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,856 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,856 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,857 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:47:44,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:44,861 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,866 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,866 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:44,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,869 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:44,869 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,874 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,874 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,874 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:44,878 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:44,899 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:44,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 14:47:44,903 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,913 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,913 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,913 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:47:44,915 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_394|], 2=[|v_#memory_$Pointer$.offset_346|, |v_#memory_$Pointer$.base_354|]} [2019-12-07 14:47:44,922 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 14:47:44,922 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:44,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 14:47:44,961 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:44,978 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 119 [2019-12-07 14:47:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:47:45,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:47:45,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:47:45,013 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2019-12-07 14:47:45,050 INFO L614 ElimStorePlain]: treesize reduction 107, result has 24.6 percent of original size [2019-12-07 14:47:45,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:45,050 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:143, output treesize:35 [2019-12-07 14:47:45,069 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-12-07 14:47:45,069 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:45,073 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 14:47:45,075 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:45,076 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,076 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 14:47:45,076 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:45,076 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2019-12-07 14:47:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 14:47:45,136 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:47:45,165 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.base_359|, |v_#memory_$Pointer$.offset_351|, |#memory_$Pointer$.offset|]} [2019-12-07 14:47:45,185 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2019-12-07 14:47:45,185 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 14:47:45,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,233 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:47:45,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,266 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 14:47:45,282 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,293 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2019-12-07 14:47:45,293 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:45,297 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-12-07 14:47:45,297 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,341 INFO L614 ElimStorePlain]: treesize reduction 10, result has 84.8 percent of original size [2019-12-07 14:47:45,342 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 14:47:45,342 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2019-12-07 14:47:45,373 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,386 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,386 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,389 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,389 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,389 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 14:47:45,404 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,407 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,407 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,407 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 14:47:45,421 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,423 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,423 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,424 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 14:47:45,438 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,454 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,455 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,458 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,458 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,458 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 14:47:45,473 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,476 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,476 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,476 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 14:47:45,489 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,492 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:45,493 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:45,493 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 14:47:45,554 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 14:47:45,554 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [511997821] [2019-12-07 14:47:45,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:47:45,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 14:47:45,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929783286] [2019-12-07 14:47:45,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 14:47:45,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 14:47:45,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 14:47:45,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 14:47:45,555 INFO L87 Difference]: Start difference. First operand 1516 states and 2046 transitions. Second operand 8 states. [2019-12-07 14:47:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 14:47:55,045 INFO L93 Difference]: Finished difference Result 4372 states and 5923 transitions. [2019-12-07 14:47:55,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 14:47:55,047 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 190 [2019-12-07 14:47:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 14:47:55,056 INFO L225 Difference]: With dead ends: 4372 [2019-12-07 14:47:55,057 INFO L226 Difference]: Without dead ends: 2875 [2019-12-07 14:47:55,058 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 366 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 14:47:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2875 states. [2019-12-07 14:47:55,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2875 to 2757. [2019-12-07 14:47:55,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2019-12-07 14:47:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 3771 transitions. [2019-12-07 14:47:55,143 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 3771 transitions. Word has length 190 [2019-12-07 14:47:55,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 14:47:55,143 INFO L462 AbstractCegarLoop]: Abstraction has 2757 states and 3771 transitions. [2019-12-07 14:47:55,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 14:47:55,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 3771 transitions. [2019-12-07 14:47:55,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-12-07 14:47:55,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 14:47:55,146 INFO L410 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] [2019-12-07 14:47:55,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 14:47:55,347 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 14:47:55,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 14:47:55,347 INFO L82 PathProgramCache]: Analyzing trace with hash 601173780, now seen corresponding path program 1 times [2019-12-07 14:47:55,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 14:47:55,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011599280] [2019-12-07 14:47:55,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 14:47:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:47:55,767 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 34 conjunts are in the unsatisfiable core [2019-12-07 14:47:55,772 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 14:47:55,834 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 14:47:55,835 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,049 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 14:47:56,049 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,050 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_374|], 2=[|v_#memory_$Pointer$.base_368|, |v_#memory_$Pointer$.base_367|]} [2019-12-07 14:47:56,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,064 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 14:47:56,096 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,201 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 14:47:56,202 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,209 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,211 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,221 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:47:56,221 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:47:56,263 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,278 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,278 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,278 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 14:47:56,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,288 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:56,288 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,292 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,293 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,293 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:56,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:56,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,301 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,301 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,301 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:56,304 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:56,326 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 14:47:56,330 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,341 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,341 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,341 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:47:56,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,345 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:56,346 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,351 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,351 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:56,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:56,354 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,359 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,359 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 14:47:56,362 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:56,383 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,387 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 14:47:56,389 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,397 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,397 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:47:56,399 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_361|], 2=[|v_#memory_$Pointer$.base_381|]} [2019-12-07 14:47:56,401 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 14:47:56,401 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:56,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,444 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,445 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 14:47:56,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:47:56,445 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,460 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 14:47:56,460 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,461 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 14:47:56,463 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:56,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,493 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 14:47:56,493 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,502 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,502 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 14:47:56,504 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_362|], 2=[|v_#memory_$Pointer$.base_383|]} [2019-12-07 14:47:56,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 14:47:56,507 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:56,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,553 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:56,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 14:47:56,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:47:56,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:47:56,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:47:56,555 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 14:47:56,580 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 14:47:56,580 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:47:56,581 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 14:47:56,583 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_407|, |v_#memory_$Pointer$.offset_363|], 2=[|v_#memory_$Pointer$.base_372|, |v_#memory_$Pointer$.offset_359|, |v_#memory_$Pointer$.base_384|], 6=[|v_#memory_$Pointer$.offset_360|, |v_#memory_$Pointer$.base_373|]} [2019-12-07 14:47:56,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,698 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:56,699 INFO L377 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-12-07 14:47:56,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:57,325 WARN L192 SmtUtils]: Spent 625.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 14:47:57,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:57,365 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-12-07 14:47:57,366 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:57,698 WARN L192 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 14:47:57,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:57,707 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:58,029 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 14:47:58,030 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:58,037 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:47:58,405 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-12-07 14:47:58,406 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:58,461 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:58,482 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 14:47:58,482 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:58,644 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 14:47:58,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:58,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:47:58,650 INFO L377 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 172 treesize of output 106 [2019-12-07 14:47:58,650 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 14:47:58,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:47:58,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:48:14,941 WARN L192 SmtUtils]: Spent 16.23 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 14:48:14,942 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:14,942 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 128 treesize of output 166 [2019-12-07 14:48:14,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:48:14,943 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 14:48:15,015 INFO L614 ElimStorePlain]: treesize reduction 110, result has 46.3 percent of original size [2019-12-07 14:48:15,016 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:48:15,016 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:53 [2019-12-07 14:48:15,043 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_364|, |v_#memory_$Pointer$.base_385|], 12=[|v_#memory_int_408|]} [2019-12-07 14:48:15,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 14:48:15,046 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:15,080 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:15,083 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 33 [2019-12-07 14:48:15,083 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:15,110 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:15,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 14:48:15,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 14:48:15,114 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 14:48:15,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:15,128 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:15,128 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:35 [2019-12-07 14:48:15,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 14:48:15,167 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:48:15,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:15,172 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 14:48:15,172 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 14:48:15,325 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 14:48:15,325 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 14:48:15,368 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_372|, |v_#memory_$Pointer$.offset_359|, |v_#memory_$Pointer$.base_387|, |v_#memory_$Pointer$.offset_366|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_360|, |v_#memory_$Pointer$.base_373|]} [2019-12-07 14:48:15,419 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-12-07 14:48:15,419 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 14:48:15,837 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 14:48:15,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:15,853 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:16,268 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 14:48:16,268 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:16,287 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:16,590 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 14:48:16,591 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:16,599 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:16,762 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 14:48:16,762 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:16,765 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 14:48:16,852 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:16,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1888 treesize of output 1720 [2019-12-07 14:48:16,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:48:16,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:48:16,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 14:48:16,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:48:16,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 14:48:16,859 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-12-07 14:48:17,409 WARN L192 SmtUtils]: Spent 549.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2019-12-07 14:48:17,410 INFO L614 ElimStorePlain]: treesize reduction 3030, result has 6.6 percent of original size [2019-12-07 14:48:17,470 INFO L343 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2019-12-07 14:48:17,470 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 105 [2019-12-07 14:48:17,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:48:17,502 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 14:48:17,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2019-12-07 14:48:17,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 14:48:17,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 14:48:17,508 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_163], 1=[v_arrayElimCell_164]} [2019-12-07 14:48:17,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011599280] [2019-12-07 14:48:17,516 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@b876bf [2019-12-07 14:48:17,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1288488539] [2019-12-07 14:48:17,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/cvc4 Starting monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:48:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:19,443 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 14:48:19,443 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@b876bf [2019-12-07 14:48:19,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850446753] [2019-12-07 14:48:19,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_999810dc-8a9b-48c5-8cc0-f3f409a46448/bin/uautomizer/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 14:48:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 14:48:19,905 INFO L264 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 51 conjunts are in the unsatisfiable core [2019-12-07 14:48:19,905 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@b876bf [2019-12-07 14:48:19,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 14:48:19,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 14:48:19,905 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 14:48:19,905 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 14:48:20,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 14:48:20,546 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 14:48:20,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 02:48:20 BoogieIcfgContainer [2019-12-07 14:48:20,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 14:48:20,546 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 14:48:20,546 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 14:48:20,546 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 14:48:20,547 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 02:37:43" (3/4) ... [2019-12-07 14:48:20,549 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 14:48:20,549 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 14:48:20,550 INFO L168 Benchmark]: Toolchain (without parser) took 639394.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 947.0 MB in the beginning and 801.0 MB in the end (delta: 146.0 MB). Peak memory consumption was 291.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:20,550 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:48:20,550 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:20,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.15 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-12-07 14:48:20,550 INFO L168 Benchmark]: Boogie Preprocessor took 54.10 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-12-07 14:48:20,550 INFO L168 Benchmark]: RCFGBuilder took 2147.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:20,551 INFO L168 Benchmark]: TraceAbstraction took 636714.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Free memory was 981.3 MB in the beginning and 801.0 MB in the end (delta: 180.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. [2019-12-07 14:48:20,551 INFO L168 Benchmark]: Witness Printer took 2.65 ms. Allocated memory is still 1.2 GB. Free memory is still 801.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 14:48:20,552 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 417.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.15 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 54.10 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 2147.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 987.9 MB in the end (delta: 97.7 MB). Peak memory consumption was 97.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 636714.07 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 21.0 MB). Free memory was 981.3 MB in the beginning and 801.0 MB in the end (delta: 180.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 11.5 GB. * Witness Printer took 2.65 ms. Allocated memory is still 1.2 GB. Free memory is still 801.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1738]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND FALSE !(s->options & 2097152UL) [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 0 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND FALSE !((s->s3)->tmp.use_rsa_tmp) [L1390] COND FALSE !(l & 30UL) [L1393] COND FALSE !(l & 1UL) [L1424] skip = 1 [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND FALSE !(blastFlag == 4) [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1697] EXPR s->s3 [L1697] EXPR (s->s3)->tmp.reuse_message [L1697] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1726] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1738] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNKNOWN, OverallTime: 636.6s, OverallIterations: 36, TraceHistogramMax: 7, AutomataDifference: 563.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5338 SDtfs, 6836 SDslu, 15493 SDs, 0 SdLazy, 14843 SolverSat, 2307 SolverUnsat, 150 SolverUnknown, 0 SolverNotchecked, 506.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8046 GetRequests, 7813 SyntacticMatches, 17 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 50.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2757occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 35 MinimizatonAttempts, 4768 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 34.5s InterpolantComputationTime, 4023 NumberOfCodeBlocks, 4023 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 7976 ConstructedInterpolants, 197 QuantifiedInterpolants, 6143314 SizeOfPredicates, 136 NumberOfNonLiveVariables, 9841 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 70 InterpolantComputations, 68 PerfectInterpolantSequences, 7731/8062 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...