./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/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 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/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 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:00:02,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:00:02,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:00:02,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:00:02,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:00:02,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:00:02,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:00:02,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:00:02,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:00:02,902 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:00:02,906 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:00:02,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:00:02,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:00:02,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:00:02,911 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:00:02,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:00:02,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:00:02,914 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:00:02,916 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:00:02,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:00:02,921 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:00:02,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:00:02,924 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:00:02,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:00:02,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:00:02,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:00:02,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:00:02,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:00:02,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:00:02,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:00:02,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:00:02,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:00:02,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:00:02,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:00:02,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:00:02,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:00:02,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:00:02,938 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:00:02,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:00:02,939 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:00:02,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:00:02,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:00:02,956 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:00:02,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:00:02,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:00:02,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:00:02,959 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:00:02,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:00:02,959 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:00:02,960 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:00:02,960 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:00:02,960 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:00:02,960 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:00:02,961 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:00:02,961 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:00:02,961 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:00:02,961 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:00:02,962 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:00:02,962 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:00:02,962 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:00:02,962 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:00:02,963 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:00:02,963 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:00:02,963 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:00:02,963 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:00:02,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:00:02,964 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:00:02,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:00:02,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:00:02,965 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:00:02,965 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_a81a7439-65c2-44b7-9611-bf22be70eade/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 -> 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 [2019-11-19 22:00:03,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:00:03,157 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:00:03,161 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:00:03,162 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:00:03,163 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:00:03,163 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-19 22:00:03,221 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/28a6847b0/0fac6b9a3b5c46f4a3a01aa924f5e945/FLAG70d87832b [2019-11-19 22:00:03,778 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:00:03,778 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-19 22:00:03,801 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/28a6847b0/0fac6b9a3b5c46f4a3a01aa924f5e945/FLAG70d87832b [2019-11-19 22:00:04,062 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/28a6847b0/0fac6b9a3b5c46f4a3a01aa924f5e945 [2019-11-19 22:00:04,065 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:00:04,067 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:00:04,069 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:00:04,069 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:00:04,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:00:04,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:04,079 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55928634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04, skipping insertion in model container [2019-11-19 22:00:04,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:04,088 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:00:04,177 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:00:04,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:00:04,727 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:00:04,834 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:00:04,937 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:00:04,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04 WrapperNode [2019-11-19 22:00:04,937 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:00:04,938 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:00:04,938 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:00:04,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:00:04,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:04,975 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,021 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:00:05,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:00:05,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:00:05,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:00:05,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,041 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,041 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... [2019-11-19 22:00:05,106 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:00:05,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:00:05,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:00:05,107 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:00:05,108 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:00:05,191 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:00:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-11-19 22:00:05,192 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-11-19 22:00:05,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:00:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:00:05,198 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-11-19 22:00:05,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-11-19 22:00:05,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:00:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:00:05,200 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-11-19 22:00:05,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-11-19 22:00:05,202 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-11-19 22:00:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-11-19 22:00:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:00:05,203 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-11-19 22:00:05,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-11-19 22:00:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:00:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-11-19 22:00:05,204 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-11-19 22:00:05,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 22:00:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-11-19 22:00:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-11-19 22:00:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-19 22:00:05,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:00:05,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:00:06,253 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:00:06,253 INFO L285 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-19 22:00:06,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:06 BoogieIcfgContainer [2019-11-19 22:00:06,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:00:06,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:00:06,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:00:06,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:00:06,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:00:04" (1/3) ... [2019-11-19 22:00:06,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343fed46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:00:06, skipping insertion in model container [2019-11-19 22:00:06,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:00:04" (2/3) ... [2019-11-19 22:00:06,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343fed46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:00:06, skipping insertion in model container [2019-11-19 22:00:06,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:00:06" (3/3) ... [2019-11-19 22:00:06,265 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-11-19 22:00:06,274 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:00:06,283 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:00:06,293 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:00:06,320 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:00:06,320 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:00:06,320 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:00:06,320 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:00:06,320 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:00:06,321 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:00:06,321 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:00:06,321 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:00:06,337 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-19 22:00:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:00:06,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:06,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:06,344 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:06,348 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-11-19 22:00:06,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:06,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334348275] [2019-11-19 22:00:06,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:06,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334348275] [2019-11-19 22:00:06,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:06,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:06,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779089825] [2019-11-19 22:00:06,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:06,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:06,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:06,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:06,821 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 8 states. [2019-11-19 22:00:07,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:07,736 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-11-19 22:00:07,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:00:07,738 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-19 22:00:07,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:07,761 INFO L225 Difference]: With dead ends: 269 [2019-11-19 22:00:07,761 INFO L226 Difference]: Without dead ends: 125 [2019-11-19 22:00:07,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:07,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-19 22:00:07,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-19 22:00:07,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 22:00:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-11-19 22:00:07,862 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-11-19 22:00:07,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:07,863 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-11-19 22:00:07,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:07,863 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-11-19 22:00:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:00:07,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:07,867 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] [2019-11-19 22:00:07,867 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-11-19 22:00:07,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:07,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811219485] [2019-11-19 22:00:07,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:08,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811219485] [2019-11-19 22:00:08,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:08,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:08,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141624690] [2019-11-19 22:00:08,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:08,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:08,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:08,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:08,155 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 8 states. [2019-11-19 22:00:08,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:08,864 INFO L93 Difference]: Finished difference Result 276 states and 411 transitions. [2019-11-19 22:00:08,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:00:08,866 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-11-19 22:00:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:08,869 INFO L225 Difference]: With dead ends: 276 [2019-11-19 22:00:08,870 INFO L226 Difference]: Without dead ends: 166 [2019-11-19 22:00:08,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-19 22:00:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-11-19 22:00:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-19 22:00:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2019-11-19 22:00:08,894 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 27 [2019-11-19 22:00:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:08,895 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2019-11-19 22:00:08,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:08,895 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2019-11-19 22:00:08,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:00:08,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:08,898 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] [2019-11-19 22:00:08,898 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:08,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:08,898 INFO L82 PathProgramCache]: Analyzing trace with hash -577189180, now seen corresponding path program 1 times [2019-11-19 22:00:08,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:08,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57156672] [2019-11-19 22:00:08,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:08,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:08,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57156672] [2019-11-19 22:00:08,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:08,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:00:08,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119131146] [2019-11-19 22:00:08,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:08,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:08,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:08,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:08,977 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand 3 states. [2019-11-19 22:00:08,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:08,994 INFO L93 Difference]: Finished difference Result 296 states and 433 transitions. [2019-11-19 22:00:08,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:08,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-19 22:00:08,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:08,998 INFO L225 Difference]: With dead ends: 296 [2019-11-19 22:00:08,998 INFO L226 Difference]: Without dead ends: 156 [2019-11-19 22:00:09,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:00:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-19 22:00:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-19 22:00:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-19 22:00:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-19 22:00:09,016 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 27 [2019-11-19 22:00:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:09,017 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-19 22:00:09,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:09,017 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-19 22:00:09,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:00:09,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:09,019 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] [2019-11-19 22:00:09,020 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:09,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-11-19 22:00:09,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:09,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508979256] [2019-11-19 22:00:09,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:09,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:09,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508979256] [2019-11-19 22:00:09,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359960179] [2019-11-19 22:00:09,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:09,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-19 22:00:09,581 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:09,646 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 11 treesize of output 7 [2019-11-19 22:00:09,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:00:09,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:00:09,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:00:09,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-19 22:00:09,739 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:00:09,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-19 22:00:09,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:00:09,765 INFO L567 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2019-11-19 22:00:09,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:00:09,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-19 22:00:09,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:09,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:00:09,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2019-11-19 22:00:09,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951267478] [2019-11-19 22:00:09,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 22:00:09,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:09,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:00:09,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:00:09,947 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 19 states. [2019-11-19 22:00:13,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:13,962 INFO L93 Difference]: Finished difference Result 642 states and 1060 transitions. [2019-11-19 22:00:13,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-11-19 22:00:13,963 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-11-19 22:00:13,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:13,979 INFO L225 Difference]: With dead ends: 642 [2019-11-19 22:00:13,981 INFO L226 Difference]: Without dead ends: 502 [2019-11-19 22:00:13,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=437, Invalid=2425, Unknown=0, NotChecked=0, Total=2862 [2019-11-19 22:00:13,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-19 22:00:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 417. [2019-11-19 22:00:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-19 22:00:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 666 transitions. [2019-11-19 22:00:14,072 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 666 transitions. Word has length 28 [2019-11-19 22:00:14,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 666 transitions. [2019-11-19 22:00:14,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 22:00:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 666 transitions. [2019-11-19 22:00:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-19 22:00:14,075 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:14,076 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] [2019-11-19 22:00:14,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:14,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:14,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash -2025119411, now seen corresponding path program 1 times [2019-11-19 22:00:14,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:14,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411688949] [2019-11-19 22:00:14,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:14,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:14,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:14,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411688949] [2019-11-19 22:00:14,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:14,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:14,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399019624] [2019-11-19 22:00:14,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:14,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:14,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:14,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:14,523 INFO L87 Difference]: Start difference. First operand 417 states and 666 transitions. Second operand 8 states. [2019-11-19 22:00:15,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:15,334 INFO L93 Difference]: Finished difference Result 872 states and 1561 transitions. [2019-11-19 22:00:15,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:00:15,336 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-11-19 22:00:15,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:15,344 INFO L225 Difference]: With dead ends: 872 [2019-11-19 22:00:15,345 INFO L226 Difference]: Without dead ends: 469 [2019-11-19 22:00:15,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-11-19 22:00:15,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 454. [2019-11-19 22:00:15,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-11-19 22:00:15,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 716 transitions. [2019-11-19 22:00:15,391 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 716 transitions. Word has length 29 [2019-11-19 22:00:15,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:15,392 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 716 transitions. [2019-11-19 22:00:15,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 716 transitions. [2019-11-19 22:00:15,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-19 22:00:15,398 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:15,398 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] [2019-11-19 22:00:15,399 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:15,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:15,400 INFO L82 PathProgramCache]: Analyzing trace with hash -887190847, now seen corresponding path program 1 times [2019-11-19 22:00:15,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:15,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606957577] [2019-11-19 22:00:15,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:15,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:15,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606957577] [2019-11-19 22:00:15,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:15,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:00:15,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927315006] [2019-11-19 22:00:15,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:00:15,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:00:15,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:00:15,510 INFO L87 Difference]: Start difference. First operand 454 states and 716 transitions. Second operand 7 states. [2019-11-19 22:00:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:16,367 INFO L93 Difference]: Finished difference Result 906 states and 1592 transitions. [2019-11-19 22:00:16,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:00:16,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-11-19 22:00:16,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:16,373 INFO L225 Difference]: With dead ends: 906 [2019-11-19 22:00:16,374 INFO L226 Difference]: Without dead ends: 466 [2019-11-19 22:00:16,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-19 22:00:16,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2019-11-19 22:00:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-19 22:00:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 725 transitions. [2019-11-19 22:00:16,418 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 725 transitions. Word has length 30 [2019-11-19 22:00:16,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:16,420 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 725 transitions. [2019-11-19 22:00:16,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:00:16,420 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 725 transitions. [2019-11-19 22:00:16,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-19 22:00:16,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:16,424 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] [2019-11-19 22:00:16,425 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:16,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:16,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1592982185, now seen corresponding path program 1 times [2019-11-19 22:00:16,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:16,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784290681] [2019-11-19 22:00:16,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:00:16,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784290681] [2019-11-19 22:00:16,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:16,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:16,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440998721] [2019-11-19 22:00:16,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:16,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:16,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:16,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:16,534 INFO L87 Difference]: Start difference. First operand 464 states and 725 transitions. Second operand 8 states. [2019-11-19 22:00:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:18,100 INFO L93 Difference]: Finished difference Result 918 states and 1613 transitions. [2019-11-19 22:00:18,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:00:18,101 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-11-19 22:00:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:18,106 INFO L225 Difference]: With dead ends: 918 [2019-11-19 22:00:18,107 INFO L226 Difference]: Without dead ends: 461 [2019-11-19 22:00:18,112 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:18,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-19 22:00:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2019-11-19 22:00:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-11-19 22:00:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 711 transitions. [2019-11-19 22:00:18,151 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 711 transitions. Word has length 31 [2019-11-19 22:00:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:18,151 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 711 transitions. [2019-11-19 22:00:18,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 711 transitions. [2019-11-19 22:00:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 22:00:18,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:18,156 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:18,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:18,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:18,156 INFO L82 PathProgramCache]: Analyzing trace with hash -955605667, now seen corresponding path program 1 times [2019-11-19 22:00:18,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:18,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495087178] [2019-11-19 22:00:18,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-19 22:00:18,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495087178] [2019-11-19 22:00:18,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579038356] [2019-11-19 22:00:18,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:18,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:00:18,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:18,561 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:00:18,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:00:18,567 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:00:18,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:00:18,567 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-19 22:00:18,573 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:00:18,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:00:18,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 12 [2019-11-19 22:00:18,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845348883] [2019-11-19 22:00:18,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:00:18,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:18,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:00:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:18,575 INFO L87 Difference]: Start difference. First operand 459 states and 711 transitions. Second operand 7 states. [2019-11-19 22:00:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:19,820 INFO L93 Difference]: Finished difference Result 1132 states and 2122 transitions. [2019-11-19 22:00:19,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:00:19,821 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-11-19 22:00:19,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:19,876 INFO L225 Difference]: With dead ends: 1132 [2019-11-19 22:00:19,882 INFO L226 Difference]: Without dead ends: 686 [2019-11-19 22:00:19,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:00:19,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-11-19 22:00:19,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 504. [2019-11-19 22:00:19,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-19 22:00:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 814 transitions. [2019-11-19 22:00:19,948 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 814 transitions. Word has length 41 [2019-11-19 22:00:19,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:19,948 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 814 transitions. [2019-11-19 22:00:19,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:00:19,950 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 814 transitions. [2019-11-19 22:00:19,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 22:00:19,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:19,957 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:20,169 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:20,170 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:20,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:20,170 INFO L82 PathProgramCache]: Analyzing trace with hash -794400909, now seen corresponding path program 1 times [2019-11-19 22:00:20,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:20,170 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998294166] [2019-11-19 22:00:20,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:20,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:20,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998294166] [2019-11-19 22:00:20,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922885453] [2019-11-19 22:00:20,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:20,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:00:20,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:20,495 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:20,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:00:20,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-19 22:00:20,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900746524] [2019-11-19 22:00:20,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:00:20,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:00:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:20,497 INFO L87 Difference]: Start difference. First operand 504 states and 814 transitions. Second operand 3 states. [2019-11-19 22:00:20,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:20,538 INFO L93 Difference]: Finished difference Result 1021 states and 1874 transitions. [2019-11-19 22:00:20,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:00:20,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-19 22:00:20,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:20,547 INFO L225 Difference]: With dead ends: 1021 [2019-11-19 22:00:20,547 INFO L226 Difference]: Without dead ends: 528 [2019-11-19 22:00:20,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:20,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-19 22:00:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 504. [2019-11-19 22:00:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-11-19 22:00:20,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 809 transitions. [2019-11-19 22:00:20,601 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 809 transitions. Word has length 41 [2019-11-19 22:00:20,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:20,601 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 809 transitions. [2019-11-19 22:00:20,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:00:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 809 transitions. [2019-11-19 22:00:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:00:20,604 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:20,604 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:20,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:20,808 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:20,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939229, now seen corresponding path program 1 times [2019-11-19 22:00:20,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:20,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448477038] [2019-11-19 22:00:20,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:20,988 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:20,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448477038] [2019-11-19 22:00:20,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762476549] [2019-11-19 22:00:20,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:21,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 22:00:21,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:21,304 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:00:21,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:00:21,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:00:21,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:00:21,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-19 22:00:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-19 22:00:21,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:00:21,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-11-19 22:00:21,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985053] [2019-11-19 22:00:21,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:00:21,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:21,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:00:21,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:00:21,354 INFO L87 Difference]: Start difference. First operand 504 states and 809 transitions. Second operand 7 states. [2019-11-19 22:00:22,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:22,539 INFO L93 Difference]: Finished difference Result 1331 states and 2752 transitions. [2019-11-19 22:00:22,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:00:22,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-11-19 22:00:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:22,554 INFO L225 Difference]: With dead ends: 1331 [2019-11-19 22:00:22,554 INFO L226 Difference]: Without dead ends: 838 [2019-11-19 22:00:22,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:00:22,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-19 22:00:22,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 821. [2019-11-19 22:00:22,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-11-19 22:00:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1597 transitions. [2019-11-19 22:00:22,637 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1597 transitions. Word has length 42 [2019-11-19 22:00:22,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:22,638 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1597 transitions. [2019-11-19 22:00:22,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:00:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1597 transitions. [2019-11-19 22:00:22,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:00:22,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:22,639 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:22,843 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:22,845 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:22,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:22,846 INFO L82 PathProgramCache]: Analyzing trace with hash -948133215, now seen corresponding path program 1 times [2019-11-19 22:00:22,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:22,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895919255] [2019-11-19 22:00:22,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:22,924 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:22,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895919255] [2019-11-19 22:00:22,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:22,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:00:22,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438387572] [2019-11-19 22:00:22,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:00:22,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:22,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:00:22,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:00:22,926 INFO L87 Difference]: Start difference. First operand 821 states and 1597 transitions. Second operand 6 states. [2019-11-19 22:00:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:23,423 INFO L93 Difference]: Finished difference Result 1841 states and 4328 transitions. [2019-11-19 22:00:23,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:00:23,423 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-19 22:00:23,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:23,436 INFO L225 Difference]: With dead ends: 1841 [2019-11-19 22:00:23,437 INFO L226 Difference]: Without dead ends: 1031 [2019-11-19 22:00:23,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:23,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-11-19 22:00:23,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 946. [2019-11-19 22:00:23,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-11-19 22:00:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1807 transitions. [2019-11-19 22:00:23,535 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1807 transitions. Word has length 42 [2019-11-19 22:00:23,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:23,535 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 1807 transitions. [2019-11-19 22:00:23,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:00:23,535 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1807 transitions. [2019-11-19 22:00:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:00:23,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:23,537 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:23,537 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1828765838, now seen corresponding path program 1 times [2019-11-19 22:00:23,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:23,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780306629] [2019-11-19 22:00:23,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:23,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:23,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780306629] [2019-11-19 22:00:23,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:23,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:23,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987579067] [2019-11-19 22:00:23,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:23,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:23,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:23,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:23,636 INFO L87 Difference]: Start difference. First operand 946 states and 1807 transitions. Second operand 8 states. [2019-11-19 22:00:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:24,501 INFO L93 Difference]: Finished difference Result 1942 states and 4567 transitions. [2019-11-19 22:00:24,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:00:24,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-11-19 22:00:24,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:24,515 INFO L225 Difference]: With dead ends: 1942 [2019-11-19 22:00:24,515 INFO L226 Difference]: Without dead ends: 1007 [2019-11-19 22:00:24,527 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:24,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-11-19 22:00:24,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 994. [2019-11-19 22:00:24,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-11-19 22:00:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1869 transitions. [2019-11-19 22:00:24,638 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1869 transitions. Word has length 42 [2019-11-19 22:00:24,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:24,639 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1869 transitions. [2019-11-19 22:00:24,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1869 transitions. [2019-11-19 22:00:24,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:00:24,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:24,641 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:24,641 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:24,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -757221373, now seen corresponding path program 1 times [2019-11-19 22:00:24,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:24,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523061028] [2019-11-19 22:00:24,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:00:24,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523061028] [2019-11-19 22:00:24,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:24,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:00:24,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875296829] [2019-11-19 22:00:24,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:00:24,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:00:24,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:00:24,810 INFO L87 Difference]: Start difference. First operand 994 states and 1869 transitions. Second operand 7 states. [2019-11-19 22:00:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:25,679 INFO L93 Difference]: Finished difference Result 1955 states and 4552 transitions. [2019-11-19 22:00:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:00:25,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-19 22:00:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:25,692 INFO L225 Difference]: With dead ends: 1955 [2019-11-19 22:00:25,692 INFO L226 Difference]: Without dead ends: 972 [2019-11-19 22:00:25,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:25,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-11-19 22:00:25,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 965. [2019-11-19 22:00:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-19 22:00:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1828 transitions. [2019-11-19 22:00:25,782 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1828 transitions. Word has length 43 [2019-11-19 22:00:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:25,782 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1828 transitions. [2019-11-19 22:00:25,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:00:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1828 transitions. [2019-11-19 22:00:25,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-19 22:00:25,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:25,784 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:25,785 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:25,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:25,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1869230798, now seen corresponding path program 1 times [2019-11-19 22:00:25,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:25,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646566944] [2019-11-19 22:00:25,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:25,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:25,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646566944] [2019-11-19 22:00:25,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:25,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:00:25,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40004594] [2019-11-19 22:00:25,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:00:25,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:25,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:00:25,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:00:25,899 INFO L87 Difference]: Start difference. First operand 965 states and 1828 transitions. Second operand 6 states. [2019-11-19 22:00:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:26,856 INFO L93 Difference]: Finished difference Result 2078 states and 4938 transitions. [2019-11-19 22:00:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:00:26,857 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-11-19 22:00:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:26,870 INFO L225 Difference]: With dead ends: 2078 [2019-11-19 22:00:26,871 INFO L226 Difference]: Without dead ends: 1124 [2019-11-19 22:00:26,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:00:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-11-19 22:00:26,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1074. [2019-11-19 22:00:26,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-11-19 22:00:26,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2049 transitions. [2019-11-19 22:00:26,966 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2049 transitions. Word has length 46 [2019-11-19 22:00:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:26,967 INFO L462 AbstractCegarLoop]: Abstraction has 1074 states and 2049 transitions. [2019-11-19 22:00:26,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:00:26,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2049 transitions. [2019-11-19 22:00:26,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-19 22:00:26,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:26,969 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:26,969 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:26,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:26,970 INFO L82 PathProgramCache]: Analyzing trace with hash 214285764, now seen corresponding path program 1 times [2019-11-19 22:00:26,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:26,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676310507] [2019-11-19 22:00:26,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:27,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:27,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676310507] [2019-11-19 22:00:27,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:27,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-19 22:00:27,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991417164] [2019-11-19 22:00:27,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:00:27,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:00:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:00:27,077 INFO L87 Difference]: Start difference. First operand 1074 states and 2049 transitions. Second operand 6 states. [2019-11-19 22:00:28,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:28,152 INFO L93 Difference]: Finished difference Result 2175 states and 5137 transitions. [2019-11-19 22:00:28,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:00:28,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-11-19 22:00:28,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:28,169 INFO L225 Difference]: With dead ends: 2175 [2019-11-19 22:00:28,169 INFO L226 Difference]: Without dead ends: 1112 [2019-11-19 22:00:28,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:00:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2019-11-19 22:00:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1076. [2019-11-19 22:00:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-11-19 22:00:28,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2051 transitions. [2019-11-19 22:00:28,274 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2051 transitions. Word has length 47 [2019-11-19 22:00:28,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:28,275 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2051 transitions. [2019-11-19 22:00:28,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:00:28,275 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2051 transitions. [2019-11-19 22:00:28,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-19 22:00:28,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:28,277 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:28,277 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:28,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:28,278 INFO L82 PathProgramCache]: Analyzing trace with hash 917449758, now seen corresponding path program 1 times [2019-11-19 22:00:28,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:28,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630961884] [2019-11-19 22:00:28,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:28,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:28,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630961884] [2019-11-19 22:00:28,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:28,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:28,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136979914] [2019-11-19 22:00:28,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:28,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:28,392 INFO L87 Difference]: Start difference. First operand 1076 states and 2051 transitions. Second operand 8 states. [2019-11-19 22:00:30,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:30,268 INFO L93 Difference]: Finished difference Result 2241 states and 5387 transitions. [2019-11-19 22:00:30,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:00:30,269 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-11-19 22:00:30,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:30,286 INFO L225 Difference]: With dead ends: 2241 [2019-11-19 22:00:30,286 INFO L226 Difference]: Without dead ends: 1176 [2019-11-19 22:00:30,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:00:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-11-19 22:00:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1139. [2019-11-19 22:00:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-11-19 22:00:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2233 transitions. [2019-11-19 22:00:30,407 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2233 transitions. Word has length 48 [2019-11-19 22:00:30,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:30,408 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 2233 transitions. [2019-11-19 22:00:30,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:30,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2233 transitions. [2019-11-19 22:00:30,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 22:00:30,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:30,411 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:30,411 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:30,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:30,411 INFO L82 PathProgramCache]: Analyzing trace with hash -631761552, now seen corresponding path program 1 times [2019-11-19 22:00:30,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:30,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258946698] [2019-11-19 22:00:30,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:30,608 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 7 [2019-11-19 22:00:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:30,851 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:30,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258946698] [2019-11-19 22:00:30,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:30,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:00:30,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516693074] [2019-11-19 22:00:30,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:00:30,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:00:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:30,853 INFO L87 Difference]: Start difference. First operand 1139 states and 2233 transitions. Second operand 9 states. [2019-11-19 22:00:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:32,562 INFO L93 Difference]: Finished difference Result 2400 states and 5779 transitions. [2019-11-19 22:00:32,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:00:32,562 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-11-19 22:00:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:32,578 INFO L225 Difference]: With dead ends: 2400 [2019-11-19 22:00:32,578 INFO L226 Difference]: Without dead ends: 1272 [2019-11-19 22:00:32,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:00:32,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-11-19 22:00:32,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1240. [2019-11-19 22:00:32,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2019-11-19 22:00:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 2446 transitions. [2019-11-19 22:00:32,687 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 2446 transitions. Word has length 49 [2019-11-19 22:00:32,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:32,687 INFO L462 AbstractCegarLoop]: Abstraction has 1240 states and 2446 transitions. [2019-11-19 22:00:32,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:00:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2446 transitions. [2019-11-19 22:00:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-19 22:00:32,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:32,690 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:32,691 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:32,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:32,691 INFO L82 PathProgramCache]: Analyzing trace with hash -103288946, now seen corresponding path program 1 times [2019-11-19 22:00:32,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:32,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124214675] [2019-11-19 22:00:32,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:32,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:32,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124214675] [2019-11-19 22:00:32,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037101626] [2019-11-19 22:00:32,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:33,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:00:33,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:33,038 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:00:33,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:00:33,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:00:33,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:00:33,041 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-19 22:00:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 22:00:33,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:00:33,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2019-11-19 22:00:33,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174766994] [2019-11-19 22:00:33,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:33,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:33,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:33,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:33,046 INFO L87 Difference]: Start difference. First operand 1240 states and 2446 transitions. Second operand 8 states. [2019-11-19 22:00:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:34,425 INFO L93 Difference]: Finished difference Result 2822 states and 6955 transitions. [2019-11-19 22:00:34,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 22:00:34,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-11-19 22:00:34,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:34,449 INFO L225 Difference]: With dead ends: 2822 [2019-11-19 22:00:34,450 INFO L226 Difference]: Without dead ends: 1593 [2019-11-19 22:00:34,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:34,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2019-11-19 22:00:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1576. [2019-11-19 22:00:34,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-19 22:00:34,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 3168 transitions. [2019-11-19 22:00:34,578 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 3168 transitions. Word has length 54 [2019-11-19 22:00:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:34,578 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 3168 transitions. [2019-11-19 22:00:34,578 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 3168 transitions. [2019-11-19 22:00:34,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-19 22:00:34,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:34,585 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:34,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:34,789 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1596045506, now seen corresponding path program 1 times [2019-11-19 22:00:34,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:34,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281000495] [2019-11-19 22:00:34,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:34,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281000495] [2019-11-19 22:00:34,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:34,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:34,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580927409] [2019-11-19 22:00:34,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:34,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:34,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:34,889 INFO L87 Difference]: Start difference. First operand 1576 states and 3168 transitions. Second operand 8 states. [2019-11-19 22:00:36,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:36,012 INFO L93 Difference]: Finished difference Result 3221 states and 7943 transitions. [2019-11-19 22:00:36,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:00:36,013 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-19 22:00:36,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:36,029 INFO L225 Difference]: With dead ends: 3221 [2019-11-19 22:00:36,029 INFO L226 Difference]: Without dead ends: 1656 [2019-11-19 22:00:36,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2019-11-19 22:00:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1634. [2019-11-19 22:00:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1634 states. [2019-11-19 22:00:36,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 3241 transitions. [2019-11-19 22:00:36,157 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 3241 transitions. Word has length 56 [2019-11-19 22:00:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:36,158 INFO L462 AbstractCegarLoop]: Abstraction has 1634 states and 3241 transitions. [2019-11-19 22:00:36,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:36,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 3241 transitions. [2019-11-19 22:00:36,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 22:00:36,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:36,162 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:36,162 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash -2132825673, now seen corresponding path program 1 times [2019-11-19 22:00:36,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:36,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786972988] [2019-11-19 22:00:36,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:36,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:36,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786972988] [2019-11-19 22:00:36,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:36,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:00:36,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972984211] [2019-11-19 22:00:36,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:00:36,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:36,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:00:36,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:00:36,353 INFO L87 Difference]: Start difference. First operand 1634 states and 3241 transitions. Second operand 7 states. [2019-11-19 22:00:37,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:37,234 INFO L93 Difference]: Finished difference Result 3224 states and 7889 transitions. [2019-11-19 22:00:37,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:00:37,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-19 22:00:37,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:37,263 INFO L225 Difference]: With dead ends: 3224 [2019-11-19 22:00:37,264 INFO L226 Difference]: Without dead ends: 1601 [2019-11-19 22:00:37,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2019-11-19 22:00:37,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1593. [2019-11-19 22:00:37,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-11-19 22:00:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 3184 transitions. [2019-11-19 22:00:37,391 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 3184 transitions. Word has length 57 [2019-11-19 22:00:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:37,392 INFO L462 AbstractCegarLoop]: Abstraction has 1593 states and 3184 transitions. [2019-11-19 22:00:37,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:00:37,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 3184 transitions. [2019-11-19 22:00:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 22:00:37,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:37,396 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:37,396 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:37,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:37,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1385684304, now seen corresponding path program 1 times [2019-11-19 22:00:37,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:37,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330270190] [2019-11-19 22:00:37,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:37,484 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:00:37,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330270190] [2019-11-19 22:00:37,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:37,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:00:37,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582237071] [2019-11-19 22:00:37,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:00:37,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:37,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:00:37,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:00:37,486 INFO L87 Difference]: Start difference. First operand 1593 states and 3184 transitions. Second operand 4 states. [2019-11-19 22:00:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:37,578 INFO L93 Difference]: Finished difference Result 3185 states and 7905 transitions. [2019-11-19 22:00:37,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:00:37,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-11-19 22:00:37,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:37,595 INFO L225 Difference]: With dead ends: 3185 [2019-11-19 22:00:37,595 INFO L226 Difference]: Without dead ends: 1603 [2019-11-19 22:00:37,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:00:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2019-11-19 22:00:37,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1593. [2019-11-19 22:00:37,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1593 states. [2019-11-19 22:00:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 3177 transitions. [2019-11-19 22:00:37,720 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 3177 transitions. Word has length 57 [2019-11-19 22:00:37,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:37,721 INFO L462 AbstractCegarLoop]: Abstraction has 1593 states and 3177 transitions. [2019-11-19 22:00:37,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:00:37,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 3177 transitions. [2019-11-19 22:00:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-19 22:00:37,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:37,730 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:37,731 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:37,731 INFO L82 PathProgramCache]: Analyzing trace with hash 33936865, now seen corresponding path program 1 times [2019-11-19 22:00:37,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:37,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974469] [2019-11-19 22:00:37,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:00:37,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974469] [2019-11-19 22:00:37,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:37,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:00:37,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419588830] [2019-11-19 22:00:37,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:00:37,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:37,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:00:37,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:00:37,852 INFO L87 Difference]: Start difference. First operand 1593 states and 3177 transitions. Second operand 7 states. [2019-11-19 22:00:38,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:38,531 INFO L93 Difference]: Finished difference Result 2949 states and 6843 transitions. [2019-11-19 22:00:38,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:00:38,532 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-11-19 22:00:38,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:38,539 INFO L225 Difference]: With dead ends: 2949 [2019-11-19 22:00:38,539 INFO L226 Difference]: Without dead ends: 1367 [2019-11-19 22:00:38,547 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:38,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-11-19 22:00:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1350. [2019-11-19 22:00:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1350 states. [2019-11-19 22:00:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1350 states to 1350 states and 2399 transitions. [2019-11-19 22:00:38,630 INFO L78 Accepts]: Start accepts. Automaton has 1350 states and 2399 transitions. Word has length 57 [2019-11-19 22:00:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:38,630 INFO L462 AbstractCegarLoop]: Abstraction has 1350 states and 2399 transitions. [2019-11-19 22:00:38,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:00:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1350 states and 2399 transitions. [2019-11-19 22:00:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 22:00:38,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:38,635 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 22:00:38,635 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:38,636 INFO L82 PathProgramCache]: Analyzing trace with hash 171104757, now seen corresponding path program 1 times [2019-11-19 22:00:38,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:38,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28150577] [2019-11-19 22:00:38,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:38,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:38,788 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 22:00:38,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28150577] [2019-11-19 22:00:38,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:38,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:00:38,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676505927] [2019-11-19 22:00:38,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:38,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:00:38,790 INFO L87 Difference]: Start difference. First operand 1350 states and 2399 transitions. Second operand 8 states. [2019-11-19 22:00:39,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:39,778 INFO L93 Difference]: Finished difference Result 2983 states and 6775 transitions. [2019-11-19 22:00:39,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:00:39,779 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-19 22:00:39,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:39,793 INFO L225 Difference]: With dead ends: 2983 [2019-11-19 22:00:39,793 INFO L226 Difference]: Without dead ends: 1644 [2019-11-19 22:00:39,801 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2019-11-19 22:00:39,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1601. [2019-11-19 22:00:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1601 states. [2019-11-19 22:00:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 3116 transitions. [2019-11-19 22:00:39,921 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 3116 transitions. Word has length 58 [2019-11-19 22:00:39,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:39,922 INFO L462 AbstractCegarLoop]: Abstraction has 1601 states and 3116 transitions. [2019-11-19 22:00:39,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:39,922 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 3116 transitions. [2019-11-19 22:00:39,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 22:00:39,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:39,930 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:39,931 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:39,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:39,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1490051206, now seen corresponding path program 1 times [2019-11-19 22:00:39,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:39,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798995982] [2019-11-19 22:00:39,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:39,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:40,110 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-19 22:00:40,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798995982] [2019-11-19 22:00:40,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:40,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:00:40,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332307379] [2019-11-19 22:00:40,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:00:40,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:40,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:00:40,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:40,113 INFO L87 Difference]: Start difference. First operand 1601 states and 3116 transitions. Second operand 9 states. [2019-11-19 22:00:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:41,753 INFO L93 Difference]: Finished difference Result 3259 states and 7752 transitions. [2019-11-19 22:00:41,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:00:41,754 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-19 22:00:41,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:41,769 INFO L225 Difference]: With dead ends: 3259 [2019-11-19 22:00:41,769 INFO L226 Difference]: Without dead ends: 1669 [2019-11-19 22:00:41,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:00:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2019-11-19 22:00:41,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1617. [2019-11-19 22:00:41,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-11-19 22:00:41,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 3133 transitions. [2019-11-19 22:00:41,899 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 3133 transitions. Word has length 66 [2019-11-19 22:00:41,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:41,900 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 3133 transitions. [2019-11-19 22:00:41,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:00:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 3133 transitions. [2019-11-19 22:00:41,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 22:00:41,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:41,906 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:41,907 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:41,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:41,907 INFO L82 PathProgramCache]: Analyzing trace with hash 181261759, now seen corresponding path program 1 times [2019-11-19 22:00:41,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:41,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85438492] [2019-11-19 22:00:41,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:41,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:41,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,180 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-19 22:00:42,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85438492] [2019-11-19 22:00:42,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087613562] [2019-11-19 22:00:42,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:42,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:00:42,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:42,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 16 treesize of output 8 [2019-11-19 22:00:42,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:00:42,403 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:00:42,403 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:00:42,403 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-19 22:00:42,436 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-19 22:00:42,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:00:42,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-19 22:00:42,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741766779] [2019-11-19 22:00:42,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:00:42,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:42,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:00:42,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:00:42,439 INFO L87 Difference]: Start difference. First operand 1617 states and 3133 transitions. Second operand 14 states. [2019-11-19 22:00:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:44,976 INFO L93 Difference]: Finished difference Result 4614 states and 12685 transitions. [2019-11-19 22:00:44,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-19 22:00:44,977 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 83 [2019-11-19 22:00:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:45,017 INFO L225 Difference]: With dead ends: 4614 [2019-11-19 22:00:45,017 INFO L226 Difference]: Without dead ends: 3008 [2019-11-19 22:00:45,029 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=677, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:00:45,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3008 states. [2019-11-19 22:00:45,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3008 to 2968. [2019-11-19 22:00:45,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2968 states. [2019-11-19 22:00:45,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 7299 transitions. [2019-11-19 22:00:45,391 INFO L78 Accepts]: Start accepts. Automaton has 2968 states and 7299 transitions. Word has length 83 [2019-11-19 22:00:45,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:45,391 INFO L462 AbstractCegarLoop]: Abstraction has 2968 states and 7299 transitions. [2019-11-19 22:00:45,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:00:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2968 states and 7299 transitions. [2019-11-19 22:00:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 22:00:45,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:45,403 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:45,613 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:45,614 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:45,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:45,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1980409257, now seen corresponding path program 1 times [2019-11-19 22:00:45,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:45,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77543268] [2019-11-19 22:00:45,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:45,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:45,819 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 22:00:45,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77543268] [2019-11-19 22:00:45,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:45,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:00:45,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851558696] [2019-11-19 22:00:45,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:00:45,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:45,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:00:45,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:00:45,823 INFO L87 Difference]: Start difference. First operand 2968 states and 7299 transitions. Second operand 9 states. [2019-11-19 22:00:47,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:47,308 INFO L93 Difference]: Finished difference Result 5977 states and 19074 transitions. [2019-11-19 22:00:47,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:00:47,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-11-19 22:00:47,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:47,348 INFO L225 Difference]: With dead ends: 5977 [2019-11-19 22:00:47,348 INFO L226 Difference]: Without dead ends: 3020 [2019-11-19 22:00:47,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:00:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2019-11-19 22:00:47,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 2987. [2019-11-19 22:00:47,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2019-11-19 22:00:47,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 7363 transitions. [2019-11-19 22:00:47,610 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 7363 transitions. Word has length 66 [2019-11-19 22:00:47,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:47,610 INFO L462 AbstractCegarLoop]: Abstraction has 2987 states and 7363 transitions. [2019-11-19 22:00:47,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:00:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 7363 transitions. [2019-11-19 22:00:47,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 22:00:47,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:47,622 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:47,622 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:47,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1499328999, now seen corresponding path program 1 times [2019-11-19 22:00:47,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:47,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010759634] [2019-11-19 22:00:47,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-19 22:00:47,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010759634] [2019-11-19 22:00:47,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:47,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:00:47,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127478146] [2019-11-19 22:00:47,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:00:47,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:47,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:00:47,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:00:47,712 INFO L87 Difference]: Start difference. First operand 2987 states and 7363 transitions. Second operand 4 states. [2019-11-19 22:00:48,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:48,379 INFO L93 Difference]: Finished difference Result 6066 states and 19691 transitions. [2019-11-19 22:00:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:00:48,379 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-19 22:00:48,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:48,411 INFO L225 Difference]: With dead ends: 6066 [2019-11-19 22:00:48,411 INFO L226 Difference]: Without dead ends: 3090 [2019-11-19 22:00:48,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:00:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2019-11-19 22:00:48,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 3075. [2019-11-19 22:00:48,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3075 states. [2019-11-19 22:00:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 7921 transitions. [2019-11-19 22:00:48,717 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 7921 transitions. Word has length 66 [2019-11-19 22:00:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:48,718 INFO L462 AbstractCegarLoop]: Abstraction has 3075 states and 7921 transitions. [2019-11-19 22:00:48,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:00:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 7921 transitions. [2019-11-19 22:00:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-19 22:00:48,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:48,731 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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-11-19 22:00:48,732 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:48,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1099686263, now seen corresponding path program 1 times [2019-11-19 22:00:48,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:48,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34280892] [2019-11-19 22:00:48,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:49,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:49,053 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-19 22:00:49,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34280892] [2019-11-19 22:00:49,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:49,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-19 22:00:49,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571756955] [2019-11-19 22:00:49,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:00:49,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:49,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:00:49,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:00:49,056 INFO L87 Difference]: Start difference. First operand 3075 states and 7921 transitions. Second operand 10 states. [2019-11-19 22:00:50,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:50,217 INFO L93 Difference]: Finished difference Result 6160 states and 15906 transitions. [2019-11-19 22:00:50,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:00:50,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-11-19 22:00:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:50,247 INFO L225 Difference]: With dead ends: 6160 [2019-11-19 22:00:50,248 INFO L226 Difference]: Without dead ends: 3096 [2019-11-19 22:00:50,265 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:00:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3096 states. [2019-11-19 22:00:50,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3096 to 3081. [2019-11-19 22:00:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3081 states. [2019-11-19 22:00:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 7927 transitions. [2019-11-19 22:00:50,558 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 7927 transitions. Word has length 67 [2019-11-19 22:00:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:50,558 INFO L462 AbstractCegarLoop]: Abstraction has 3081 states and 7927 transitions. [2019-11-19 22:00:50,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:00:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 7927 transitions. [2019-11-19 22:00:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-19 22:00:50,568 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:50,569 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:50,569 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:50,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1264633415, now seen corresponding path program 1 times [2019-11-19 22:00:50,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:50,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617944197] [2019-11-19 22:00:50,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:50,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:00:50,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617944197] [2019-11-19 22:00:50,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:50,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-19 22:00:50,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350471001] [2019-11-19 22:00:50,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:00:50,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:00:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:50,819 INFO L87 Difference]: Start difference. First operand 3081 states and 7927 transitions. Second operand 12 states. [2019-11-19 22:00:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:52,181 INFO L93 Difference]: Finished difference Result 6187 states and 20777 transitions. [2019-11-19 22:00:52,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:00:52,182 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 88 [2019-11-19 22:00:52,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:52,220 INFO L225 Difference]: With dead ends: 6187 [2019-11-19 22:00:52,220 INFO L226 Difference]: Without dead ends: 3123 [2019-11-19 22:00:52,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:00:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2019-11-19 22:00:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3086. [2019-11-19 22:00:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3086 states. [2019-11-19 22:00:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3086 states to 3086 states and 7934 transitions. [2019-11-19 22:00:52,487 INFO L78 Accepts]: Start accepts. Automaton has 3086 states and 7934 transitions. Word has length 88 [2019-11-19 22:00:52,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:52,487 INFO L462 AbstractCegarLoop]: Abstraction has 3086 states and 7934 transitions. [2019-11-19 22:00:52,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:00:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3086 states and 7934 transitions. [2019-11-19 22:00:52,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 22:00:52,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:52,497 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:52,497 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:52,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:52,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1105749479, now seen corresponding path program 1 times [2019-11-19 22:00:52,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:52,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859819300] [2019-11-19 22:00:52,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:52,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 22:00:52,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859819300] [2019-11-19 22:00:52,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:52,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-19 22:00:52,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137041512] [2019-11-19 22:00:52,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:00:52,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:00:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:00:52,709 INFO L87 Difference]: Start difference. First operand 3086 states and 7934 transitions. Second operand 12 states. [2019-11-19 22:00:54,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:54,381 INFO L93 Difference]: Finished difference Result 6194 states and 20786 transitions. [2019-11-19 22:00:54,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:00:54,382 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 83 [2019-11-19 22:00:54,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:54,416 INFO L225 Difference]: With dead ends: 6194 [2019-11-19 22:00:54,416 INFO L226 Difference]: Without dead ends: 3125 [2019-11-19 22:00:54,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:00:54,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2019-11-19 22:00:54,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3088. [2019-11-19 22:00:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3088 states. [2019-11-19 22:00:54,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3088 states to 3088 states and 7936 transitions. [2019-11-19 22:00:54,684 INFO L78 Accepts]: Start accepts. Automaton has 3088 states and 7936 transitions. Word has length 83 [2019-11-19 22:00:54,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:54,685 INFO L462 AbstractCegarLoop]: Abstraction has 3088 states and 7936 transitions. [2019-11-19 22:00:54,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:00:54,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3088 states and 7936 transitions. [2019-11-19 22:00:54,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-19 22:00:54,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:54,702 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:54,702 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:54,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:54,703 INFO L82 PathProgramCache]: Analyzing trace with hash 31375875, now seen corresponding path program 1 times [2019-11-19 22:00:54,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:54,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645090734] [2019-11-19 22:00:54,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:54,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:54,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 43 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-19 22:00:54,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645090734] [2019-11-19 22:00:54,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201244532] [2019-11-19 22:00:54,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:55,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:00:55,063 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:55,185 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-19 22:00:55,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:00:55,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2019-11-19 22:00:55,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293757395] [2019-11-19 22:00:55,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:00:55,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:55,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:00:55,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:00:55,187 INFO L87 Difference]: Start difference. First operand 3088 states and 7936 transitions. Second operand 8 states. [2019-11-19 22:00:55,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:55,427 INFO L93 Difference]: Finished difference Result 6237 states and 20930 transitions. [2019-11-19 22:00:55,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:00:55,428 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2019-11-19 22:00:55,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:55,464 INFO L225 Difference]: With dead ends: 6237 [2019-11-19 22:00:55,464 INFO L226 Difference]: Without dead ends: 3166 [2019-11-19 22:00:55,491 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:00:55,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3166 states. [2019-11-19 22:00:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3166 to 3138. [2019-11-19 22:00:55,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3138 states. [2019-11-19 22:00:55,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3138 states to 3138 states and 8001 transitions. [2019-11-19 22:00:55,755 INFO L78 Accepts]: Start accepts. Automaton has 3138 states and 8001 transitions. Word has length 112 [2019-11-19 22:00:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:55,755 INFO L462 AbstractCegarLoop]: Abstraction has 3138 states and 8001 transitions. [2019-11-19 22:00:55,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:00:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 3138 states and 8001 transitions. [2019-11-19 22:00:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 22:00:55,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:55,766 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:55,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:55,978 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:55,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:55,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1049156063, now seen corresponding path program 1 times [2019-11-19 22:00:55,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:55,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680764473] [2019-11-19 22:00:55,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:56,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-19 22:00:56,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680764473] [2019-11-19 22:00:56,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829106671] [2019-11-19 22:00:56,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:56,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:00:56,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:00:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 22:00:56,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:00:56,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 10 [2019-11-19 22:00:56,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836509065] [2019-11-19 22:00:56,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:00:56,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:56,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:00:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:00:56,403 INFO L87 Difference]: Start difference. First operand 3138 states and 8001 transitions. Second operand 10 states. [2019-11-19 22:00:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:57,879 INFO L93 Difference]: Finished difference Result 6262 states and 20872 transitions. [2019-11-19 22:00:57,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:00:57,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 83 [2019-11-19 22:00:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:57,912 INFO L225 Difference]: With dead ends: 6262 [2019-11-19 22:00:57,912 INFO L226 Difference]: Without dead ends: 3141 [2019-11-19 22:00:57,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:00:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3141 states. [2019-11-19 22:00:58,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3141 to 3108. [2019-11-19 22:00:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3108 states. [2019-11-19 22:00:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 7921 transitions. [2019-11-19 22:00:58,324 INFO L78 Accepts]: Start accepts. Automaton has 3108 states and 7921 transitions. Word has length 83 [2019-11-19 22:00:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:00:58,324 INFO L462 AbstractCegarLoop]: Abstraction has 3108 states and 7921 transitions. [2019-11-19 22:00:58,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:00:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3108 states and 7921 transitions. [2019-11-19 22:00:58,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-19 22:00:58,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:00:58,328 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:00:58,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:00:58,533 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:00:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:00:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 142128152, now seen corresponding path program 1 times [2019-11-19 22:00:58,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:00:58,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766458690] [2019-11-19 22:00:58,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:00:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:58,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:00:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-19 22:00:58,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766458690] [2019-11-19 22:00:58,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:00:58,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 22:00:58,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384043631] [2019-11-19 22:00:58,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:00:58,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:00:58,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:00:58,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:00:58,706 INFO L87 Difference]: Start difference. First operand 3108 states and 7921 transitions. Second operand 11 states. [2019-11-19 22:00:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:00:59,806 INFO L93 Difference]: Finished difference Result 6253 states and 20762 transitions. [2019-11-19 22:00:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:00:59,806 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 87 [2019-11-19 22:00:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:00:59,838 INFO L225 Difference]: With dead ends: 6253 [2019-11-19 22:00:59,838 INFO L226 Difference]: Without dead ends: 3162 [2019-11-19 22:00:59,865 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:00:59,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2019-11-19 22:01:00,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3118. [2019-11-19 22:01:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3118 states. [2019-11-19 22:01:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 7953 transitions. [2019-11-19 22:01:00,079 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 7953 transitions. Word has length 87 [2019-11-19 22:01:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:00,080 INFO L462 AbstractCegarLoop]: Abstraction has 3118 states and 7953 transitions. [2019-11-19 22:01:00,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:01:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 7953 transitions. [2019-11-19 22:01:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:01:00,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:00,083 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:00,083 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1507403246, now seen corresponding path program 1 times [2019-11-19 22:01:00,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:00,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048125519] [2019-11-19 22:01:00,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:00,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 22:01:00,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048125519] [2019-11-19 22:01:00,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:00,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 22:01:00,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431018518] [2019-11-19 22:01:00,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:01:00,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:00,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:01:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:01:00,257 INFO L87 Difference]: Start difference. First operand 3118 states and 7953 transitions. Second operand 11 states. [2019-11-19 22:01:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:01,536 INFO L93 Difference]: Finished difference Result 6263 states and 20794 transitions. [2019-11-19 22:01:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:01:01,537 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-11-19 22:01:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:01,563 INFO L225 Difference]: With dead ends: 6263 [2019-11-19 22:01:01,563 INFO L226 Difference]: Without dead ends: 3162 [2019-11-19 22:01:01,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:01:01,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3162 states. [2019-11-19 22:01:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3162 to 3116. [2019-11-19 22:01:01,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3116 states. [2019-11-19 22:01:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3116 states to 3116 states and 7949 transitions. [2019-11-19 22:01:01,769 INFO L78 Accepts]: Start accepts. Automaton has 3116 states and 7949 transitions. Word has length 86 [2019-11-19 22:01:01,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:01,769 INFO L462 AbstractCegarLoop]: Abstraction has 3116 states and 7949 transitions. [2019-11-19 22:01:01,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:01:01,769 INFO L276 IsEmpty]: Start isEmpty. Operand 3116 states and 7949 transitions. [2019-11-19 22:01:01,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 22:01:01,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:01,779 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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-11-19 22:01:01,779 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:01,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:01,780 INFO L82 PathProgramCache]: Analyzing trace with hash 488053929, now seen corresponding path program 1 times [2019-11-19 22:01:01,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:01,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962236253] [2019-11-19 22:01:01,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:01,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:01,965 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-19 22:01:01,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962236253] [2019-11-19 22:01:01,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:01,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:01:01,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780011065] [2019-11-19 22:01:01,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:01:01,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:01,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:01:01,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:01:01,967 INFO L87 Difference]: Start difference. First operand 3116 states and 7949 transitions. Second operand 8 states. [2019-11-19 22:01:03,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:03,464 INFO L93 Difference]: Finished difference Result 6264 states and 20894 transitions. [2019-11-19 22:01:03,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:01:03,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-11-19 22:01:03,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:03,494 INFO L225 Difference]: With dead ends: 6264 [2019-11-19 22:01:03,494 INFO L226 Difference]: Without dead ends: 3155 [2019-11-19 22:01:03,514 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:01:03,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2019-11-19 22:01:03,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3126. [2019-11-19 22:01:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2019-11-19 22:01:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 7981 transitions. [2019-11-19 22:01:03,709 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 7981 transitions. Word has length 82 [2019-11-19 22:01:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:03,709 INFO L462 AbstractCegarLoop]: Abstraction has 3126 states and 7981 transitions. [2019-11-19 22:01:03,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:01:03,709 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 7981 transitions. [2019-11-19 22:01:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 22:01:03,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:03,716 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 5, 5, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:03,716 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:03,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:03,717 INFO L82 PathProgramCache]: Analyzing trace with hash 377864688, now seen corresponding path program 1 times [2019-11-19 22:01:03,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:03,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240217305] [2019-11-19 22:01:03,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 93 proven. 27 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-11-19 22:01:04,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240217305] [2019-11-19 22:01:04,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286734597] [2019-11-19 22:01:04,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:04,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 1069 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:01:04,286 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:04,328 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-19 22:01:04,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:01:04,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-11-19 22:01:04,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635376425] [2019-11-19 22:01:04,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:01:04,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:04,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:01:04,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:01:04,331 INFO L87 Difference]: Start difference. First operand 3126 states and 7981 transitions. Second operand 3 states. [2019-11-19 22:01:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:04,474 INFO L93 Difference]: Finished difference Result 6323 states and 21425 transitions. [2019-11-19 22:01:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:01:04,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-19 22:01:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:04,521 INFO L225 Difference]: With dead ends: 6323 [2019-11-19 22:01:04,521 INFO L226 Difference]: Without dead ends: 3214 [2019-11-19 22:01:04,552 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 174 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:01:04,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2019-11-19 22:01:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3126. [2019-11-19 22:01:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2019-11-19 22:01:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 7978 transitions. [2019-11-19 22:01:04,832 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 7978 transitions. Word has length 158 [2019-11-19 22:01:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:04,833 INFO L462 AbstractCegarLoop]: Abstraction has 3126 states and 7978 transitions. [2019-11-19 22:01:04,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:01:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 7978 transitions. [2019-11-19 22:01:04,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:01:04,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:04,842 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:05,047 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:05,047 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:05,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1917960229, now seen corresponding path program 1 times [2019-11-19 22:01:05,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:05,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8715245] [2019-11-19 22:01:05,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-19 22:01:05,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8715245] [2019-11-19 22:01:05,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:05,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:01:05,311 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218123597] [2019-11-19 22:01:05,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:01:05,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:05,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:01:05,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:01:05,312 INFO L87 Difference]: Start difference. First operand 3126 states and 7978 transitions. Second operand 9 states. [2019-11-19 22:01:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:06,603 INFO L93 Difference]: Finished difference Result 6278 states and 21023 transitions. [2019-11-19 22:01:06,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:01:06,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:01:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:06,652 INFO L225 Difference]: With dead ends: 6278 [2019-11-19 22:01:06,652 INFO L226 Difference]: Without dead ends: 3154 [2019-11-19 22:01:06,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:01:06,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3154 states. [2019-11-19 22:01:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3154 to 3111. [2019-11-19 22:01:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3111 states. [2019-11-19 22:01:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 7960 transitions. [2019-11-19 22:01:07,054 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 7960 transitions. Word has length 118 [2019-11-19 22:01:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:07,054 INFO L462 AbstractCegarLoop]: Abstraction has 3111 states and 7960 transitions. [2019-11-19 22:01:07,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:01:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 7960 transitions. [2019-11-19 22:01:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-19 22:01:07,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:07,061 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:07,061 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:07,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash -241140553, now seen corresponding path program 1 times [2019-11-19 22:01:07,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:07,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689864725] [2019-11-19 22:01:07,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,396 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 58 proven. 1 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-19 22:01:07,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689864725] [2019-11-19 22:01:07,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335006726] [2019-11-19 22:01:07,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:07,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-19 22:01:07,635 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 45 proven. 3 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-19 22:01:07,744 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:07,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 18 [2019-11-19 22:01:07,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86954248] [2019-11-19 22:01:07,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:01:07,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:07,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:01:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:01:07,746 INFO L87 Difference]: Start difference. First operand 3111 states and 7960 transitions. Second operand 18 states. [2019-11-19 22:01:09,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:09,422 INFO L93 Difference]: Finished difference Result 6301 states and 20943 transitions. [2019-11-19 22:01:09,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 22:01:09,423 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 141 [2019-11-19 22:01:09,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:09,459 INFO L225 Difference]: With dead ends: 6301 [2019-11-19 22:01:09,459 INFO L226 Difference]: Without dead ends: 3207 [2019-11-19 22:01:09,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:01:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3207 states. [2019-11-19 22:01:09,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3207 to 3173. [2019-11-19 22:01:09,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3173 states. [2019-11-19 22:01:09,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3173 states to 3173 states and 8070 transitions. [2019-11-19 22:01:09,673 INFO L78 Accepts]: Start accepts. Automaton has 3173 states and 8070 transitions. Word has length 141 [2019-11-19 22:01:09,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:09,673 INFO L462 AbstractCegarLoop]: Abstraction has 3173 states and 8070 transitions. [2019-11-19 22:01:09,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 22:01:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 3173 states and 8070 transitions. [2019-11-19 22:01:09,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-19 22:01:09,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:09,681 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:09,881 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:09,881 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:09,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:09,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1993966444, now seen corresponding path program 1 times [2019-11-19 22:01:09,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:09,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106903609] [2019-11-19 22:01:09,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 56 proven. 1 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-19 22:01:10,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106903609] [2019-11-19 22:01:10,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300830535] [2019-11-19 22:01:10,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:10,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:10,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 984 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:01:10,447 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-19 22:01:10,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:01:10,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2019-11-19 22:01:10,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274379669] [2019-11-19 22:01:10,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:01:10,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:10,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:01:10,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:01:10,563 INFO L87 Difference]: Start difference. First operand 3173 states and 8070 transitions. Second operand 8 states. [2019-11-19 22:01:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:10,772 INFO L93 Difference]: Finished difference Result 6361 states and 21116 transitions. [2019-11-19 22:01:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:01:10,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 146 [2019-11-19 22:01:10,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:10,803 INFO L225 Difference]: With dead ends: 6361 [2019-11-19 22:01:10,803 INFO L226 Difference]: Without dead ends: 3205 [2019-11-19 22:01:10,823 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=459, Unknown=0, NotChecked=0, Total=506 [2019-11-19 22:01:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2019-11-19 22:01:11,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3177. [2019-11-19 22:01:11,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3177 states. [2019-11-19 22:01:11,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3177 states to 3177 states and 8074 transitions. [2019-11-19 22:01:11,179 INFO L78 Accepts]: Start accepts. Automaton has 3177 states and 8074 transitions. Word has length 146 [2019-11-19 22:01:11,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:11,179 INFO L462 AbstractCegarLoop]: Abstraction has 3177 states and 8074 transitions. [2019-11-19 22:01:11,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:01:11,180 INFO L276 IsEmpty]: Start isEmpty. Operand 3177 states and 8074 transitions. [2019-11-19 22:01:11,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 22:01:11,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:11,188 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:11,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:11,392 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:11,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:11,392 INFO L82 PathProgramCache]: Analyzing trace with hash 497969066, now seen corresponding path program 1 times [2019-11-19 22:01:11,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:11,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302822878] [2019-11-19 22:01:11,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:11,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:11,672 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-11-19 22:01:11,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302822878] [2019-11-19 22:01:11,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:11,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-11-19 22:01:11,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340224951] [2019-11-19 22:01:11,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 22:01:11,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:11,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:01:11,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:01:11,675 INFO L87 Difference]: Start difference. First operand 3177 states and 8074 transitions. Second operand 15 states. [2019-11-19 22:01:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:13,030 INFO L93 Difference]: Finished difference Result 6373 states and 21033 transitions. [2019-11-19 22:01:13,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:01:13,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 111 [2019-11-19 22:01:13,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:13,062 INFO L225 Difference]: With dead ends: 6373 [2019-11-19 22:01:13,062 INFO L226 Difference]: Without dead ends: 3213 [2019-11-19 22:01:13,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:01:13,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3213 states. [2019-11-19 22:01:13,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3213 to 3176. [2019-11-19 22:01:13,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-11-19 22:01:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 8071 transitions. [2019-11-19 22:01:13,260 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 8071 transitions. Word has length 111 [2019-11-19 22:01:13,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:13,260 INFO L462 AbstractCegarLoop]: Abstraction has 3176 states and 8071 transitions. [2019-11-19 22:01:13,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 22:01:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 8071 transitions. [2019-11-19 22:01:13,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-11-19 22:01:13,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:13,270 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:13,270 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:13,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:13,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1970562706, now seen corresponding path program 1 times [2019-11-19 22:01:13,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:13,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927974023] [2019-11-19 22:01:13,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,638 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 153 proven. 31 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-19 22:01:13,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927974023] [2019-11-19 22:01:13,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867626894] [2019-11-19 22:01:13,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:13,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 1194 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 22:01:13,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:13,960 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 7 treesize of output 3 [2019-11-19 22:01:13,960 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:13,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:01:13,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:01:13,962 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-19 22:01:13,996 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:01:13,996 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:14,000 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:01:14,000 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:01:14,000 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-11-19 22:01:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-19 22:01:14,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:01:14,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2019-11-19 22:01:14,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555967574] [2019-11-19 22:01:14,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:01:14,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:14,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:01:14,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:01:14,051 INFO L87 Difference]: Start difference. First operand 3176 states and 8071 transitions. Second operand 8 states. [2019-11-19 22:01:15,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:15,411 INFO L93 Difference]: Finished difference Result 6339 states and 20769 transitions. [2019-11-19 22:01:15,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:01:15,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 195 [2019-11-19 22:01:15,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:15,444 INFO L225 Difference]: With dead ends: 6339 [2019-11-19 22:01:15,444 INFO L226 Difference]: Without dead ends: 3180 [2019-11-19 22:01:15,465 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 222 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:01:15,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2019-11-19 22:01:15,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 3157. [2019-11-19 22:01:15,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2019-11-19 22:01:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 7930 transitions. [2019-11-19 22:01:15,661 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 7930 transitions. Word has length 195 [2019-11-19 22:01:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:15,661 INFO L462 AbstractCegarLoop]: Abstraction has 3157 states and 7930 transitions. [2019-11-19 22:01:15,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:01:15,661 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 7930 transitions. [2019-11-19 22:01:15,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 22:01:15,667 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:15,667 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:15,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:15,868 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:15,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:15,868 INFO L82 PathProgramCache]: Analyzing trace with hash -995435054, now seen corresponding path program 1 times [2019-11-19 22:01:15,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:15,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639195516] [2019-11-19 22:01:15,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:15,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-11-19 22:01:16,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639195516] [2019-11-19 22:01:16,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:16,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:01:16,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221370723] [2019-11-19 22:01:16,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:01:16,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:16,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:01:16,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:01:16,215 INFO L87 Difference]: Start difference. First operand 3157 states and 7930 transitions. Second operand 9 states. [2019-11-19 22:01:17,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:17,834 INFO L93 Difference]: Finished difference Result 6316 states and 20621 transitions. [2019-11-19 22:01:17,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:01:17,834 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-11-19 22:01:17,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:17,864 INFO L225 Difference]: With dead ends: 6316 [2019-11-19 22:01:17,864 INFO L226 Difference]: Without dead ends: 3167 [2019-11-19 22:01:17,883 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:01:17,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2019-11-19 22:01:18,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3148. [2019-11-19 22:01:18,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3148 states. [2019-11-19 22:01:18,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 7920 transitions. [2019-11-19 22:01:18,063 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 7920 transitions. Word has length 144 [2019-11-19 22:01:18,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:18,064 INFO L462 AbstractCegarLoop]: Abstraction has 3148 states and 7920 transitions. [2019-11-19 22:01:18,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:01:18,064 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 7920 transitions. [2019-11-19 22:01:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-19 22:01:18,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:18,070 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 5, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:18,070 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:18,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -826419542, now seen corresponding path program 1 times [2019-11-19 22:01:18,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:18,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934635120] [2019-11-19 22:01:18,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 94 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-19 22:01:18,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934635120] [2019-11-19 22:01:18,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496733055] [2019-11-19 22:01:18,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:18,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:01:18,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:18,981 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 31 proven. 6 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-19 22:01:18,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:18,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 6] total 19 [2019-11-19 22:01:18,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336738208] [2019-11-19 22:01:18,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-19 22:01:18,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:18,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-19 22:01:18,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:01:18,984 INFO L87 Difference]: Start difference. First operand 3148 states and 7920 transitions. Second operand 19 states. [2019-11-19 22:01:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:21,713 INFO L93 Difference]: Finished difference Result 6330 states and 20742 transitions. [2019-11-19 22:01:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-19 22:01:21,714 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 156 [2019-11-19 22:01:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:21,749 INFO L225 Difference]: With dead ends: 6330 [2019-11-19 22:01:21,749 INFO L226 Difference]: Without dead ends: 3199 [2019-11-19 22:01:21,770 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 168 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-11-19 22:01:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3199 states. [2019-11-19 22:01:21,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3199 to 3158. [2019-11-19 22:01:21,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3158 states. [2019-11-19 22:01:21,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 7840 transitions. [2019-11-19 22:01:21,982 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 7840 transitions. Word has length 156 [2019-11-19 22:01:21,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:21,983 INFO L462 AbstractCegarLoop]: Abstraction has 3158 states and 7840 transitions. [2019-11-19 22:01:21,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-19 22:01:21,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 7840 transitions. [2019-11-19 22:01:21,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-19 22:01:21,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:21,990 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:22,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:22,190 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1716840078, now seen corresponding path program 1 times [2019-11-19 22:01:22,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:22,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146638355] [2019-11-19 22:01:22,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:22,432 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-11-19 22:01:22,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146638355] [2019-11-19 22:01:22,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:22,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-19 22:01:22,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262275513] [2019-11-19 22:01:22,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:01:22,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:22,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:01:22,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:01:22,434 INFO L87 Difference]: Start difference. First operand 3158 states and 7840 transitions. Second operand 9 states. [2019-11-19 22:01:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:23,825 INFO L93 Difference]: Finished difference Result 6317 states and 20352 transitions. [2019-11-19 22:01:23,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:01:23,826 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 138 [2019-11-19 22:01:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:23,869 INFO L225 Difference]: With dead ends: 6317 [2019-11-19 22:01:23,869 INFO L226 Difference]: Without dead ends: 3167 [2019-11-19 22:01:23,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:01:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3167 states. [2019-11-19 22:01:24,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3167 to 3145. [2019-11-19 22:01:24,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2019-11-19 22:01:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 7803 transitions. [2019-11-19 22:01:24,083 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 7803 transitions. Word has length 138 [2019-11-19 22:01:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:24,083 INFO L462 AbstractCegarLoop]: Abstraction has 3145 states and 7803 transitions. [2019-11-19 22:01:24,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:01:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 7803 transitions. [2019-11-19 22:01:24,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-19 22:01:24,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:24,091 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:24,091 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:24,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:24,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1454651067, now seen corresponding path program 1 times [2019-11-19 22:01:24,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:24,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089998787] [2019-11-19 22:01:24,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:24,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:24,776 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 65 proven. 1 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-19 22:01:24,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089998787] [2019-11-19 22:01:24,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109943962] [2019-11-19 22:01:24,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:25,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-19 22:01:25,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 53 proven. 10 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-19 22:01:25,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:25,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7] total 23 [2019-11-19 22:01:25,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881378117] [2019-11-19 22:01:25,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-19 22:01:25,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:25,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-19 22:01:25,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=453, Unknown=0, NotChecked=0, Total=506 [2019-11-19 22:01:25,307 INFO L87 Difference]: Start difference. First operand 3145 states and 7803 transitions. Second operand 23 states. [2019-11-19 22:01:27,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:27,122 INFO L93 Difference]: Finished difference Result 6396 states and 20508 transitions. [2019-11-19 22:01:27,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-19 22:01:27,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 156 [2019-11-19 22:01:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:27,172 INFO L225 Difference]: With dead ends: 6396 [2019-11-19 22:01:27,173 INFO L226 Difference]: Without dead ends: 3268 [2019-11-19 22:01:27,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2019-11-19 22:01:27,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2019-11-19 22:01:27,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 3217. [2019-11-19 22:01:27,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2019-11-19 22:01:27,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 7929 transitions. [2019-11-19 22:01:27,410 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 7929 transitions. Word has length 156 [2019-11-19 22:01:27,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:27,410 INFO L462 AbstractCegarLoop]: Abstraction has 3217 states and 7929 transitions. [2019-11-19 22:01:27,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-19 22:01:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 7929 transitions. [2019-11-19 22:01:27,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-19 22:01:27,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:27,417 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:27,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:27,618 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:27,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash 48009880, now seen corresponding path program 1 times [2019-11-19 22:01:27,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:27,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211110361] [2019-11-19 22:01:27,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:27,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:27,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:27,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:27,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:27,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-19 22:01:28,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211110361] [2019-11-19 22:01:28,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:28,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-11-19 22:01:28,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642581898] [2019-11-19 22:01:28,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-19 22:01:28,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:28,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-19 22:01:28,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:01:28,157 INFO L87 Difference]: Start difference. First operand 3217 states and 7929 transitions. Second operand 18 states. [2019-11-19 22:01:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:29,924 INFO L93 Difference]: Finished difference Result 6468 states and 20577 transitions. [2019-11-19 22:01:29,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 22:01:29,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 146 [2019-11-19 22:01:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:29,959 INFO L225 Difference]: With dead ends: 6468 [2019-11-19 22:01:29,959 INFO L226 Difference]: Without dead ends: 3268 [2019-11-19 22:01:29,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-11-19 22:01:29,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2019-11-19 22:01:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 3159. [2019-11-19 22:01:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3159 states. [2019-11-19 22:01:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3159 states to 3159 states and 7825 transitions. [2019-11-19 22:01:30,205 INFO L78 Accepts]: Start accepts. Automaton has 3159 states and 7825 transitions. Word has length 146 [2019-11-19 22:01:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:30,206 INFO L462 AbstractCegarLoop]: Abstraction has 3159 states and 7825 transitions. [2019-11-19 22:01:30,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-19 22:01:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3159 states and 7825 transitions. [2019-11-19 22:01:30,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-19 22:01:30,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:30,211 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:30,211 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:30,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:30,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1452187009, now seen corresponding path program 1 times [2019-11-19 22:01:30,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:30,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118537089] [2019-11-19 22:01:30,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 69 proven. 3 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2019-11-19 22:01:30,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118537089] [2019-11-19 22:01:30,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030487542] [2019-11-19 22:01:30,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:30,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 1060 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:01:30,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-19 22:01:30,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:01:30,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2019-11-19 22:01:30,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760619953] [2019-11-19 22:01:30,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:01:30,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:01:30,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:01:30,978 INFO L87 Difference]: Start difference. First operand 3159 states and 7825 transitions. Second operand 11 states. [2019-11-19 22:01:31,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:31,272 INFO L93 Difference]: Finished difference Result 6868 states and 23242 transitions. [2019-11-19 22:01:31,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:01:31,272 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 158 [2019-11-19 22:01:31,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:31,313 INFO L225 Difference]: With dead ends: 6868 [2019-11-19 22:01:31,313 INFO L226 Difference]: Without dead ends: 3726 [2019-11-19 22:01:31,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:01:31,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3726 states. [2019-11-19 22:01:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3590. [2019-11-19 22:01:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3590 states. [2019-11-19 22:01:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3590 states to 3590 states and 9258 transitions. [2019-11-19 22:01:31,731 INFO L78 Accepts]: Start accepts. Automaton has 3590 states and 9258 transitions. Word has length 158 [2019-11-19 22:01:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:31,732 INFO L462 AbstractCegarLoop]: Abstraction has 3590 states and 9258 transitions. [2019-11-19 22:01:31,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:01:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3590 states and 9258 transitions. [2019-11-19 22:01:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 22:01:31,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:31,737 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:31,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:31,937 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:31,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash 828451384, now seen corresponding path program 1 times [2019-11-19 22:01:31,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:31,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589886960] [2019-11-19 22:01:31,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:31,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:32,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:32,161 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-19 22:01:32,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589886960] [2019-11-19 22:01:32,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:32,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-19 22:01:32,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427482839] [2019-11-19 22:01:32,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:01:32,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:32,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:01:32,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:01:32,162 INFO L87 Difference]: Start difference. First operand 3590 states and 9258 transitions. Second operand 13 states. [2019-11-19 22:01:33,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:33,906 INFO L93 Difference]: Finished difference Result 7253 states and 24478 transitions. [2019-11-19 22:01:33,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-19 22:01:33,907 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 99 [2019-11-19 22:01:33,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:33,946 INFO L225 Difference]: With dead ends: 7253 [2019-11-19 22:01:33,946 INFO L226 Difference]: Without dead ends: 3671 [2019-11-19 22:01:33,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:01:33,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3671 states. [2019-11-19 22:01:34,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3671 to 3476. [2019-11-19 22:01:34,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3476 states. [2019-11-19 22:01:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3476 states to 3476 states and 9116 transitions. [2019-11-19 22:01:34,183 INFO L78 Accepts]: Start accepts. Automaton has 3476 states and 9116 transitions. Word has length 99 [2019-11-19 22:01:34,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:34,184 INFO L462 AbstractCegarLoop]: Abstraction has 3476 states and 9116 transitions. [2019-11-19 22:01:34,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:01:34,184 INFO L276 IsEmpty]: Start isEmpty. Operand 3476 states and 9116 transitions. [2019-11-19 22:01:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:01:34,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:34,192 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:34,193 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:34,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:34,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1836067308, now seen corresponding path program 1 times [2019-11-19 22:01:34,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:34,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181886573] [2019-11-19 22:01:34,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:34,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-19 22:01:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181886573] [2019-11-19 22:01:34,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902020819] [2019-11-19 22:01:34,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:35,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:35,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-19 22:01:35,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:35,052 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 11 treesize of output 7 [2019-11-19 22:01:35,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:35,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:01:35,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:01:35,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-19 22:01:35,155 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:01:35,155 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 26 treesize of output 45 [2019-11-19 22:01:35,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:35,169 INFO L567 ElimStorePlain]: treesize reduction 24, result has 42.9 percent of original size [2019-11-19 22:01:35,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:01:35,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-11-19 22:01:35,239 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:01:35,240 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 22 treesize of output 18 [2019-11-19 22:01:35,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:35,248 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-11-19 22:01:35,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:01:35,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-11-19 22:01:35,307 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-11-19 22:01:35,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:35,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 30 [2019-11-19 22:01:35,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323591781] [2019-11-19 22:01:35,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-19 22:01:35,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:35,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-19 22:01:35,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-11-19 22:01:35,308 INFO L87 Difference]: Start difference. First operand 3476 states and 9116 transitions. Second operand 30 states. [2019-11-19 22:01:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:41,791 INFO L93 Difference]: Finished difference Result 11069 states and 33503 transitions. [2019-11-19 22:01:41,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-11-19 22:01:41,792 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2019-11-19 22:01:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:41,853 INFO L225 Difference]: With dead ends: 11069 [2019-11-19 22:01:41,853 INFO L226 Difference]: Without dead ends: 7610 [2019-11-19 22:01:41,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 94 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=629, Invalid=5377, Unknown=0, NotChecked=0, Total=6006 [2019-11-19 22:01:41,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7610 states. [2019-11-19 22:01:42,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7610 to 6199. [2019-11-19 22:01:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6199 states. [2019-11-19 22:01:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6199 states to 6199 states and 14118 transitions. [2019-11-19 22:01:42,486 INFO L78 Accepts]: Start accepts. Automaton has 6199 states and 14118 transitions. Word has length 96 [2019-11-19 22:01:42,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:42,487 INFO L462 AbstractCegarLoop]: Abstraction has 6199 states and 14118 transitions. [2019-11-19 22:01:42,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-19 22:01:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6199 states and 14118 transitions. [2019-11-19 22:01:42,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-19 22:01:42,491 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:42,492 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:42,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:42,692 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1495999487, now seen corresponding path program 1 times [2019-11-19 22:01:42,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:42,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525438457] [2019-11-19 22:01:42,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:42,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:42,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:42,837 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-11-19 22:01:42,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525438457] [2019-11-19 22:01:42,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:42,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-19 22:01:42,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234704080] [2019-11-19 22:01:42,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-19 22:01:42,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:42,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-19 22:01:42,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:01:42,839 INFO L87 Difference]: Start difference. First operand 6199 states and 14118 transitions. Second operand 8 states. [2019-11-19 22:01:44,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:44,311 INFO L93 Difference]: Finished difference Result 12494 states and 36935 transitions. [2019-11-19 22:01:44,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:01:44,311 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-11-19 22:01:44,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:44,368 INFO L225 Difference]: With dead ends: 12494 [2019-11-19 22:01:44,369 INFO L226 Difference]: Without dead ends: 6302 [2019-11-19 22:01:44,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:01:44,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6302 states. [2019-11-19 22:01:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6302 to 6197. [2019-11-19 22:01:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6197 states. [2019-11-19 22:01:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6197 states to 6197 states and 13968 transitions. [2019-11-19 22:01:44,800 INFO L78 Accepts]: Start accepts. Automaton has 6197 states and 13968 transitions. Word has length 89 [2019-11-19 22:01:44,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:44,800 INFO L462 AbstractCegarLoop]: Abstraction has 6197 states and 13968 transitions. [2019-11-19 22:01:44,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-19 22:01:44,800 INFO L276 IsEmpty]: Start isEmpty. Operand 6197 states and 13968 transitions. [2019-11-19 22:01:44,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-19 22:01:44,805 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:44,806 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:44,806 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:44,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:44,806 INFO L82 PathProgramCache]: Analyzing trace with hash 1220721366, now seen corresponding path program 1 times [2019-11-19 22:01:44,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:44,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620922402] [2019-11-19 22:01:44,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:44,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:44,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:44,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:45,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 59 proven. 1 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-11-19 22:01:45,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620922402] [2019-11-19 22:01:45,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639620677] [2019-11-19 22:01:45,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:45,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:45,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 1070 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:01:45,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 42 proven. 15 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-11-19 22:01:45,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:45,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 20 [2019-11-19 22:01:45,527 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393382277] [2019-11-19 22:01:45,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 22:01:45,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:45,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 22:01:45,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:01:45,528 INFO L87 Difference]: Start difference. First operand 6197 states and 13968 transitions. Second operand 20 states. [2019-11-19 22:01:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:46,915 INFO L93 Difference]: Finished difference Result 12777 states and 36971 transitions. [2019-11-19 22:01:46,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-19 22:01:46,916 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 152 [2019-11-19 22:01:46,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:46,976 INFO L225 Difference]: With dead ends: 12777 [2019-11-19 22:01:46,977 INFO L226 Difference]: Without dead ends: 6597 [2019-11-19 22:01:47,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-19 22:01:47,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6597 states. [2019-11-19 22:01:47,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6597 to 6423. [2019-11-19 22:01:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6423 states. [2019-11-19 22:01:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 14499 transitions. [2019-11-19 22:01:47,377 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 14499 transitions. Word has length 152 [2019-11-19 22:01:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:47,377 INFO L462 AbstractCegarLoop]: Abstraction has 6423 states and 14499 transitions. [2019-11-19 22:01:47,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 22:01:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 14499 transitions. [2019-11-19 22:01:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-11-19 22:01:47,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:47,383 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:47,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:47,584 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash -358003353, now seen corresponding path program 1 times [2019-11-19 22:01:47,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:47,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322032519] [2019-11-19 22:01:47,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,743 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 56 proven. 29 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-19 22:01:47,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322032519] [2019-11-19 22:01:47,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089509650] [2019-11-19 22:01:47,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:47,967 INFO L255 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:01:47,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:48,079 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-19 22:01:48,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:48,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-19 22:01:48,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996984502] [2019-11-19 22:01:48,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:01:48,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:48,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:01:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:01:48,080 INFO L87 Difference]: Start difference. First operand 6423 states and 14499 transitions. Second operand 16 states. [2019-11-19 22:01:49,454 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-19 22:01:50,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:50,064 INFO L93 Difference]: Finished difference Result 13012 states and 38170 transitions. [2019-11-19 22:01:50,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-19 22:01:50,064 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 144 [2019-11-19 22:01:50,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:50,124 INFO L225 Difference]: With dead ends: 13012 [2019-11-19 22:01:50,124 INFO L226 Difference]: Without dead ends: 6606 [2019-11-19 22:01:50,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=1054, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 22:01:50,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6606 states. [2019-11-19 22:01:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6606 to 6525. [2019-11-19 22:01:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6525 states. [2019-11-19 22:01:50,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6525 states to 6525 states and 14600 transitions. [2019-11-19 22:01:50,512 INFO L78 Accepts]: Start accepts. Automaton has 6525 states and 14600 transitions. Word has length 144 [2019-11-19 22:01:50,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:50,512 INFO L462 AbstractCegarLoop]: Abstraction has 6525 states and 14600 transitions. [2019-11-19 22:01:50,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 22:01:50,512 INFO L276 IsEmpty]: Start isEmpty. Operand 6525 states and 14600 transitions. [2019-11-19 22:01:50,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-11-19 22:01:50,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:50,519 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:50,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:50,720 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:50,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:50,720 INFO L82 PathProgramCache]: Analyzing trace with hash 330283975, now seen corresponding path program 1 times [2019-11-19 22:01:50,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:50,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914319296] [2019-11-19 22:01:50,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 73 proven. 39 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-11-19 22:01:50,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914319296] [2019-11-19 22:01:50,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884452916] [2019-11-19 22:01:50,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:51,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:01:51,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-19 22:01:51,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:51,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 16 [2019-11-19 22:01:51,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927729147] [2019-11-19 22:01:51,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:01:51,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:51,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:01:51,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:01:51,289 INFO L87 Difference]: Start difference. First operand 6525 states and 14600 transitions. Second operand 16 states. [2019-11-19 22:01:52,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:52,771 INFO L93 Difference]: Finished difference Result 13024 states and 38061 transitions. [2019-11-19 22:01:52,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:01:52,772 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 167 [2019-11-19 22:01:52,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:52,835 INFO L225 Difference]: With dead ends: 13024 [2019-11-19 22:01:52,835 INFO L226 Difference]: Without dead ends: 6516 [2019-11-19 22:01:52,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 174 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:01:52,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2019-11-19 22:01:53,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6423. [2019-11-19 22:01:53,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6423 states. [2019-11-19 22:01:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6423 states to 6423 states and 14410 transitions. [2019-11-19 22:01:53,218 INFO L78 Accepts]: Start accepts. Automaton has 6423 states and 14410 transitions. Word has length 167 [2019-11-19 22:01:53,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:53,218 INFO L462 AbstractCegarLoop]: Abstraction has 6423 states and 14410 transitions. [2019-11-19 22:01:53,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 22:01:53,218 INFO L276 IsEmpty]: Start isEmpty. Operand 6423 states and 14410 transitions. [2019-11-19 22:01:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-19 22:01:53,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:53,222 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:53,423 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:53,423 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:53,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:53,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1464410798, now seen corresponding path program 1 times [2019-11-19 22:01:53,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:53,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021425145] [2019-11-19 22:01:53,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:53,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-11-19 22:01:53,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021425145] [2019-11-19 22:01:53,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:01:53,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-11-19 22:01:53,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732934965] [2019-11-19 22:01:53,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:01:53,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:53,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:01:53,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:01:53,724 INFO L87 Difference]: Start difference. First operand 6423 states and 14410 transitions. Second operand 14 states. [2019-11-19 22:01:55,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:55,394 INFO L93 Difference]: Finished difference Result 13005 states and 37512 transitions. [2019-11-19 22:01:55,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-19 22:01:55,395 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 153 [2019-11-19 22:01:55,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:55,482 INFO L225 Difference]: With dead ends: 13005 [2019-11-19 22:01:55,482 INFO L226 Difference]: Without dead ends: 6599 [2019-11-19 22:01:55,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:01:55,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6599 states. [2019-11-19 22:01:56,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6599 to 6417. [2019-11-19 22:01:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6417 states. [2019-11-19 22:01:56,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6417 states to 6417 states and 14400 transitions. [2019-11-19 22:01:56,545 INFO L78 Accepts]: Start accepts. Automaton has 6417 states and 14400 transitions. Word has length 153 [2019-11-19 22:01:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:56,546 INFO L462 AbstractCegarLoop]: Abstraction has 6417 states and 14400 transitions. [2019-11-19 22:01:56,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:01:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 6417 states and 14400 transitions. [2019-11-19 22:01:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-19 22:01:56,555 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:56,555 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:56,555 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:56,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:56,556 INFO L82 PathProgramCache]: Analyzing trace with hash -2078158348, now seen corresponding path program 1 times [2019-11-19 22:01:56,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:56,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19825425] [2019-11-19 22:01:56,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:56,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 49 proven. 8 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:01:56,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19825425] [2019-11-19 22:01:56,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974168877] [2019-11-19 22:01:56,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:01:56,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:01:56,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:01:56,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:01:56,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 22:01:56,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:57,000 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-19 22:01:57,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:01:57,008 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:01:57,009 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:01:57,009 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:11 [2019-11-19 22:01:57,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:01:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 60 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-19 22:01:57,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:01:57,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-11-19 22:01:57,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978863108] [2019-11-19 22:01:57,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:01:57,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:01:57,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:01:57,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:01:57,026 INFO L87 Difference]: Start difference. First operand 6417 states and 14400 transitions. Second operand 10 states. [2019-11-19 22:01:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:01:59,134 INFO L93 Difference]: Finished difference Result 12440 states and 34788 transitions. [2019-11-19 22:01:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:01:59,135 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2019-11-19 22:01:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:01:59,206 INFO L225 Difference]: With dead ends: 12440 [2019-11-19 22:01:59,207 INFO L226 Difference]: Without dead ends: 6040 [2019-11-19 22:01:59,250 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:01:59,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6040 states. [2019-11-19 22:01:59,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6040 to 5996. [2019-11-19 22:01:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-11-19 22:01:59,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 12590 transitions. [2019-11-19 22:01:59,685 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 12590 transitions. Word has length 99 [2019-11-19 22:01:59,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:01:59,685 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 12590 transitions. [2019-11-19 22:01:59,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:01:59,685 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 12590 transitions. [2019-11-19 22:01:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-19 22:01:59,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:01:59,694 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:01:59,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:01:59,907 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:01:59,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:01:59,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1292773454, now seen corresponding path program 1 times [2019-11-19 22:01:59,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:01:59,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741286890] [2019-11-19 22:01:59,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:01:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 59 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:02:00,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741286890] [2019-11-19 22:02:00,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671560321] [2019-11-19 22:02:00,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:00,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:00,415 INFO L255 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 57 conjunts are in the unsatisfiable core [2019-11-19 22:02:00,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:02:00,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:00,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-11-19 22:02:00,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:00,636 INFO L567 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2019-11-19 22:02:00,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:00,636 INFO L496 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-11-19 22:02:00,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2019-11-19 22:02:00,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:00,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:00,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:00,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:00,813 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_int|], 1=[v_prenex_2]} [2019-11-19 22:02:00,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 15 treesize of output 7 [2019-11-19 22:02:00,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:00,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:00,829 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:00,829 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 22 treesize of output 18 [2019-11-19 22:02:00,830 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:00,842 INFO L567 ElimStorePlain]: treesize reduction 4, result has 75.0 percent of original size [2019-11-19 22:02:00,842 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-19 22:02:00,842 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2019-11-19 22:02:00,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:00,946 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 74 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-19 22:02:00,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:02:00,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-11-19 22:02:00,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086419408] [2019-11-19 22:02:00,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-19 22:02:00,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:02:00,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-19 22:02:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2019-11-19 22:02:00,948 INFO L87 Difference]: Start difference. First operand 5996 states and 12590 transitions. Second operand 30 states. [2019-11-19 22:02:03,994 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-11-19 22:02:05,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:02:05,892 INFO L93 Difference]: Finished difference Result 12211 states and 32538 transitions. [2019-11-19 22:02:05,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-19 22:02:05,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-11-19 22:02:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:02:05,948 INFO L225 Difference]: With dead ends: 12211 [2019-11-19 22:02:05,948 INFO L226 Difference]: Without dead ends: 6232 [2019-11-19 22:02:05,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=312, Invalid=2340, Unknown=0, NotChecked=0, Total=2652 [2019-11-19 22:02:05,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6232 states. [2019-11-19 22:02:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6232 to 6174. [2019-11-19 22:02:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6174 states. [2019-11-19 22:02:06,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6174 states to 6174 states and 12703 transitions. [2019-11-19 22:02:06,311 INFO L78 Accepts]: Start accepts. Automaton has 6174 states and 12703 transitions. Word has length 111 [2019-11-19 22:02:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:02:06,311 INFO L462 AbstractCegarLoop]: Abstraction has 6174 states and 12703 transitions. [2019-11-19 22:02:06,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-19 22:02:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 6174 states and 12703 transitions. [2019-11-19 22:02:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-19 22:02:06,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:02:06,318 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:02:06,518 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:06,518 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:02:06,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:02:06,519 INFO L82 PathProgramCache]: Analyzing trace with hash 844167058, now seen corresponding path program 1 times [2019-11-19 22:02:06,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:02:06,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670902384] [2019-11-19 22:02:06,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:02:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:06,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:06,727 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 92 proven. 10 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-19 22:02:06,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670902384] [2019-11-19 22:02:06,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107724273] [2019-11-19 22:02:06,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:06,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 983 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:02:06,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:02:06,995 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 16 treesize of output 8 [2019-11-19 22:02:06,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:06,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:06,997 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:02:06,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-19 22:02:07,023 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 107 proven. 5 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-19 22:02:07,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:02:07,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2019-11-19 22:02:07,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772172254] [2019-11-19 22:02:07,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:02:07,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:02:07,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:02:07,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:02:07,024 INFO L87 Difference]: Start difference. First operand 6174 states and 12703 transitions. Second operand 12 states. [2019-11-19 22:02:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:02:09,303 INFO L93 Difference]: Finished difference Result 12423 states and 32560 transitions. [2019-11-19 22:02:09,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 22:02:09,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2019-11-19 22:02:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:02:09,350 INFO L225 Difference]: With dead ends: 12423 [2019-11-19 22:02:09,350 INFO L226 Difference]: Without dead ends: 6266 [2019-11-19 22:02:09,372 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 137 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:02:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2019-11-19 22:02:09,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6210. [2019-11-19 22:02:09,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6210 states. [2019-11-19 22:02:09,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6210 states to 6210 states and 12430 transitions. [2019-11-19 22:02:09,649 INFO L78 Accepts]: Start accepts. Automaton has 6210 states and 12430 transitions. Word has length 129 [2019-11-19 22:02:09,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:02:09,649 INFO L462 AbstractCegarLoop]: Abstraction has 6210 states and 12430 transitions. [2019-11-19 22:02:09,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:02:09,649 INFO L276 IsEmpty]: Start isEmpty. Operand 6210 states and 12430 transitions. [2019-11-19 22:02:09,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-19 22:02:09,653 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:02:09,653 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 6, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:02:09,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:09,855 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:02:09,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:02:09,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1172656025, now seen corresponding path program 1 times [2019-11-19 22:02:09,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:02:09,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405946147] [2019-11-19 22:02:09,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:02:09,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:09,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:09,953 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 95 proven. 7 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-19 22:02:09,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405946147] [2019-11-19 22:02:09,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [828132243] [2019-11-19 22:02:09,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:10,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:10,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:02:10,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:02:10,189 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 16 treesize of output 8 [2019-11-19 22:02:10,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:10,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:10,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:02:10,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-11-19 22:02:10,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:10,203 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-11-19 22:02:10,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:02:10,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2019-11-19 22:02:10,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465749349] [2019-11-19 22:02:10,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:02:10,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:02:10,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:02:10,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:02:10,205 INFO L87 Difference]: Start difference. First operand 6210 states and 12430 transitions. Second operand 9 states. [2019-11-19 22:02:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:02:11,858 INFO L93 Difference]: Finished difference Result 12459 states and 31899 transitions. [2019-11-19 22:02:11,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:02:11,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 127 [2019-11-19 22:02:11,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:02:11,913 INFO L225 Difference]: With dead ends: 12459 [2019-11-19 22:02:11,913 INFO L226 Difference]: Without dead ends: 6266 [2019-11-19 22:02:11,938 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:02:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6266 states. [2019-11-19 22:02:12,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6266 to 6055. [2019-11-19 22:02:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6055 states. [2019-11-19 22:02:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 11698 transitions. [2019-11-19 22:02:12,252 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 11698 transitions. Word has length 127 [2019-11-19 22:02:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:02:12,252 INFO L462 AbstractCegarLoop]: Abstraction has 6055 states and 11698 transitions. [2019-11-19 22:02:12,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:02:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 11698 transitions. [2019-11-19 22:02:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-19 22:02:12,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:02:12,256 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:02:12,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:12,457 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:02:12,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:02:12,457 INFO L82 PathProgramCache]: Analyzing trace with hash 504276597, now seen corresponding path program 1 times [2019-11-19 22:02:12,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:02:12,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356833167] [2019-11-19 22:02:12,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:02:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:13,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:13,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:13,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 68 proven. 28 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-11-19 22:02:13,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356833167] [2019-11-19 22:02:13,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740355047] [2019-11-19 22:02:13,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:14,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 119 conjunts are in the unsatisfiable core [2019-11-19 22:02:14,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:02:14,149 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-19 22:02:14,150 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-19 22:02:14,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:14,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:02:14,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-11-19 22:02:14,197 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_133|, |v_#memory_$Pointer$.base_144|, |v_#memory_int_135|], 2=[|v_#memory_$Pointer$.base_134|, |v_#memory_$Pointer$.base_133|, |v_#memory_$Pointer$.base_136|], 6=[|v_#memory_$Pointer$.base_135|]} [2019-11-19 22:02:14,204 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 167 treesize of output 143 [2019-11-19 22:02:14,205 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:14,390 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-19 22:02:14,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 9 [2019-11-19 22:02:14,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:14,556 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-19 22:02:14,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,576 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 50 [2019-11-19 22:02:14,591 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:14,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,653 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:14,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,717 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:14,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,772 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:14,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:14,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,818 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:14,894 INFO L343 Elim1Store]: treesize reduction 83, result has 55.9 percent of original size [2019-11-19 22:02:14,895 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 136 [2019-11-19 22:02:14,895 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:14,959 INFO L567 ElimStorePlain]: treesize reduction 86, result has 53.3 percent of original size [2019-11-19 22:02:14,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 7 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:14,960 INFO L221 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:264, output treesize:82 [2019-11-19 22:02:15,050 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:15,050 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 28 treesize of output 99 [2019-11-19 22:02:15,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:15,135 INFO L567 ElimStorePlain]: treesize reduction 46, result has 73.9 percent of original size [2019-11-19 22:02:15,137 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_145|], 30=[|v_#memory_int_136|]} [2019-11-19 22:02:15,141 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 62 treesize of output 32 [2019-11-19 22:02:15,141 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:15,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:15,176 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,181 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 72 [2019-11-19 22:02:15,182 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:15,255 INFO L567 ElimStorePlain]: treesize reduction 4, result has 96.4 percent of original size [2019-11-19 22:02:15,256 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:15,256 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:107 [2019-11-19 22:02:15,830 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_146|], 42=[|v_#memory_int_137|]} [2019-11-19 22:02:15,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,835 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 62 treesize of output 32 [2019-11-19 22:02:15,835 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:15,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:15,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:15,886 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:15,886 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 99 [2019-11-19 22:02:15,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:15,945 INFO L567 ElimStorePlain]: treesize reduction 20, result has 84.4 percent of original size [2019-11-19 22:02:15,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:15,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:130, output treesize:101 [2019-11-19 22:02:16,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:16,033 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:16,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 82 [2019-11-19 22:02:16,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:16,098 INFO L567 ElimStorePlain]: treesize reduction 46, result has 70.1 percent of original size [2019-11-19 22:02:16,099 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:16,099 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:109, output treesize:108 [2019-11-19 22:02:16,158 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_147|], 30=[|v_#memory_int_138|]} [2019-11-19 22:02:16,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:16,162 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 62 treesize of output 32 [2019-11-19 22:02:16,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:16,192 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:16,197 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:16,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:16,199 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:16,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:16,230 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:16,230 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 144 [2019-11-19 22:02:16,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:16,321 INFO L567 ElimStorePlain]: treesize reduction 48, result has 74.3 percent of original size [2019-11-19 22:02:16,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,323 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:16,323 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:134, output treesize:139 [2019-11-19 22:02:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:16,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:17,010 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:17,010 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 131 [2019-11-19 22:02:17,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:17,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:17,053 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:17,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 127 treesize of output 171 [2019-11-19 22:02:17,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:17,073 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:17,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 137 [2019-11-19 22:02:17,074 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:17,633 WARN L191 SmtUtils]: Spent 558.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2019-11-19 22:02:17,634 INFO L567 ElimStorePlain]: treesize reduction 14, result has 95.9 percent of original size [2019-11-19 22:02:17,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:17,672 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:17,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 118 treesize of output 147 [2019-11-19 22:02:17,673 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:17,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:17,693 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 103 treesize of output 107 [2019-11-19 22:02:17,693 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:17,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:17,704 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 103 treesize of output 107 [2019-11-19 22:02:17,705 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:17,890 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2019-11-19 22:02:17,890 INFO L567 ElimStorePlain]: treesize reduction 66, result has 81.6 percent of original size [2019-11-19 22:02:17,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 3 xjuncts. [2019-11-19 22:02:17,892 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:364, output treesize:292 [2019-11-19 22:02:18,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:02:18,053 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_138|, |v_#memory_$Pointer$.base_148|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_140|], 28=[|v_#memory_int_140|]} [2019-11-19 22:02:18,070 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:18,087 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:18,099 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:18,879 WARN L191 SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-19 22:02:18,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:18,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:18,928 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 190 treesize of output 166 [2019-11-19 22:02:18,929 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:18,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:18,969 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 211 treesize of output 181 [2019-11-19 22:02:18,969 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:18,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:18,993 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 196 treesize of output 166 [2019-11-19 22:02:18,994 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:19,678 WARN L191 SmtUtils]: Spent 683.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-19 22:02:19,678 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:19,686 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:19,691 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:19,703 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:20,210 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-19 22:02:20,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:20,217 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:20,225 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:20,235 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:02:20,634 WARN L191 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-19 22:02:20,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:20,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,728 INFO L343 Elim1Store]: treesize reduction 45, result has 58.7 percent of original size [2019-11-19 22:02:20,728 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 187 [2019-11-19 22:02:20,728 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:20,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,751 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,807 INFO L343 Elim1Store]: treesize reduction 45, result has 58.7 percent of original size [2019-11-19 22:02:20,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 170 treesize of output 202 [2019-11-19 22:02:20,808 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:20,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:20,874 INFO L343 Elim1Store]: treesize reduction 45, result has 58.7 percent of original size [2019-11-19 22:02:20,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 187 [2019-11-19 22:02:20,875 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:21,359 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 131 [2019-11-19 22:02:21,360 INFO L567 ElimStorePlain]: treesize reduction 102, result has 83.4 percent of original size [2019-11-19 22:02:21,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:21,437 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:21,437 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 162 treesize of output 272 [2019-11-19 22:02:21,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:21,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:21,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:21,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:21,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:21,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:21,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:02:21,662 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:02:21,662 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-19 22:02:21,665 INFO L168 Benchmark]: Toolchain (without parser) took 137599.49 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.9 GB). Free memory was 939.3 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 754.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:02:21,666 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:02:21,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 868.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-19 22:02:21,666 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:02:21,666 INFO L168 Benchmark]: Boogie Preprocessor took 84.57 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:02:21,666 INFO L168 Benchmark]: RCFGBuilder took 1147.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.5 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:02:21,667 INFO L168 Benchmark]: TraceAbstraction took 135409.23 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 686.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:02:21,668 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 868.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -154.3 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 84.57 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1147.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.5 MB). Peak memory consumption was 76.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 135409.23 ms. Allocated memory was 1.2 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 1.0 GB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 686.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-19 22:02:23,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:02:23,632 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:02:23,644 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:02:23,646 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:02:23,648 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:02:23,650 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:02:23,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:02:23,666 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:02:23,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:02:23,670 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:02:23,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:02:23,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:02:23,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:02:23,677 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:02:23,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:02:23,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:02:23,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:02:23,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:02:23,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:02:23,691 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:02:23,694 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:02:23,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:02:23,698 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:02:23,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:02:23,701 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:02:23,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:02:23,703 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:02:23,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:02:23,704 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:02:23,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:02:23,706 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:02:23,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:02:23,707 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:02:23,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:02:23,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:02:23,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:02:23,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:02:23,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:02:23,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:02:23,713 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:02:23,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 22:02:23,740 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:02:23,751 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:02:23,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:02:23,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:02:23,753 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:02:23,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:02:23,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:02:23,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:02:23,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:02:23,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:02:23,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:02:23,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:02:23,755 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:02:23,755 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:02:23,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:02:23,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:02:23,756 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:02:23,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:02:23,757 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:02:23,757 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:02:23,757 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:02:23,758 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:02:23,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:02:23,758 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:02:23,759 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:02:23,759 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:02:23,759 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:02:23,759 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:02:23,760 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:02:23,760 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:02:23,761 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_a81a7439-65c2-44b7-9611-bf22be70eade/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 -> 7c39ea866ecd4619e97b65a7639eefeeaf4c0097 [2019-11-19 22:02:24,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:02:24,101 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:02:24,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:02:24,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:02:24,108 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:02:24,109 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-19 22:02:24,171 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/cb260c312/106bc8ddfc9c408c9c993aca8a20b1b7/FLAG1497bd614 [2019-11-19 22:02:24,611 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:02:24,612 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-11-19 22:02:24,630 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/cb260c312/106bc8ddfc9c408c9c993aca8a20b1b7/FLAG1497bd614 [2019-11-19 22:02:24,917 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/data/cb260c312/106bc8ddfc9c408c9c993aca8a20b1b7 [2019-11-19 22:02:24,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:02:24,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:02:24,922 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:02:24,922 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:02:24,925 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:02:24,926 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:02:24" (1/1) ... [2019-11-19 22:02:24,929 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22bcf909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:24, skipping insertion in model container [2019-11-19 22:02:24,929 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:02:24" (1/1) ... [2019-11-19 22:02:24,935 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:02:25,009 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:02:25,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:02:25,697 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:02:25,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:02:25,857 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:02:25,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25 WrapperNode [2019-11-19 22:02:25,858 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:02:25,858 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:02:25,859 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:02:25,859 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:02:25,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,890 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:02:25,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:02:25,931 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:02:25,931 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:02:25,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... [2019-11-19 22:02:25,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:02:25,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:02:25,996 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:02:25,996 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:02:25,997 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:02:26,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-19 22:02:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 22:02:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-11-19 22:02:26,058 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-11-19 22:02:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-19 22:02:26,058 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-11-19 22:02:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-11-19 22:02:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-19 22:02:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:02:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-11-19 22:02:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-11-19 22:02:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-11-19 22:02:26,059 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-11-19 22:02:26,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-11-19 22:02:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-11-19 22:02:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-11-19 22:02:26,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-19 22:02:26,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:02:26,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:02:32,070 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:02:32,070 INFO L285 CfgBuilder]: Removed 38 assume(true) statements. [2019-11-19 22:02:32,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:02:32 BoogieIcfgContainer [2019-11-19 22:02:32,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:02:32,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:02:32,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:02:32,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:02:32,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:02:24" (1/3) ... [2019-11-19 22:02:32,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b6d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:02:32, skipping insertion in model container [2019-11-19 22:02:32,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:02:25" (2/3) ... [2019-11-19 22:02:32,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65b6d9a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:02:32, skipping insertion in model container [2019-11-19 22:02:32,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:02:32" (3/3) ... [2019-11-19 22:02:32,078 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-11-19 22:02:32,085 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:02:32,091 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:02:32,102 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:02:32,124 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:02:32,124 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:02:32,124 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:02:32,124 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:02:32,125 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:02:32,125 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:02:32,125 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:02:32,125 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:02:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-19 22:02:32,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 22:02:32,149 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:02:32,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:02:32,151 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:02:32,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:02:32,155 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-11-19 22:02:32,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:02:32,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [934562265] [2019-11-19 22:02:32,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:02:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:02:32,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:02:32,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:02:32,547 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 11 treesize of output 7 [2019-11-19 22:02:32,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:32,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:32,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:02:32,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-19 22:02:32,640 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:02:32,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:02:32,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:02:32,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:02:32,645 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 22:02:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:02:32,709 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:02:32,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:32,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:02:32,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:02:32,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [934562265] [2019-11-19 22:02:32,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:02:32,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-19 22:02:32,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128367735] [2019-11-19 22:02:32,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:02:32,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:02:32,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:02:32,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:02:32,883 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 13 states. [2019-11-19 22:03:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:03:19,980 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-11-19 22:03:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:03:19,989 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-19 22:03:19,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:03:20,006 INFO L225 Difference]: With dead ends: 269 [2019-11-19 22:03:20,006 INFO L226 Difference]: Without dead ends: 125 [2019-11-19 22:03:20,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:03:20,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-19 22:03:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-11-19 22:03:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 22:03:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-11-19 22:03:20,076 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-11-19 22:03:20,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:03:20,077 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-11-19 22:03:20,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:03:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-11-19 22:03:20,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:03:20,081 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:03:20,081 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] [2019-11-19 22:03:20,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:03:20,293 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:03:20,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:03:20,293 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-11-19 22:03:20,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:03:20,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [603154583] [2019-11-19 22:03:20,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:03:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:03:20,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:03:20,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:03:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:03:20,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:03:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:03:20,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [603154583] [2019-11-19 22:03:20,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:03:20,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-19 22:03:20,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516459234] [2019-11-19 22:03:20,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:03:20,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:03:20,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:03:20,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:03:20,576 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 4 states. [2019-11-19 22:03:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:03:20,617 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2019-11-19 22:03:20,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:03:20,618 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-19 22:03:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:03:20,626 INFO L225 Difference]: With dead ends: 236 [2019-11-19 22:03:20,627 INFO L226 Difference]: Without dead ends: 126 [2019-11-19 22:03:20,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:03:20,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-19 22:03:20,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-11-19 22:03:20,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-19 22:03:20,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2019-11-19 22:03:20,660 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 27 [2019-11-19 22:03:20,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:03:20,661 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2019-11-19 22:03:20,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:03:20,661 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2019-11-19 22:03:20,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:03:20,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:03:20,668 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] [2019-11-19 22:03:20,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:03:20,874 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:03:20,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:03:20,874 INFO L82 PathProgramCache]: Analyzing trace with hash 313595982, now seen corresponding path program 1 times [2019-11-19 22:03:20,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:03:20,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1685417279] [2019-11-19 22:03:20,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:03:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:03:21,137 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-19 22:03:21,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:03:21,157 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 11 treesize of output 7 [2019-11-19 22:03:21,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:03:21,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:03:21,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:03:21,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-19 22:03:21,286 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-19 22:03:21,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:03:21,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:03:21,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:03:21,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-19 22:03:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:03:21,339 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:03:21,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:03:21,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:03:21,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:03:21,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1685417279] [2019-11-19 22:03:21,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:03:21,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 14 [2019-11-19 22:03:21,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506312856] [2019-11-19 22:03:21,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:03:21,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:03:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:03:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:03:21,469 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand 14 states. [2019-11-19 22:04:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:04:00,785 INFO L93 Difference]: Finished difference Result 276 states and 409 transitions. [2019-11-19 22:04:00,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 22:04:00,785 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-19 22:04:00,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:04:00,789 INFO L225 Difference]: With dead ends: 276 [2019-11-19 22:04:00,789 INFO L226 Difference]: Without dead ends: 166 [2019-11-19 22:04:00,791 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:04:00,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-11-19 22:04:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-11-19 22:04:00,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-19 22:04:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-11-19 22:04:00,830 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 28 [2019-11-19 22:04:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:04:00,830 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-11-19 22:04:00,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:04:00,831 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-11-19 22:04:00,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:04:00,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:04:00,836 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] [2019-11-19 22:04:01,039 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:04:01,039 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:04:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:04:01,040 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-11-19 22:04:01,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:04:01,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1992002298] [2019-11-19 22:04:01,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a81a7439-65c2-44b7-9611-bf22be70eade/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:04:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:04:01,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-19 22:04:01,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:04:01,447 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-19 22:04:01,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-11-19 22:04:01,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:04:01,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:04:01,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:04:01,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-11-19 22:04:01,545 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_140|, |v_#memory_$Pointer$.offset_140|, |v_#memory_int_135|], 2=[|v_#memory_$Pointer$.offset_137|, |v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.offset_136|], 6=[|v_#memory_$Pointer$.offset_138|, |v_#memory_$Pointer$.base_138|]} [2019-11-19 22:04:04,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:04:05,255 INFO L237 Elim1Store]: Index analysis took 2056 ms [2019-11-19 22:04:08,745 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_$Pointer$.base_138| ~user~0.base))) (= (select .cse0 (bvadd ~user~0.offset (_ bv12 32))) (select .cse0 (bvadd ~user~0.offset (_ bv16 32))))) [2019-11-19 22:04:10,304 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 24 treesize of output 9 [2019-11-19 22:04:10,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:04:52,612 WARN L191 SmtUtils]: Spent 42.31 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-19 22:04:52,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:04:58,460 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:01,294 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select (select |v_#memory_$Pointer$.offset_138| ~user~0.base) (bvadd ~user~0.offset (_ bv16 32))) (_ bv0 32)) [2019-11-19 22:05:01,294 INFO L237 Elim1Store]: Index analysis took 4655 ms [2019-11-19 22:05:05,915 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (let ((.cse0 (select |v_#memory_$Pointer$.offset_138| ~user~0.base))) (= (select .cse0 (bvadd ~user~0.offset (_ bv16 32))) (select .cse0 (bvadd ~user~0.offset (_ bv12 32))))) [2019-11-19 22:05:07,919 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (let ((.cse0 (select |v_#memory_$Pointer$.offset_138| ~user~0.base))) (= (select .cse0 (bvadd ~user~0.offset (_ bv16 32))) (select .cse0 (bvadd ~user~0.offset (_ bv12 32))))) [2019-11-19 22:05:07,920 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 24 treesize of output 9 [2019-11-19 22:05:07,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:05:51,021 WARN L191 SmtUtils]: Spent 43.10 s on a formula simplification that was a NOOP. DAG size: 102 [2019-11-19 22:05:51,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:05:52,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:52,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:52,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:05:53,776 INFO L237 Elim1Store]: Index analysis took 1828 ms [2019-11-19 22:05:53,779 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 13 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 56 [2019-11-19 22:05:53,779 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:07,661 WARN L191 SmtUtils]: Spent 13.88 s on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-11-19 22:06:07,662 INFO L567 ElimStorePlain]: treesize reduction 4, result has 98.7 percent of original size [2019-11-19 22:06:07,705 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:18,401 WARN L191 SmtUtils]: Spent 10.70 s on a formula simplification that was a NOOP. DAG size: 96 [2019-11-19 22:06:18,401 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:18,543 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:23,984 WARN L191 SmtUtils]: Spent 5.44 s on a formula simplification that was a NOOP. DAG size: 92 [2019-11-19 22:06:23,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:24,034 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:27,690 WARN L191 SmtUtils]: Spent 3.66 s on a formula simplification that was a NOOP. DAG size: 88 [2019-11-19 22:06:27,690 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:27,720 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:33,725 WARN L191 SmtUtils]: Spent 6.00 s on a formula simplification that was a NOOP. DAG size: 85 [2019-11-19 22:06:33,725 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:33,750 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:38,466 WARN L191 SmtUtils]: Spent 4.72 s on a formula simplification that was a NOOP. DAG size: 81 [2019-11-19 22:06:38,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:38,479 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:40,382 WARN L191 SmtUtils]: Spent 1.90 s on a formula simplification that was a NOOP. DAG size: 77 [2019-11-19 22:06:40,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:40,404 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:40,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:40,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:40,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:40,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:40,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:56,860 WARN L191 SmtUtils]: Spent 16.44 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-11-19 22:06:56,860 INFO L343 Elim1Store]: treesize reduction 71, result has 71.4 percent of original size [2019-11-19 22:06:56,860 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 287 [2019-11-19 22:06:56,863 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:57,454 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-11-19 22:06:57,454 INFO L567 ElimStorePlain]: treesize reduction 154, result has 53.5 percent of original size [2019-11-19 22:06:57,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,470 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:06:57,484 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:57,485 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 69 [2019-11-19 22:06:57,486 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:57,620 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:06:57,620 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.3 percent of original size [2019-11-19 22:06:57,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 11 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:06:57,622 INFO L221 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:389, output treesize:80 [2019-11-19 22:06:57,726 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:57,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:57,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 26 treesize of output 36 [2019-11-19 22:06:57,743 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:57,884 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-19 22:06:57,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:57,885 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_141|, |v_#memory_$Pointer$.offset_141|], 30=[|v_#memory_int_136|]} [2019-11-19 22:06:57,897 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 39 treesize of output 21 [2019-11-19 22:06:57,897 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:57,985 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:58,000 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 25 treesize of output 13 [2019-11-19 22:06:58,000 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:58,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:58,069 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,078 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:06:58,089 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:58,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 86 [2019-11-19 22:06:58,091 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:58,175 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.4 percent of original size [2019-11-19 22:06:58,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:06:58,175 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:131, output treesize:82 [2019-11-19 22:06:58,761 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_142|, |v_#memory_$Pointer$.base_142|], 40=[|v_#memory_int_137|]} [2019-11-19 22:06:58,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,789 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 25 treesize of output 13 [2019-11-19 22:06:58,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:58,927 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-19 22:06:58,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:58,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:58,967 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-19 22:06:58,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:59,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,043 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:59,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:59,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:59,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:59,049 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:59,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-19 22:06:59,054 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:06:59,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 115 [2019-11-19 22:06:59,101 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:59,192 INFO L567 ElimStorePlain]: treesize reduction 44, result has 65.4 percent of original size [2019-11-19 22:06:59,193 INFO L496 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-11-19 22:06:59,193 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:122, output treesize:76 [2019-11-19 22:06:59,381 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 11=[|#memory_int|]} [2019-11-19 22:06:59,387 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 37 treesize of output 25 [2019-11-19 22:06:59,387 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:59,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,450 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 21 treesize of output 13 [2019-11-19 22:06:59,451 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:59,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 29 [2019-11-19 22:06:59,492 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 22:06:59,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 22:06:59,502 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:78, output treesize:3 [2019-11-19 22:06:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:06:59,552 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:06:59,613 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:59,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,651 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:59,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:06:59,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-19 22:06:59,659 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2019-11-19 22:06:59,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:07:00,177 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:00,224 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:00,230 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:00,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:00,258 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:00,258 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:106, output treesize:90 [2019-11-19 22:07:02,457 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_137|, |v_#memory_$Pointer$.offset_139|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_136|, |v_#memory_$Pointer$.base_146|, |v_#memory_$Pointer$.offset_146|, |v_#memory_$Pointer$.offset_136|], 6=[|v_#memory_$Pointer$.offset_138|, |v_#memory_$Pointer$.base_138|], 15=[|v_#memory_int_135|]} [2019-11-19 22:07:02,931 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:03,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:03,235 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2019-11-19 22:07:03,236 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-19 22:07:08,818 WARN L191 SmtUtils]: Spent 5.58 s on a formula simplification that was a NOOP. DAG size: 143 [2019-11-19 22:07:08,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:09,349 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:09,671 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:09,672 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 10 [2019-11-19 22:07:09,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 22:07:16,338 WARN L191 SmtUtils]: Spent 6.67 s on a formula simplification that was a NOOP. DAG size: 137 [2019-11-19 22:07:16,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:16,442 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:27,396 WARN L191 SmtUtils]: Spent 10.95 s on a formula simplification that was a NOOP. DAG size: 133 [2019-11-19 22:07:27,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:27,643 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:32,468 WARN L191 SmtUtils]: Spent 4.82 s on a formula simplification that was a NOOP. DAG size: 128 [2019-11-19 22:07:32,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:32,639 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:37,072 WARN L191 SmtUtils]: Spent 4.43 s on a formula simplification that was a NOOP. DAG size: 123 [2019-11-19 22:07:37,073 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:37,140 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:39,704 WARN L191 SmtUtils]: Spent 2.56 s on a formula simplification that was a NOOP. DAG size: 119 [2019-11-19 22:07:39,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:39,760 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:41,864 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 114 [2019-11-19 22:07:41,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:41,913 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:43,251 WARN L191 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 110 [2019-11-19 22:07:43,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:43,290 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:44,754 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 106 [2019-11-19 22:07:44,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:44,772 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-19 22:07:45,202 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2019-11-19 22:07:45,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:07:45,217 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:45,218 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:45,219 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:45,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:45,226 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:07:45,227 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:26,277 WARN L191 SmtUtils]: Spent 41.04 s on a formula simplification. DAG size of input: 108 DAG size of output: 87 [2019-11-19 22:08:26,278 INFO L343 Elim1Store]: treesize reduction 228, result has 54.9 percent of original size [2019-11-19 22:08:26,278 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1074 treesize of output 1098 [2019-11-19 22:08:26,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,622 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 22:08:26,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 892 treesize of output 892 [2019-11-19 22:08:26,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:26,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:26,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:26,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,192 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-19 22:08:27,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-19 22:08:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-19 22:08:27,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:08:27,489 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:27,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:27,494 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:27,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:27,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:27,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-19 22:08:27,498 INFO L392 ElimStorePlain]: Different costs {0=[v_arrayElimCell_34, v_arrayElimCell_33], 1=[v_arrayElimCell_32]} [2019-11-19 22:08:27,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-19 22:08:27,723 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-19 22:08:27,727 INFO L168 Benchmark]: Toolchain (without parser) took 362806.13 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 238.6 MB). Free memory was 955.1 MB in the beginning and 900.0 MB in the end (delta: 55.1 MB). Peak memory consumption was 336.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:08:27,727 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:08:27,727 INFO L168 Benchmark]: CACSL2BoogieTranslator took 936.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:08:27,728 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:08:27,728 INFO L168 Benchmark]: Boogie Preprocessor took 65.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:08:27,728 INFO L168 Benchmark]: RCFGBuilder took 6075.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:08:27,728 INFO L168 Benchmark]: TraceAbstraction took 355653.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 900.0 MB in the end (delta: 133.9 MB). Peak memory consumption was 259.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:08:27,731 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 936.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 955.1 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 6075.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.9 MB). Peak memory consumption was 76.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 355653.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.0 GB in the beginning and 900.0 MB in the end (delta: 133.9 MB). Peak memory consumption was 259.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...