./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0513.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0513.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d166d612464eb82f26cf6bd810bec52eb6c5e35a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0513.i -s /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d166d612464eb82f26cf6bd810bec52eb6c5e35a .............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:55:30,803 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:55:30,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:55:30,821 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:55:30,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:55:30,822 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:55:30,824 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:55:30,834 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:55:30,838 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:55:30,842 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:55:30,843 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:55:30,844 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:55:30,845 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:55:30,845 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:55:30,846 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:55:30,847 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:55:30,848 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:55:30,848 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:55:30,850 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:55:30,853 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:55:30,856 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:55:30,858 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:55:30,862 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:55:30,862 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:55:30,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:55:30,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:55:30,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:55:30,871 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:55:30,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:55:30,873 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:55:30,873 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:55:30,874 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:55:30,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:55:30,875 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:55:30,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:55:30,877 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:55:30,878 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:55:30,878 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:55:30,878 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:55:30,879 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:55:30,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:55:30,881 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 19:55:30,909 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:55:30,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:55:30,911 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:55:30,911 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:55:30,911 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:55:30,911 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:55:30,912 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:55:30,912 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:55:30,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:55:30,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:55:30,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:55:30,913 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 19:55:30,913 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 19:55:30,913 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 19:55:30,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:55:30,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:55:30,914 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:55:30,914 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:55:30,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:55:30,915 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:55:30,915 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:55:30,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:55:30,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:55:30,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:55:30,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:55:30,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:55:30,916 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_4e3abcff-1c28-42a4-a55a-b15778d1412c/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d166d612464eb82f26cf6bd810bec52eb6c5e35a [2019-11-15 19:55:30,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:55:30,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:55:30,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:55:30,978 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:55:30,979 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:55:30,979 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0513.i [2019-11-15 19:55:31,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/262bd79fb/eb5a91cd3281408882ebd7ff05a8ca26/FLAG0929dbd3e [2019-11-15 19:55:31,513 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:55:31,517 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/sv-benchmarks/c/memsafety/test-0513.i [2019-11-15 19:55:31,532 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/262bd79fb/eb5a91cd3281408882ebd7ff05a8ca26/FLAG0929dbd3e [2019-11-15 19:55:31,771 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/262bd79fb/eb5a91cd3281408882ebd7ff05a8ca26 [2019-11-15 19:55:31,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:55:31,775 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 19:55:31,775 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:55:31,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:55:31,779 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:55:31,780 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:55:31" (1/1) ... [2019-11-15 19:55:31,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@504c5fed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:31, skipping insertion in model container [2019-11-15 19:55:31,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:55:31" (1/1) ... [2019-11-15 19:55:31,791 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:55:31,833 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:55:32,219 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:55:32,228 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:55:32,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:55:32,373 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:55:32,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32 WrapperNode [2019-11-15 19:55:32,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:55:32,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:55:32,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:55:32,375 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:55:32,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... [2019-11-15 19:55:32,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:55:32,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:55:32,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:55:32,456 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:55:32,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:55:32,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 19:55:32,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:55:32,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 19:55:32,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 19:55:32,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 19:55:32,535 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 19:55:32,536 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 19:55:32,536 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 19:55:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 19:55:32,537 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 19:55:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 19:55:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 19:55:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 19:55:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 19:55:32,539 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 19:55:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 19:55:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 19:55:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 19:55:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 19:55:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 19:55:32,542 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 19:55:32,543 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 19:55:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 19:55:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 19:55:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 19:55:32,544 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 19:55:32,545 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 19:55:32,546 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 19:55:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 19:55:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 19:55:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 19:55:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 19:55:32,548 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 19:55:32,549 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 19:55:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 19:55:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 19:55:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 19:55:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 19:55:32,550 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 19:55:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 19:55:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 19:55:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 19:55:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 19:55:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 19:55:32,551 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 19:55:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 19:55:32,552 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 19:55:32,553 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 19:55:32,553 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 19:55:32,553 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 19:55:32,554 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 19:55:32,554 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 19:55:32,555 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 19:55:32,555 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 19:55:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 19:55:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 19:55:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 19:55:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 19:55:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 19:55:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 19:55:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 19:55:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 19:55:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 19:55:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 19:55:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 19:55:32,557 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 19:55:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 19:55:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 19:55:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 19:55:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 19:55:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 19:55:32,558 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 19:55:32,559 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 19:55:32,560 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 19:55:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 19:55:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 19:55:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 19:55:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 19:55:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 19:55:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 19:55:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 19:55:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 19:55:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:55:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:55:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 19:55:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:55:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:55:32,563 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 19:55:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 19:55:32,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:55:33,376 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:55:33,377 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 19:55:33,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:55:33 BoogieIcfgContainer [2019-11-15 19:55:33,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:55:33,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:55:33,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:55:33,383 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:55:33,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:55:31" (1/3) ... [2019-11-15 19:55:33,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b75a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:55:33, skipping insertion in model container [2019-11-15 19:55:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:55:32" (2/3) ... [2019-11-15 19:55:33,385 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b75a23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:55:33, skipping insertion in model container [2019-11-15 19:55:33,385 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:55:33" (3/3) ... [2019-11-15 19:55:33,387 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0513.i [2019-11-15 19:55:33,398 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:55:33,407 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-11-15 19:55:33,419 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-11-15 19:55:33,442 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:55:33,442 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 19:55:33,442 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:55:33,443 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:55:33,452 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:55:33,452 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:55:33,452 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:55:33,452 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:55:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2019-11-15 19:55:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 19:55:33,486 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:33,487 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:33,490 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:33,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:33,496 INFO L82 PathProgramCache]: Analyzing trace with hash -673018245, now seen corresponding path program 1 times [2019-11-15 19:55:33,505 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:33,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051378545] [2019-11-15 19:55:33,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:33,506 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:33,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:33,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:33,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051378545] [2019-11-15 19:55:33,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:33,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:55:33,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602848524] [2019-11-15 19:55:33,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:55:33,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:55:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:55:33,704 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2019-11-15 19:55:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:34,209 INFO L93 Difference]: Finished difference Result 183 states and 194 transitions. [2019-11-15 19:55:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:55:34,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-15 19:55:34,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:34,224 INFO L225 Difference]: With dead ends: 183 [2019-11-15 19:55:34,224 INFO L226 Difference]: Without dead ends: 179 [2019-11-15 19:55:34,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:55:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-15 19:55:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 137. [2019-11-15 19:55:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 19:55:34,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 146 transitions. [2019-11-15 19:55:34,275 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 146 transitions. Word has length 9 [2019-11-15 19:55:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:34,276 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 146 transitions. [2019-11-15 19:55:34,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:55:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 146 transitions. [2019-11-15 19:55:34,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 19:55:34,276 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:34,277 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:34,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:34,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:34,277 INFO L82 PathProgramCache]: Analyzing trace with hash 609881689, now seen corresponding path program 1 times [2019-11-15 19:55:34,278 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:34,278 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870516054] [2019-11-15 19:55:34,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:34,278 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:34,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:34,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:34,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:34,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870516054] [2019-11-15 19:55:34,350 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:34,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:55:34,351 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10670287] [2019-11-15 19:55:34,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:55:34,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:34,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:55:34,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:34,353 INFO L87 Difference]: Start difference. First operand 137 states and 146 transitions. Second operand 4 states. [2019-11-15 19:55:34,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:34,676 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2019-11-15 19:55:34,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 19:55:34,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 19:55:34,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:34,681 INFO L225 Difference]: With dead ends: 149 [2019-11-15 19:55:34,681 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 19:55:34,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:55:34,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 19:55:34,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 142. [2019-11-15 19:55:34,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-15 19:55:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2019-11-15 19:55:34,709 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 10 [2019-11-15 19:55:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:34,709 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2019-11-15 19:55:34,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:55:34,710 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2019-11-15 19:55:34,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 19:55:34,710 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:34,710 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:34,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:34,712 INFO L82 PathProgramCache]: Analyzing trace with hash 609882328, now seen corresponding path program 1 times [2019-11-15 19:55:34,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:34,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970035821] [2019-11-15 19:55:34,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:34,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:34,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:34,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:34,821 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970035821] [2019-11-15 19:55:34,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:34,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:55:34,822 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885869508] [2019-11-15 19:55:34,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:55:34,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:34,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:55:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:34,823 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand 4 states. [2019-11-15 19:55:35,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:35,275 INFO L93 Difference]: Finished difference Result 173 states and 187 transitions. [2019-11-15 19:55:35,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:55:35,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 19:55:35,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:35,279 INFO L225 Difference]: With dead ends: 173 [2019-11-15 19:55:35,279 INFO L226 Difference]: Without dead ends: 173 [2019-11-15 19:55:35,280 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:35,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-15 19:55:35,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 143. [2019-11-15 19:55:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 19:55:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 157 transitions. [2019-11-15 19:55:35,304 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 157 transitions. Word has length 10 [2019-11-15 19:55:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:35,304 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 157 transitions. [2019-11-15 19:55:35,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:55:35,305 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 157 transitions. [2019-11-15 19:55:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 19:55:35,305 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:35,305 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:35,306 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 609882329, now seen corresponding path program 1 times [2019-11-15 19:55:35,307 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:35,307 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207512375] [2019-11-15 19:55:35,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:35,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:35,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:35,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207512375] [2019-11-15 19:55:35,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:35,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:55:35,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409894461] [2019-11-15 19:55:35,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:55:35,392 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:35,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:55:35,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:35,393 INFO L87 Difference]: Start difference. First operand 143 states and 157 transitions. Second operand 4 states. [2019-11-15 19:55:35,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:35,664 INFO L93 Difference]: Finished difference Result 141 states and 153 transitions. [2019-11-15 19:55:35,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:55:35,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-15 19:55:35,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:35,665 INFO L225 Difference]: With dead ends: 141 [2019-11-15 19:55:35,666 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 19:55:35,666 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 19:55:35,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-11-15 19:55:35,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-15 19:55:35,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 153 transitions. [2019-11-15 19:55:35,682 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 153 transitions. Word has length 10 [2019-11-15 19:55:35,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:35,683 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 153 transitions. [2019-11-15 19:55:35,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:55:35,683 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 153 transitions. [2019-11-15 19:55:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 19:55:35,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:35,684 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:35,685 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:35,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:35,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1105861738, now seen corresponding path program 1 times [2019-11-15 19:55:35,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:35,686 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245265637] [2019-11-15 19:55:35,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:35,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:35,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:35,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245265637] [2019-11-15 19:55:35,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:35,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:55:35,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220071021] [2019-11-15 19:55:35,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:55:35,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:35,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:55:35,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:35,773 INFO L87 Difference]: Start difference. First operand 141 states and 153 transitions. Second operand 4 states. [2019-11-15 19:55:36,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:36,021 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-11-15 19:55:36,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:55:36,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 19:55:36,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:36,022 INFO L225 Difference]: With dead ends: 137 [2019-11-15 19:55:36,023 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 19:55:36,023 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 19:55:36,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2019-11-15 19:55:36,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-15 19:55:36,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2019-11-15 19:55:36,029 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 15 [2019-11-15 19:55:36,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:36,029 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2019-11-15 19:55:36,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:55:36,029 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2019-11-15 19:55:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 19:55:36,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:36,030 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:36,030 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:36,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:36,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1105861739, now seen corresponding path program 1 times [2019-11-15 19:55:36,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:36,031 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310708518] [2019-11-15 19:55:36,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:36,031 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:36,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:36,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310708518] [2019-11-15 19:55:36,104 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:36,105 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:55:36,105 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57262001] [2019-11-15 19:55:36,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:55:36,106 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:55:36,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:36,106 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 4 states. [2019-11-15 19:55:36,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:36,351 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-15 19:55:36,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:55:36,352 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-15 19:55:36,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:36,353 INFO L225 Difference]: With dead ends: 134 [2019-11-15 19:55:36,353 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 19:55:36,353 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:55:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 19:55:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-11-15 19:55:36,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 19:55:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2019-11-15 19:55:36,358 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 15 [2019-11-15 19:55:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:36,359 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2019-11-15 19:55:36,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:55:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2019-11-15 19:55:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 19:55:36,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:36,363 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:36,366 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash -964443199, now seen corresponding path program 1 times [2019-11-15 19:55:36,368 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:36,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10437877] [2019-11-15 19:55:36,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:36,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:36,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:36,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:36,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10437877] [2019-11-15 19:55:36,459 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:36,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:55:36,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111804041] [2019-11-15 19:55:36,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:55:36,460 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:36,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:55:36,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:55:36,461 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand 5 states. [2019-11-15 19:55:36,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:36,754 INFO L93 Difference]: Finished difference Result 232 states and 252 transitions. [2019-11-15 19:55:36,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:55:36,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 19:55:36,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:36,756 INFO L225 Difference]: With dead ends: 232 [2019-11-15 19:55:36,756 INFO L226 Difference]: Without dead ends: 232 [2019-11-15 19:55:36,756 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:55:36,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-15 19:55:36,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 134. [2019-11-15 19:55:36,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 19:55:36,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2019-11-15 19:55:36,762 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 22 [2019-11-15 19:55:36,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:36,763 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2019-11-15 19:55:36,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:55:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2019-11-15 19:55:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 19:55:36,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:36,764 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:36,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:36,765 INFO L82 PathProgramCache]: Analyzing trace with hash -964443306, now seen corresponding path program 1 times [2019-11-15 19:55:36,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:36,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101225384] [2019-11-15 19:55:36,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:36,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:36,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:36,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:36,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101225384] [2019-11-15 19:55:36,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:36,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:55:36,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724929893] [2019-11-15 19:55:36,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:55:36,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:36,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:55:36,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:55:36,857 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand 6 states. [2019-11-15 19:55:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:37,172 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-15 19:55:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:55:37,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-15 19:55:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:37,174 INFO L225 Difference]: With dead ends: 128 [2019-11-15 19:55:37,174 INFO L226 Difference]: Without dead ends: 128 [2019-11-15 19:55:37,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:55:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-15 19:55:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-11-15 19:55:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-15 19:55:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 138 transitions. [2019-11-15 19:55:37,179 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 138 transitions. Word has length 22 [2019-11-15 19:55:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:37,179 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 138 transitions. [2019-11-15 19:55:37,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:55:37,180 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 138 transitions. [2019-11-15 19:55:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 19:55:37,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:37,181 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:37,181 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:37,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -964443305, now seen corresponding path program 1 times [2019-11-15 19:55:37,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:37,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071841268] [2019-11-15 19:55:37,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:37,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:37,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:37,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:37,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:37,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071841268] [2019-11-15 19:55:37,313 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:37,313 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:55:37,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980317859] [2019-11-15 19:55:37,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:55:37,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:55:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:55:37,314 INFO L87 Difference]: Start difference. First operand 127 states and 138 transitions. Second operand 5 states. [2019-11-15 19:55:37,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:37,617 INFO L93 Difference]: Finished difference Result 208 states and 227 transitions. [2019-11-15 19:55:37,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:55:37,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-15 19:55:37,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:37,619 INFO L225 Difference]: With dead ends: 208 [2019-11-15 19:55:37,619 INFO L226 Difference]: Without dead ends: 208 [2019-11-15 19:55:37,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:55:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-15 19:55:37,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2019-11-15 19:55:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-11-15 19:55:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 209 transitions. [2019-11-15 19:55:37,625 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 209 transitions. Word has length 22 [2019-11-15 19:55:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:37,625 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 209 transitions. [2019-11-15 19:55:37,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:55:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 209 transitions. [2019-11-15 19:55:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 19:55:37,626 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:37,627 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:37,627 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash 700452024, now seen corresponding path program 1 times [2019-11-15 19:55:37,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:37,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484762538] [2019-11-15 19:55:37,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:37,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:37,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:37,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:37,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:37,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484762538] [2019-11-15 19:55:37,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:37,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:55:37,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102571747] [2019-11-15 19:55:37,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:55:37,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:37,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:55:37,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:55:37,705 INFO L87 Difference]: Start difference. First operand 166 states and 209 transitions. Second operand 5 states. [2019-11-15 19:55:38,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:38,048 INFO L93 Difference]: Finished difference Result 207 states and 226 transitions. [2019-11-15 19:55:38,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:55:38,049 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-15 19:55:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:38,051 INFO L225 Difference]: With dead ends: 207 [2019-11-15 19:55:38,051 INFO L226 Difference]: Without dead ends: 207 [2019-11-15 19:55:38,052 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:55:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-15 19:55:38,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 167. [2019-11-15 19:55:38,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-15 19:55:38,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 210 transitions. [2019-11-15 19:55:38,060 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 210 transitions. Word has length 27 [2019-11-15 19:55:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:38,061 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 210 transitions. [2019-11-15 19:55:38,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:55:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 210 transitions. [2019-11-15 19:55:38,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 19:55:38,066 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:38,066 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:38,067 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:38,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:38,067 INFO L82 PathProgramCache]: Analyzing trace with hash 699312989, now seen corresponding path program 1 times [2019-11-15 19:55:38,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:38,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694605539] [2019-11-15 19:55:38,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:38,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:38,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:38,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:38,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694605539] [2019-11-15 19:55:38,218 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:38,218 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 19:55:38,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638029393] [2019-11-15 19:55:38,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:55:38,219 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:38,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:55:38,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:55:38,219 INFO L87 Difference]: Start difference. First operand 167 states and 210 transitions. Second operand 7 states. [2019-11-15 19:55:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:38,634 INFO L93 Difference]: Finished difference Result 195 states and 239 transitions. [2019-11-15 19:55:38,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:55:38,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-11-15 19:55:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:38,637 INFO L225 Difference]: With dead ends: 195 [2019-11-15 19:55:38,637 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 19:55:38,637 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:55:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 19:55:38,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 174. [2019-11-15 19:55:38,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 19:55:38,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 218 transitions. [2019-11-15 19:55:38,644 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 218 transitions. Word has length 27 [2019-11-15 19:55:38,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:38,645 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 218 transitions. [2019-11-15 19:55:38,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:55:38,645 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 218 transitions. [2019-11-15 19:55:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 19:55:38,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:38,653 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:38,654 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:38,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:38,654 INFO L82 PathProgramCache]: Analyzing trace with hash -2079633473, now seen corresponding path program 1 times [2019-11-15 19:55:38,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:38,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955385958] [2019-11-15 19:55:38,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:38,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:38,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:38,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955385958] [2019-11-15 19:55:38,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:38,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 19:55:38,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745845327] [2019-11-15 19:55:38,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 19:55:38,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:38,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 19:55:38,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:55:38,995 INFO L87 Difference]: Start difference. First operand 174 states and 218 transitions. Second operand 12 states. [2019-11-15 19:55:39,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:39,936 INFO L93 Difference]: Finished difference Result 232 states and 283 transitions. [2019-11-15 19:55:39,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 19:55:39,936 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-11-15 19:55:39,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:39,938 INFO L225 Difference]: With dead ends: 232 [2019-11-15 19:55:39,938 INFO L226 Difference]: Without dead ends: 232 [2019-11-15 19:55:39,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-11-15 19:55:39,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-11-15 19:55:39,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 181. [2019-11-15 19:55:39,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-15 19:55:39,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 227 transitions. [2019-11-15 19:55:39,949 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 227 transitions. Word has length 30 [2019-11-15 19:55:39,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:39,951 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 227 transitions. [2019-11-15 19:55:39,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 19:55:39,952 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 227 transitions. [2019-11-15 19:55:39,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 19:55:39,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:39,954 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:39,955 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:39,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:39,956 INFO L82 PathProgramCache]: Analyzing trace with hash -2079633472, now seen corresponding path program 1 times [2019-11-15 19:55:39,956 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:39,956 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806388571] [2019-11-15 19:55:39,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:39,956 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:39,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:39,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:40,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:40,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806388571] [2019-11-15 19:55:40,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:40,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 19:55:40,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814404613] [2019-11-15 19:55:40,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 19:55:40,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:40,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 19:55:40,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:55:40,308 INFO L87 Difference]: Start difference. First operand 181 states and 227 transitions. Second operand 11 states. [2019-11-15 19:55:40,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:40,976 INFO L93 Difference]: Finished difference Result 211 states and 255 transitions. [2019-11-15 19:55:40,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:55:40,976 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2019-11-15 19:55:40,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:40,978 INFO L225 Difference]: With dead ends: 211 [2019-11-15 19:55:40,978 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 19:55:40,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-11-15 19:55:40,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 19:55:40,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 181. [2019-11-15 19:55:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-15 19:55:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2019-11-15 19:55:40,983 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 30 [2019-11-15 19:55:40,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:40,984 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2019-11-15 19:55:40,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 19:55:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2019-11-15 19:55:40,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 19:55:40,984 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:40,985 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:40,985 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:40,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:40,985 INFO L82 PathProgramCache]: Analyzing trace with hash -44129566, now seen corresponding path program 1 times [2019-11-15 19:55:40,985 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:40,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106464164] [2019-11-15 19:55:40,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:40,986 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:40,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:41,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:41,237 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106464164] [2019-11-15 19:55:41,237 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:41,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 19:55:41,238 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670417444] [2019-11-15 19:55:41,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 19:55:41,239 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:41,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:55:41,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:55:41,240 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand 10 states. [2019-11-15 19:55:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:41,665 INFO L93 Difference]: Finished difference Result 208 states and 252 transitions. [2019-11-15 19:55:41,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:55:41,666 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-15 19:55:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:41,667 INFO L225 Difference]: With dead ends: 208 [2019-11-15 19:55:41,667 INFO L226 Difference]: Without dead ends: 208 [2019-11-15 19:55:41,668 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2019-11-15 19:55:41,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-11-15 19:55:41,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 181. [2019-11-15 19:55:41,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-15 19:55:41,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2019-11-15 19:55:41,673 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 31 [2019-11-15 19:55:41,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:41,674 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2019-11-15 19:55:41,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 19:55:41,674 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2019-11-15 19:55:41,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 19:55:41,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:41,674 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:41,675 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:41,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:41,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1367969633, now seen corresponding path program 1 times [2019-11-15 19:55:41,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:41,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487839875] [2019-11-15 19:55:41,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:41,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:41,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:41,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:41,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:41,907 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487839875] [2019-11-15 19:55:41,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:41,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 19:55:41,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942008395] [2019-11-15 19:55:41,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 19:55:41,908 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:41,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:55:41,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:55:41,909 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand 10 states. [2019-11-15 19:55:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:42,615 INFO L93 Difference]: Finished difference Result 233 states and 279 transitions. [2019-11-15 19:55:42,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 19:55:42,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-15 19:55:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:42,616 INFO L225 Difference]: With dead ends: 233 [2019-11-15 19:55:42,616 INFO L226 Difference]: Without dead ends: 233 [2019-11-15 19:55:42,617 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-11-15 19:55:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-11-15 19:55:42,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 183. [2019-11-15 19:55:42,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-15 19:55:42,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 227 transitions. [2019-11-15 19:55:42,621 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 227 transitions. Word has length 32 [2019-11-15 19:55:42,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:42,621 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 227 transitions. [2019-11-15 19:55:42,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 19:55:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 227 transitions. [2019-11-15 19:55:42,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 19:55:42,622 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:42,622 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:42,623 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:42,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:42,623 INFO L82 PathProgramCache]: Analyzing trace with hash 542614566, now seen corresponding path program 1 times [2019-11-15 19:55:42,623 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:42,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758150989] [2019-11-15 19:55:42,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:42,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:42,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:42,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:42,847 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:42,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758150989] [2019-11-15 19:55:42,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:42,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 19:55:42,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078863251] [2019-11-15 19:55:42,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 19:55:42,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:42,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 19:55:42,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-15 19:55:42,849 INFO L87 Difference]: Start difference. First operand 183 states and 227 transitions. Second operand 11 states. [2019-11-15 19:55:43,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:43,561 INFO L93 Difference]: Finished difference Result 214 states and 258 transitions. [2019-11-15 19:55:43,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 19:55:43,561 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2019-11-15 19:55:43,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:43,563 INFO L225 Difference]: With dead ends: 214 [2019-11-15 19:55:43,563 INFO L226 Difference]: Without dead ends: 214 [2019-11-15 19:55:43,563 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-11-15 19:55:43,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-11-15 19:55:43,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 184. [2019-11-15 19:55:43,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-15 19:55:43,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 228 transitions. [2019-11-15 19:55:43,570 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 228 transitions. Word has length 33 [2019-11-15 19:55:43,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:43,570 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 228 transitions. [2019-11-15 19:55:43,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 19:55:43,570 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 228 transitions. [2019-11-15 19:55:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 19:55:43,571 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:43,571 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:43,571 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:43,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:43,572 INFO L82 PathProgramCache]: Analyzing trace with hash -358817407, now seen corresponding path program 1 times [2019-11-15 19:55:43,572 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:43,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839284933] [2019-11-15 19:55:43,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:43,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:43,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:43,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:43,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 19:55:43,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839284933] [2019-11-15 19:55:43,637 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:43,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:55:43,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330616324] [2019-11-15 19:55:43,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:55:43,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:43,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:55:43,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:55:43,638 INFO L87 Difference]: Start difference. First operand 184 states and 228 transitions. Second operand 5 states. [2019-11-15 19:55:44,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:44,124 INFO L93 Difference]: Finished difference Result 255 states and 319 transitions. [2019-11-15 19:55:44,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:55:44,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-15 19:55:44,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:44,126 INFO L225 Difference]: With dead ends: 255 [2019-11-15 19:55:44,126 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 19:55:44,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:55:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 19:55:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 188. [2019-11-15 19:55:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 19:55:44,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2019-11-15 19:55:44,133 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 34 [2019-11-15 19:55:44,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:44,134 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2019-11-15 19:55:44,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:55:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2019-11-15 19:55:44,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 19:55:44,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:44,136 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:44,136 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:44,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:44,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1226137372, now seen corresponding path program 1 times [2019-11-15 19:55:44,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:44,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140128153] [2019-11-15 19:55:44,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:44,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:44,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:44,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:44,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:44,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140128153] [2019-11-15 19:55:44,602 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787312770] [2019-11-15 19:55:44,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:44,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-15 19:55:44,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:44,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:55:44,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:44,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:55:44,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:44,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2019-11-15 19:55:44,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:44,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 19:55:44,906 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,922 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:44,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:44,929 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-15 19:55:44,930 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:44,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,939 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:23 [2019-11-15 19:55:44,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:44,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:55:44,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:44,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:44,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-11-15 19:55:45,020 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:55:45,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:45,045 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:55:45,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:45,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:45,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-15 19:55:45,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:45,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-15 19:55:45,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:45,222 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:45,233 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-15 19:55:45,234 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:45,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:45,265 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:66 [2019-11-15 19:55:45,709 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_$Pointer$.offset|], 20=[|#memory_$Pointer$.base|]} [2019-11-15 19:55:45,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:45,715 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:45,716 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:55:45,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 21 [2019-11-15 19:55:45,722 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 19:55:45,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,759 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:45,760 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:55:45,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:55:45,762 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:55:45,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:45,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 44 treesize of output 83 [2019-11-15 19:55:45,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,814 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:45,874 INFO L567 ElimStorePlain]: treesize reduction 48, result has 44.8 percent of original size [2019-11-15 19:55:45,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:45,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-15 19:55:45,881 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:104, output treesize:37 [2019-11-15 19:55:46,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:46,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:46,045 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:55:46,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 27 [2019-11-15 19:55:46,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249486673] [2019-11-15 19:55:46,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 19:55:46,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:46,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 19:55:46,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=607, Unknown=0, NotChecked=0, Total=702 [2019-11-15 19:55:46,048 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand 27 states. [2019-11-15 19:55:47,019 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 47 [2019-11-15 19:55:49,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:49,167 INFO L93 Difference]: Finished difference Result 220 states and 272 transitions. [2019-11-15 19:55:49,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 19:55:49,168 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-11-15 19:55:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:49,170 INFO L225 Difference]: With dead ends: 220 [2019-11-15 19:55:49,170 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 19:55:49,171 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=290, Invalid=1602, Unknown=0, NotChecked=0, Total=1892 [2019-11-15 19:55:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 19:55:49,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 190. [2019-11-15 19:55:49,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-15 19:55:49,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 241 transitions. [2019-11-15 19:55:49,179 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 241 transitions. Word has length 36 [2019-11-15 19:55:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:49,180 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 241 transitions. [2019-11-15 19:55:49,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 19:55:49,180 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 241 transitions. [2019-11-15 19:55:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-15 19:55:49,181 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:49,181 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:49,395 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:49,395 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:49,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:49,396 INFO L82 PathProgramCache]: Analyzing trace with hash 644445789, now seen corresponding path program 1 times [2019-11-15 19:55:49,396 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:49,396 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449330635] [2019-11-15 19:55:49,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:49,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:49,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:49,968 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-15 19:55:49,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449330635] [2019-11-15 19:55:49,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45167738] [2019-11-15 19:55:49,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:50,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 19:55:50,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:50,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 19:55:50,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:50,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:50,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:50,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:47 [2019-11-15 19:55:50,455 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:50,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 38 [2019-11-15 19:55:50,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:50,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:50,458 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:50,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:50,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:50,483 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-15 19:55:50,484 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:60 [2019-11-15 19:55:50,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:50,924 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-15 19:55:50,925 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:55:50,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2019-11-15 19:55:50,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462025088] [2019-11-15 19:55:50,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 19:55:50,928 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:50,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 19:55:50,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2019-11-15 19:55:50,930 INFO L87 Difference]: Start difference. First operand 190 states and 241 transitions. Second operand 26 states. [2019-11-15 19:55:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:52,635 INFO L93 Difference]: Finished difference Result 192 states and 242 transitions. [2019-11-15 19:55:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 19:55:52,637 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2019-11-15 19:55:52,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:52,638 INFO L225 Difference]: With dead ends: 192 [2019-11-15 19:55:52,638 INFO L226 Difference]: Without dead ends: 175 [2019-11-15 19:55:52,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 19:55:52,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2019-11-15 19:55:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2019-11-15 19:55:52,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-15 19:55:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 225 transitions. [2019-11-15 19:55:52,644 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 225 transitions. Word has length 37 [2019-11-15 19:55:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:52,644 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 225 transitions. [2019-11-15 19:55:52,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 19:55:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 225 transitions. [2019-11-15 19:55:52,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 19:55:52,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:52,645 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:55:52,845 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:52,848 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:55:52,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:52,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1977055467, now seen corresponding path program 1 times [2019-11-15 19:55:52,848 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:52,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120363638] [2019-11-15 19:55:52,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:52,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:52,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:53,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:53,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120363638] [2019-11-15 19:55:53,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130673560] [2019-11-15 19:55:53,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:53,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 19:55:53,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:53,335 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:53,335 INFO L375 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 12 treesize of output 28 [2019-11-15 19:55:53,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,346 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 19:55:53,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,346 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 19:55:53,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:53,385 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 19:55:53,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,392 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:53,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2019-11-15 19:55:53,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:55:53,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:53,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-11-15 19:55:53,492 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:53,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 61 [2019-11-15 19:55:53,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:53,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,512 INFO L567 ElimStorePlain]: treesize reduction 22, result has 63.9 percent of original size [2019-11-15 19:55:53,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:55:53,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:47, output treesize:36 [2019-11-15 19:55:53,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:55:53,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 34 [2019-11-15 19:55:53,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:53,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,577 INFO L567 ElimStorePlain]: treesize reduction 10, result has 50.0 percent of original size [2019-11-15 19:55:53,577 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:55:53,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2019-11-15 19:55:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:55:53,584 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:55:53,584 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-11-15 19:55:53,584 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120510036] [2019-11-15 19:55:53,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 19:55:53,585 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:53,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 19:55:53,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-11-15 19:55:53,586 INFO L87 Difference]: Start difference. First operand 175 states and 225 transitions. Second operand 20 states. [2019-11-15 19:56:03,957 WARN L191 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-15 19:56:14,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:14,656 INFO L93 Difference]: Finished difference Result 196 states and 222 transitions. [2019-11-15 19:56:14,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 19:56:14,657 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2019-11-15 19:56:14,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:14,658 INFO L225 Difference]: With dead ends: 196 [2019-11-15 19:56:14,658 INFO L226 Difference]: Without dead ends: 196 [2019-11-15 19:56:14,658 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=330, Invalid=1303, Unknown=7, NotChecked=0, Total=1640 [2019-11-15 19:56:14,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-15 19:56:14,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 171. [2019-11-15 19:56:14,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 19:56:14,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 219 transitions. [2019-11-15 19:56:14,664 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 219 transitions. Word has length 41 [2019-11-15 19:56:14,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:14,665 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 219 transitions. [2019-11-15 19:56:14,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 19:56:14,665 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 219 transitions. [2019-11-15 19:56:14,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-15 19:56:14,665 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:14,666 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:14,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:14,870 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:14,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1977055468, now seen corresponding path program 1 times [2019-11-15 19:56:14,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:14,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881191528] [2019-11-15 19:56:14,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:14,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:14,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:15,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:15,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881191528] [2019-11-15 19:56:15,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863046215] [2019-11-15 19:56:15,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:15,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-15 19:56:15,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:15,404 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:15,404 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:15,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:15,419 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,429 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:15,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,430 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:21 [2019-11-15 19:56:15,476 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 34 [2019-11-15 19:56:15,476 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:15,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2019-11-15 19:56:15,492 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:15,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:20 [2019-11-15 19:56:15,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 19:56:15,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:15,678 INFO L375 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 15 treesize of output 7 [2019-11-15 19:56:15,679 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:15,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:15,687 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:9 [2019-11-15 19:56:15,714 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-15 19:56:15,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:56:15,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 16 [2019-11-15 19:56:15,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279283866] [2019-11-15 19:56:15,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 19:56:15,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:15,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 19:56:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-15 19:56:15,717 INFO L87 Difference]: Start difference. First operand 171 states and 219 transitions. Second operand 10 states. [2019-11-15 19:56:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:16,142 INFO L93 Difference]: Finished difference Result 195 states and 221 transitions. [2019-11-15 19:56:16,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 19:56:16,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-15 19:56:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:16,144 INFO L225 Difference]: With dead ends: 195 [2019-11-15 19:56:16,144 INFO L226 Difference]: Without dead ends: 195 [2019-11-15 19:56:16,144 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:56:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-15 19:56:16,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 171. [2019-11-15 19:56:16,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-15 19:56:16,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 218 transitions. [2019-11-15 19:56:16,149 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 218 transitions. Word has length 41 [2019-11-15 19:56:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:16,149 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 218 transitions. [2019-11-15 19:56:16,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 19:56:16,150 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 218 transitions. [2019-11-15 19:56:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 19:56:16,150 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:16,150 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:16,354 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:16,354 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:16,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:16,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1516592557, now seen corresponding path program 1 times [2019-11-15 19:56:16,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:16,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796332559] [2019-11-15 19:56:16,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:16,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:16,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 19:56:16,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796332559] [2019-11-15 19:56:16,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:56:16,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 19:56:16,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189244079] [2019-11-15 19:56:16,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 19:56:16,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 19:56:16,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:56:16,412 INFO L87 Difference]: Start difference. First operand 171 states and 218 transitions. Second operand 7 states. [2019-11-15 19:56:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:16,728 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2019-11-15 19:56:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 19:56:16,731 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-15 19:56:16,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:16,732 INFO L225 Difference]: With dead ends: 170 [2019-11-15 19:56:16,732 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 19:56:16,733 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 19:56:16,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 19:56:16,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-11-15 19:56:16,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 19:56:16,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 216 transitions. [2019-11-15 19:56:16,737 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 216 transitions. Word has length 45 [2019-11-15 19:56:16,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:16,738 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 216 transitions. [2019-11-15 19:56:16,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 19:56:16,738 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 216 transitions. [2019-11-15 19:56:16,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 19:56:16,738 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:16,738 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:16,739 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:16,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:16,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1516592558, now seen corresponding path program 1 times [2019-11-15 19:56:16,739 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:16,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865795164] [2019-11-15 19:56:16,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:16,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:16,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:16,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:17,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:17,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865795164] [2019-11-15 19:56:17,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2017965656] [2019-11-15 19:56:17,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:17,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-15 19:56:17,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:17,262 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,262 INFO L375 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 12 treesize of output 28 [2019-11-15 19:56:17,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,275 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 19:56:17,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,276 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-15 19:56:17,314 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:56:17,315 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 19:56:17,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:17,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-15 19:56:17,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:56:17,409 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,416 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-15 19:56:17,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-15 19:56:17,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-15 19:56:17,491 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:17,498 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:17,498 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:11 [2019-11-15 19:56:17,548 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:17,548 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:17,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2019-11-15 19:56:17,549 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114130350] [2019-11-15 19:56:17,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 19:56:17,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:17,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 19:56:17,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:56:17,550 INFO L87 Difference]: Start difference. First operand 170 states and 216 transitions. Second operand 22 states. [2019-11-15 19:56:18,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:18,697 INFO L93 Difference]: Finished difference Result 230 states and 257 transitions. [2019-11-15 19:56:18,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 19:56:18,698 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-11-15 19:56:18,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:18,699 INFO L225 Difference]: With dead ends: 230 [2019-11-15 19:56:18,699 INFO L226 Difference]: Without dead ends: 230 [2019-11-15 19:56:18,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=317, Invalid=1243, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 19:56:18,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-15 19:56:18,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 170. [2019-11-15 19:56:18,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 19:56:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2019-11-15 19:56:18,704 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 45 [2019-11-15 19:56:18,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:18,705 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2019-11-15 19:56:18,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 19:56:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2019-11-15 19:56:18,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:56:18,706 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:18,706 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:18,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:18,910 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:18,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:18,910 INFO L82 PathProgramCache]: Analyzing trace with hash -938288368, now seen corresponding path program 1 times [2019-11-15 19:56:18,910 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:18,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858757169] [2019-11-15 19:56:18,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:18,910 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:18,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:19,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858757169] [2019-11-15 19:56:19,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013962018] [2019-11-15 19:56:19,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:56:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:19,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 19:56:19,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:19,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:19,351 INFO L375 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 12 treesize of output 28 [2019-11-15 19:56:19,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,364 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 19:56:19,364 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 19:56:19,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:19,398 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2019-11-15 19:56:19,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:19,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-15 19:56:19,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:19,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:19,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-11-15 19:56:19,482 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:19,483 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 59 [2019-11-15 19:56:19,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:56:19,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:19,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 19:56:19,504 INFO L567 ElimStorePlain]: treesize reduction 44, result has 45.7 percent of original size [2019-11-15 19:56:19,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:19,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:45, output treesize:34 [2019-11-15 19:56:19,565 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:19,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 32 [2019-11-15 19:56:19,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:19,567 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:19,588 INFO L567 ElimStorePlain]: treesize reduction 10, result has 52.4 percent of original size [2019-11-15 19:56:19,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:19,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:5 [2019-11-15 19:56:19,596 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:19,597 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:19,597 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2019-11-15 19:56:19,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981568473] [2019-11-15 19:56:19,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 19:56:19,598 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:19,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 19:56:19,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-15 19:56:19,598 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand 16 states. [2019-11-15 19:56:24,033 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-15 19:56:26,090 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-11-15 19:56:28,210 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 41 DAG size of output: 28 [2019-11-15 19:56:30,291 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 41 DAG size of output: 34 [2019-11-15 19:56:30,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:30,837 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2019-11-15 19:56:30,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 19:56:30,837 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 49 [2019-11-15 19:56:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:30,838 INFO L225 Difference]: With dead ends: 190 [2019-11-15 19:56:30,838 INFO L226 Difference]: Without dead ends: 190 [2019-11-15 19:56:30,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=271, Invalid=1061, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 19:56:30,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-11-15 19:56:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 170. [2019-11-15 19:56:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-15 19:56:30,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 213 transitions. [2019-11-15 19:56:30,843 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 213 transitions. Word has length 49 [2019-11-15 19:56:30,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:30,844 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 213 transitions. [2019-11-15 19:56:30,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 19:56:30,844 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 213 transitions. [2019-11-15 19:56:30,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:56:30,845 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:30,845 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:31,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:31,049 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:31,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:31,050 INFO L82 PathProgramCache]: Analyzing trace with hash -901476360, now seen corresponding path program 1 times [2019-11-15 19:56:31,050 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:31,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868472253] [2019-11-15 19:56:31,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:31,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:31,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:31,672 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 25 [2019-11-15 19:56:31,907 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 40 [2019-11-15 19:56:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:32,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868472253] [2019-11-15 19:56:32,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116320793] [2019-11-15 19:56:32,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:56:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:32,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 61 conjunts are in the unsatisfiable core [2019-11-15 19:56:32,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:32,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:32,487 INFO L375 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 12 treesize of output 28 [2019-11-15 19:56:32,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,505 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-15 19:56:32,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,506 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-11-15 19:56:32,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 19:56:32,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:32,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,625 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:20 [2019-11-15 19:56:32,687 INFO L341 Elim1Store]: treesize reduction 14, result has 85.9 percent of original size [2019-11-15 19:56:32,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 99 [2019-11-15 19:56:32,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,716 INFO L567 ElimStorePlain]: treesize reduction 46, result has 45.9 percent of original size [2019-11-15 19:56:32,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:39 [2019-11-15 19:56:32,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2019-11-15 19:56:32,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:32,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2019-11-15 19:56:32,818 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 19:56:32,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 29 [2019-11-15 19:56:32,819 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:32,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:32,834 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-15 19:56:32,834 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:46 [2019-11-15 19:56:33,025 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-15 19:56:33,025 INFO L341 Elim1Store]: treesize reduction 14, result has 88.9 percent of original size [2019-11-15 19:56:33,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 33 treesize of output 129 [2019-11-15 19:56:33,026 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:33,106 INFO L567 ElimStorePlain]: treesize reduction 60, result has 53.5 percent of original size [2019-11-15 19:56:33,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:33,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:69 [2019-11-15 19:56:33,217 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 19:56:33,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:33,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:33,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:33,247 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:83, output treesize:72 [2019-11-15 19:56:33,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:33,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 19:56:33,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:33,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:33,359 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-15 19:56:33,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:79 [2019-11-15 19:56:33,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:33,434 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:33,489 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:33,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 127 [2019-11-15 19:56:33,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:33,492 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:33,568 INFO L567 ElimStorePlain]: treesize reduction 78, result has 54.1 percent of original size [2019-11-15 19:56:33,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:33,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:109, output treesize:138 [2019-11-15 19:56:34,026 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 10=[|#memory_$Pointer$.base|]} [2019-11-15 19:56:34,035 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-15 19:56:34,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:34,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:34,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:34,119 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:34,120 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 103 [2019-11-15 19:56:34,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:34,134 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:34,194 INFO L567 ElimStorePlain]: treesize reduction 52, result has 45.8 percent of original size [2019-11-15 19:56:34,195 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-15 19:56:34,195 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:150, output treesize:41 [2019-11-15 19:56:34,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:34,382 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 41 [2019-11-15 19:56:34,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:34,405 INFO L567 ElimStorePlain]: treesize reduction 22, result has 56.9 percent of original size [2019-11-15 19:56:34,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:34,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:29 [2019-11-15 19:56:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:34,476 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:34,477 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 37 [2019-11-15 19:56:34,477 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509384115] [2019-11-15 19:56:34,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-15 19:56:34,477 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:34,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-15 19:56:34,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2019-11-15 19:56:34,478 INFO L87 Difference]: Start difference. First operand 170 states and 213 transitions. Second operand 38 states. [2019-11-15 19:56:35,821 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-11-15 19:56:37,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:37,408 INFO L93 Difference]: Finished difference Result 263 states and 317 transitions. [2019-11-15 19:56:37,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 19:56:37,408 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 52 [2019-11-15 19:56:37,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:37,409 INFO L225 Difference]: With dead ends: 263 [2019-11-15 19:56:37,410 INFO L226 Difference]: Without dead ends: 263 [2019-11-15 19:56:37,411 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 913 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=565, Invalid=2975, Unknown=0, NotChecked=0, Total=3540 [2019-11-15 19:56:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-11-15 19:56:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 168. [2019-11-15 19:56:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-11-15 19:56:37,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 208 transitions. [2019-11-15 19:56:37,416 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 208 transitions. Word has length 52 [2019-11-15 19:56:37,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:37,417 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 208 transitions. [2019-11-15 19:56:37,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-15 19:56:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 208 transitions. [2019-11-15 19:56:37,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 19:56:37,417 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:37,417 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:56:37,618 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:37,621 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:37,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash -901476359, now seen corresponding path program 1 times [2019-11-15 19:56:37,624 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:37,624 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788948068] [2019-11-15 19:56:37,624 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:37,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:37,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:38,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:38,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788948068] [2019-11-15 19:56:38,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518793685] [2019-11-15 19:56:38,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:56:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:39,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-15 19:56:39,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:39,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-15 19:56:39,024 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,029 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,029 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-15 19:56:39,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,073 INFO L375 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 12 treesize of output 28 [2019-11-15 19:56:39,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,096 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-11-15 19:56:39,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,108 INFO L375 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 12 treesize of output 28 [2019-11-15 19:56:39,108 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,130 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 19:56:39,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:27 [2019-11-15 19:56:39,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 19:56:39,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,243 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-15 19:56:39,247 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,260 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:45 [2019-11-15 19:56:39,296 INFO L392 ElimStorePlain]: Different costs {3=[|v_#length_61|], 6=[|v_#valid_90|]} [2019-11-15 19:56:39,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:39,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:39,317 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 42 [2019-11-15 19:56:39,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,395 INFO L341 Elim1Store]: treesize reduction 14, result has 85.9 percent of original size [2019-11-15 19:56:39,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 99 [2019-11-15 19:56:39,396 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,443 INFO L567 ElimStorePlain]: treesize reduction 46, result has 60.0 percent of original size [2019-11-15 19:56:39,443 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,443 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:69 [2019-11-15 19:56:39,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2019-11-15 19:56:39,490 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,519 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 19:56:39,519 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,544 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:83 [2019-11-15 19:56:39,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:39,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 34 [2019-11-15 19:56:39,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:39,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-11-15 19:56:39,646 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,673 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:121, output treesize:83 [2019-11-15 19:56:39,714 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 57 [2019-11-15 19:56:39,714 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 50 [2019-11-15 19:56:39,749 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,794 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.0 percent of original size [2019-11-15 19:56:39,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,794 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:94, output treesize:85 [2019-11-15 19:56:39,884 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 19:56:39,885 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-15 19:56:39,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:39,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:39,977 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:107, output treesize:85 [2019-11-15 19:56:39,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:39,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-11-15 19:56:39,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:40,035 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:40,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:40,046 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-11-15 19:56:40,047 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:40,077 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:40,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:40,078 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:107, output treesize:99 [2019-11-15 19:56:40,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:40,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:40,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 200 [2019-11-15 19:56:40,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:56:40,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:56:40,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:56:40,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 19:56:40,359 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 55 [2019-11-15 19:56:40,360 INFO L567 ElimStorePlain]: treesize reduction 2463, result has 5.6 percent of original size [2019-11-15 19:56:40,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:40,368 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 126 [2019-11-15 19:56:40,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:40,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:40,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:40,414 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:151, output treesize:213 [2019-11-15 19:56:40,806 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:40,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:40,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 5 case distinctions, treesize of input 205 treesize of output 160 [2019-11-15 19:56:40,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:40,888 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:40,988 INFO L567 ElimStorePlain]: treesize reduction 112, result has 41.4 percent of original size [2019-11-15 19:56:40,988 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:40,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:231, output treesize:79 [2019-11-15 19:56:41,112 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-15 19:56:41,113 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:41,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:41,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:41,141 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:79, output treesize:44 [2019-11-15 19:56:41,342 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:41,343 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:41,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 35 [2019-11-15 19:56:41,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239814323] [2019-11-15 19:56:41,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-15 19:56:41,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-15 19:56:41,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1068, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 19:56:41,345 INFO L87 Difference]: Start difference. First operand 168 states and 208 transitions. Second operand 36 states. [2019-11-15 19:56:42,245 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2019-11-15 19:56:42,503 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-11-15 19:56:42,822 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2019-11-15 19:56:43,158 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 88 [2019-11-15 19:56:43,435 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 66 [2019-11-15 19:56:44,010 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-11-15 19:56:46,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:46,181 INFO L93 Difference]: Finished difference Result 289 states and 343 transitions. [2019-11-15 19:56:46,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 19:56:46,182 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2019-11-15 19:56:46,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:46,183 INFO L225 Difference]: With dead ends: 289 [2019-11-15 19:56:46,184 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 19:56:46,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 37 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=785, Invalid=3121, Unknown=0, NotChecked=0, Total=3906 [2019-11-15 19:56:46,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 19:56:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 179. [2019-11-15 19:56:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 19:56:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 230 transitions. [2019-11-15 19:56:46,191 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 230 transitions. Word has length 52 [2019-11-15 19:56:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:46,191 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 230 transitions. [2019-11-15 19:56:46,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-15 19:56:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 230 transitions. [2019-11-15 19:56:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 19:56:46,192 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:46,192 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:46,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:46,393 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:46,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2119003998, now seen corresponding path program 1 times [2019-11-15 19:56:46,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:46,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345009814] [2019-11-15 19:56:46,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:46,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:46,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:46,736 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 34 [2019-11-15 19:56:47,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:47,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345009814] [2019-11-15 19:56:47,110 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195333280] [2019-11-15 19:56:47,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:56:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:47,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 44 conjunts are in the unsatisfiable core [2019-11-15 19:56:47,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:47,352 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:47,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-15 19:56:47,353 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:47,384 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 19:56:47,385 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:47,385 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 19:56:47,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:47,473 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:47,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:47,483 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:47,483 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-11-15 19:56:47,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:47,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-11-15 19:56:47,523 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:47,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:47,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:47,536 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:52 [2019-11-15 19:56:47,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:48,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:48,199 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, v_prenex_6], 6=[|#memory_$Pointer$.base|, v_prenex_4]} [2019-11-15 19:56:48,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2019-11-15 19:56:48,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:48,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:48,264 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 76 [2019-11-15 19:56:48,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:48,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:48,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:48,352 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:48,352 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 77 treesize of output 60 [2019-11-15 19:56:48,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:48,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:48,355 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-15 19:56:48,464 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-15 19:56:48,464 INFO L567 ElimStorePlain]: treesize reduction 14, result has 88.8 percent of original size [2019-11-15 19:56:48,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:48,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:48,481 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:48,481 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 48 [2019-11-15 19:56:48,482 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-15 19:56:48,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:48,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:48,532 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 19:56:48,533 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:177, output treesize:70 [2019-11-15 19:56:48,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:48,936 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2019-11-15 19:56:48,936 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:48,945 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-15 19:56:48,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:48,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:11 [2019-11-15 19:56:49,027 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:49,027 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:49,028 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-11-15 19:56:49,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259124751] [2019-11-15 19:56:49,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-15 19:56:49,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:49,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-15 19:56:49,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1005, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 19:56:49,029 INFO L87 Difference]: Start difference. First operand 179 states and 230 transitions. Second operand 34 states. [2019-11-15 19:56:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:52,489 INFO L93 Difference]: Finished difference Result 329 states and 372 transitions. [2019-11-15 19:56:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 19:56:52,489 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 53 [2019-11-15 19:56:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:52,491 INFO L225 Difference]: With dead ends: 329 [2019-11-15 19:56:52,491 INFO L226 Difference]: Without dead ends: 329 [2019-11-15 19:56:52,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1219 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=507, Invalid=3783, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 19:56:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-11-15 19:56:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 182. [2019-11-15 19:56:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-15 19:56:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 235 transitions. [2019-11-15 19:56:52,497 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 235 transitions. Word has length 53 [2019-11-15 19:56:52,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:52,497 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 235 transitions. [2019-11-15 19:56:52,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-15 19:56:52,497 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 235 transitions. [2019-11-15 19:56:52,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 19:56:52,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:52,498 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:52,698 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:52,699 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:52,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:52,699 INFO L82 PathProgramCache]: Analyzing trace with hash 2119003999, now seen corresponding path program 1 times [2019-11-15 19:56:52,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:52,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463644697] [2019-11-15 19:56:52,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:52,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:52,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:53,177 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463644697] [2019-11-15 19:56:53,178 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173209181] [2019-11-15 19:56:53,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:56:53,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:53,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 19:56:53,323 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:53,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-15 19:56:53,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:53,349 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-15 19:56:53,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:53,402 INFO L375 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 12 treesize of output 28 [2019-11-15 19:56:53,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,436 INFO L567 ElimStorePlain]: treesize reduction 14, result has 58.8 percent of original size [2019-11-15 19:56:53,436 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,436 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-11-15 19:56:53,560 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:53,560 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:53,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-15 19:56:53,616 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_52|], 2=[|v_#memory_$Pointer$.base_64|]} [2019-11-15 19:56:53,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2019-11-15 19:56:53,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:53,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:53,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2019-11-15 19:56:53,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:53,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:53,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:53,657 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:47 [2019-11-15 19:56:54,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,054 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:54,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:54,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:54,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 74 [2019-11-15 19:56:54,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,069 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:54,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:54,129 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:54,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:54,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 86 [2019-11-15 19:56:54,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,145 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:54,234 INFO L567 ElimStorePlain]: treesize reduction 18, result has 87.9 percent of original size [2019-11-15 19:56:54,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2019-11-15 19:56:54,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:179, output treesize:131 [2019-11-15 19:56:54,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:54,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:56:54,608 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-15 19:56:54,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-15 19:56:54,635 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:54,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 44 [2019-11-15 19:56:54,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:54,835 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 84 [2019-11-15 19:56:54,835 INFO L567 ElimStorePlain]: treesize reduction 12, result has 93.7 percent of original size [2019-11-15 19:56:54,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:54,854 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:54,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 58 [2019-11-15 19:56:54,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:54,949 INFO L567 ElimStorePlain]: treesize reduction 26, result has 84.5 percent of original size [2019-11-15 19:56:54,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:54,966 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:54,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 52 [2019-11-15 19:56:54,966 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:55,063 INFO L567 ElimStorePlain]: treesize reduction 12, result has 91.1 percent of original size [2019-11-15 19:56:55,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:55,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2019-11-15 19:56:55,081 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:55,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:55,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:55,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-11-15 19:56:55,134 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:212, output treesize:79 [2019-11-15 19:56:55,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:55,402 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:55,403 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:56:55,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 30 [2019-11-15 19:56:55,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520529970] [2019-11-15 19:56:55,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 19:56:55,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:56:55,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 19:56:55,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2019-11-15 19:56:55,404 INFO L87 Difference]: Start difference. First operand 182 states and 235 transitions. Second operand 31 states. [2019-11-15 19:56:58,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:56:58,079 INFO L93 Difference]: Finished difference Result 268 states and 313 transitions. [2019-11-15 19:56:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 19:56:58,080 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2019-11-15 19:56:58,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:56:58,082 INFO L225 Difference]: With dead ends: 268 [2019-11-15 19:56:58,082 INFO L226 Difference]: Without dead ends: 268 [2019-11-15 19:56:58,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=394, Invalid=2258, Unknown=0, NotChecked=0, Total=2652 [2019-11-15 19:56:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-11-15 19:56:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 198. [2019-11-15 19:56:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-11-15 19:56:58,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 266 transitions. [2019-11-15 19:56:58,088 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 266 transitions. Word has length 53 [2019-11-15 19:56:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:56:58,088 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 266 transitions. [2019-11-15 19:56:58,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 19:56:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 266 transitions. [2019-11-15 19:56:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 19:56:58,089 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:56:58,089 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:56:58,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:56:58,296 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:56:58,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:56:58,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2119003194, now seen corresponding path program 1 times [2019-11-15 19:56:58,297 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:56:58,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991925646] [2019-11-15 19:56:58,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:58,297 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:56:58,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:56:58,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:56:58,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991925646] [2019-11-15 19:56:58,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150493490] [2019-11-15 19:56:58,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:56:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:56:58,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-15 19:56:58,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:56:58,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:56:58,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,767 INFO L567 ElimStorePlain]: treesize reduction 3, result has 84.2 percent of original size [2019-11-15 19:56:58,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-11-15 19:56:58,816 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:56:58,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-15 19:56:58,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:58,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2019-11-15 19:56:58,863 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:58,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:56:58,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:58,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,870 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-11-15 19:56:58,916 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:56:58,916 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,926 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:58,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-11-15 19:56:58,983 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 19:56:58,983 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 19:56:58,984 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:58,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:58,997 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-15 19:56:58,997 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2019-11-15 19:56:59,156 INFO L341 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 19:56:59,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 19:56:59,156 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:59,198 INFO L567 ElimStorePlain]: treesize reduction 19, result has 70.3 percent of original size [2019-11-15 19:56:59,198 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-15 19:56:59,198 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:41 [2019-11-15 19:56:59,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:59,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 39 [2019-11-15 19:56:59,319 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:59,351 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:59,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 82 [2019-11-15 19:56:59,352 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:59,424 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.9 percent of original size [2019-11-15 19:56:59,425 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 2 xjuncts. [2019-11-15 19:56:59,425 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:93, output treesize:71 [2019-11-15 19:56:59,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:59,486 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.base_71|], 10=[v_prenex_22]} [2019-11-15 19:56:59,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:59,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2019-11-15 19:56:59,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:59,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:59,496 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:56:59,551 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.6 percent of original size [2019-11-15 19:56:59,581 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:56:59,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 94 [2019-11-15 19:56:59,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:56:59,650 INFO L567 ElimStorePlain]: treesize reduction 68, result has 58.8 percent of original size [2019-11-15 19:56:59,650 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-15 19:56:59,651 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:102, output treesize:106 [2019-11-15 19:56:59,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:59,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:56:59,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,137 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 19:57:00,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:00,147 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|, v_prenex_28, v_prenex_26], 1=[v_prenex_25], 7=[|#memory_$Pointer$.base|, v_prenex_27]} [2019-11-15 19:57:00,151 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2019-11-15 19:57:00,151 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:00,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:00,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2019-11-15 19:57:00,194 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:00,230 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:00,235 INFO L375 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 53 treesize of output 49 [2019-11-15 19:57:00,235 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:00,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:00,277 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:00,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 30 [2019-11-15 19:57:00,278 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:00,340 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.1 percent of original size [2019-11-15 19:57:00,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:00,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 73 [2019-11-15 19:57:00,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,378 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-15 19:57:00,478 INFO L567 ElimStorePlain]: treesize reduction 12, result has 89.9 percent of original size [2019-11-15 19:57:00,504 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:00,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 73 [2019-11-15 19:57:00,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,508 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:00,595 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.2 percent of original size [2019-11-15 19:57:00,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,598 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 19:57:00,598 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:186, output treesize:87 [2019-11-15 19:57:00,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:00,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:02,098 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2019-11-15 19:57:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:02,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:02,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:02,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2019-11-15 19:57:02,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:02,183 INFO L567 ElimStorePlain]: treesize reduction 4, result has 73.3 percent of original size [2019-11-15 19:57:02,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:02,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-11-15 19:57:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:02,235 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:57:02,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20] total 30 [2019-11-15 19:57:02,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794787135] [2019-11-15 19:57:02,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 19:57:02,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:02,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 19:57:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=821, Unknown=2, NotChecked=0, Total=930 [2019-11-15 19:57:02,236 INFO L87 Difference]: Start difference. First operand 198 states and 266 transitions. Second operand 31 states. [2019-11-15 19:57:03,149 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 63 [2019-11-15 19:57:03,449 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-11-15 19:57:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:05,195 INFO L93 Difference]: Finished difference Result 261 states and 308 transitions. [2019-11-15 19:57:05,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-11-15 19:57:05,195 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 53 [2019-11-15 19:57:05,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:05,196 INFO L225 Difference]: With dead ends: 261 [2019-11-15 19:57:05,196 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 19:57:05,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=515, Invalid=3021, Unknown=4, NotChecked=0, Total=3540 [2019-11-15 19:57:05,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 19:57:05,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 201. [2019-11-15 19:57:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-15 19:57:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 265 transitions. [2019-11-15 19:57:05,202 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 265 transitions. Word has length 53 [2019-11-15 19:57:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:05,202 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 265 transitions. [2019-11-15 19:57:05,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 19:57:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 265 transitions. [2019-11-15 19:57:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 19:57:05,202 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:05,203 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:57:05,403 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:57:05,408 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:57:05,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:05,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2119003195, now seen corresponding path program 1 times [2019-11-15 19:57:05,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:05,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551762969] [2019-11-15 19:57:05,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:05,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:05,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:57:05,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551762969] [2019-11-15 19:57:05,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:57:05,485 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:57:05,485 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874431645] [2019-11-15 19:57:05,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:57:05,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:05,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:57:05,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:57:05,486 INFO L87 Difference]: Start difference. First operand 201 states and 265 transitions. Second operand 6 states. [2019-11-15 19:57:05,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:05,821 INFO L93 Difference]: Finished difference Result 242 states and 303 transitions. [2019-11-15 19:57:05,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:57:05,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-11-15 19:57:05,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:05,823 INFO L225 Difference]: With dead ends: 242 [2019-11-15 19:57:05,823 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 19:57:05,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 19:57:05,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 19:57:05,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 215. [2019-11-15 19:57:05,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-15 19:57:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 286 transitions. [2019-11-15 19:57:05,828 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 286 transitions. Word has length 53 [2019-11-15 19:57:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:05,828 INFO L462 AbstractCegarLoop]: Abstraction has 215 states and 286 transitions. [2019-11-15 19:57:05,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:57:05,828 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 286 transitions. [2019-11-15 19:57:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 19:57:05,829 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:05,829 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:57:05,829 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:57:05,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:05,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1876260450, now seen corresponding path program 1 times [2019-11-15 19:57:05,830 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:05,830 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930993066] [2019-11-15 19:57:05,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:05,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:05,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:06,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930993066] [2019-11-15 19:57:06,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11707907] [2019-11-15 19:57:06,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:57:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:06,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-15 19:57:06,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:06,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:57:06,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,599 INFO L567 ElimStorePlain]: treesize reduction 3, result has 84.2 percent of original size [2019-11-15 19:57:06,599 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,599 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-11-15 19:57:06,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 19:57:06,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:06,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:06,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:06,623 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-11-15 19:57:06,623 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:06,627 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:06,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,634 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:16 [2019-11-15 19:57:06,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:06,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:57:06,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:06,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:15 [2019-11-15 19:57:06,659 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:06,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:57:06,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:06,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-11-15 19:57:06,699 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-15 19:57:06,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 19:57:06,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:06,706 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-15 19:57:06,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:22 [2019-11-15 19:57:06,851 INFO L341 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 19:57:06,852 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 19:57:06,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:06,887 INFO L567 ElimStorePlain]: treesize reduction 23, result has 65.7 percent of original size [2019-11-15 19:57:06,888 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-15 19:57:06,888 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:40 [2019-11-15 19:57:06,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:07,018 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:07,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 77 [2019-11-15 19:57:07,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,025 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2019-11-15 19:57:07,026 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,101 INFO L567 ElimStorePlain]: treesize reduction 28, result has 68.5 percent of original size [2019-11-15 19:57:07,101 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 2 xjuncts. [2019-11-15 19:57:07,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:61 [2019-11-15 19:57:07,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:07,182 INFO L392 ElimStorePlain]: Different costs {4=[v_prenex_29], 10=[|v_#memory_$Pointer$.base_78|]} [2019-11-15 19:57:07,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:07,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2019-11-15 19:57:07,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,263 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.8 percent of original size [2019-11-15 19:57:07,313 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:07,314 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 89 [2019-11-15 19:57:07,314 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,391 INFO L567 ElimStorePlain]: treesize reduction 80, result has 48.7 percent of original size [2019-11-15 19:57:07,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 19:57:07,392 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:81 [2019-11-15 19:57:07,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:07,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:07,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:07,751 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-15 19:57:07,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:07,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 56 [2019-11-15 19:57:07,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2019-11-15 19:57:07,776 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,781 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 60 [2019-11-15 19:57:07,781 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:07,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:07,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-11-15 19:57:07,834 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:181, output treesize:156 [2019-11-15 19:57:08,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,229 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.base_79|], 28=[v_prenex_32, v_prenex_31]} [2019-11-15 19:57:08,318 INFO L341 Elim1Store]: treesize reduction 24, result has 73.6 percent of original size [2019-11-15 19:57:08,319 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 60 treesize of output 100 [2019-11-15 19:57:08,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,336 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:08,523 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 62 [2019-11-15 19:57:08,523 INFO L567 ElimStorePlain]: treesize reduction 64, result has 73.4 percent of original size [2019-11-15 19:57:08,617 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:08,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 68 treesize of output 166 [2019-11-15 19:57:08,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:08,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:08,923 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:09,061 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 60 [2019-11-15 19:57:09,061 INFO L567 ElimStorePlain]: treesize reduction 144, result has 52.8 percent of original size [2019-11-15 19:57:09,197 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-15 19:57:09,197 INFO L341 Elim1Store]: treesize reduction 36, result has 78.8 percent of original size [2019-11-15 19:57:09,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 72 treesize of output 174 [2019-11-15 19:57:09,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,534 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-15 19:57:09,733 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2019-11-15 19:57:09,734 INFO L567 ElimStorePlain]: treesize reduction 156, result has 46.8 percent of original size [2019-11-15 19:57:09,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2019-11-15 19:57:09,736 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:201, output treesize:137 [2019-11-15 19:57:09,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:09,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:09,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,532 INFO L392 ElimStorePlain]: Different costs {7=[|#memory_$Pointer$.base|], 15=[v_prenex_39]} [2019-11-15 19:57:10,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:10,542 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:57:10,555 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-15 19:57:10,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 39 [2019-11-15 19:57:10,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:10,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:10,578 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:57:10,636 INFO L341 Elim1Store]: treesize reduction 8, result has 88.2 percent of original size [2019-11-15 19:57:10,636 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 94 [2019-11-15 19:57:10,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,646 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:10,728 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.8 percent of original size [2019-11-15 19:57:10,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 19:57:10,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:131, output treesize:44 [2019-11-15 19:57:10,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:10,793 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 19:57:10,793 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22] total 34 [2019-11-15 19:57:10,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669937197] [2019-11-15 19:57:10,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 19:57:10,794 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:57:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 19:57:10,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1063, Unknown=2, NotChecked=0, Total=1190 [2019-11-15 19:57:10,794 INFO L87 Difference]: Start difference. First operand 215 states and 286 transitions. Second operand 35 states. [2019-11-15 19:57:11,661 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-11-15 19:57:11,910 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-11-15 19:57:12,466 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-15 19:57:12,641 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-15 19:57:12,842 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-11-15 19:57:13,028 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 74 [2019-11-15 19:57:13,163 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 72 [2019-11-15 19:57:14,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:57:14,263 INFO L93 Difference]: Finished difference Result 262 states and 338 transitions. [2019-11-15 19:57:14,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 19:57:14,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 57 [2019-11-15 19:57:14,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:57:14,265 INFO L225 Difference]: With dead ends: 262 [2019-11-15 19:57:14,265 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 19:57:14,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 35 SyntacticMatches, 16 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 969 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=365, Invalid=2599, Unknown=6, NotChecked=0, Total=2970 [2019-11-15 19:57:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 19:57:14,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2019-11-15 19:57:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2019-11-15 19:57:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 328 transitions. [2019-11-15 19:57:14,272 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 328 transitions. Word has length 57 [2019-11-15 19:57:14,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:57:14,272 INFO L462 AbstractCegarLoop]: Abstraction has 252 states and 328 transitions. [2019-11-15 19:57:14,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 19:57:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 328 transitions. [2019-11-15 19:57:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-15 19:57:14,273 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:14,273 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-15 19:57:14,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:57:14,474 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr41REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr24REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr0REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr33REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr12REQUIRES_VIOLATION]=== [2019-11-15 19:57:14,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:14,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1876260449, now seen corresponding path program 1 times [2019-11-15 19:57:14,474 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:57:14,474 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701698481] [2019-11-15 19:57:14,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,474 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:57:14,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:57:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:15,094 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 41 [2019-11-15 19:57:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:57:15,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701698481] [2019-11-15 19:57:15,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419772295] [2019-11-15 19:57:15,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/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-15 19:57:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:57:15,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-15 19:57:15,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:57:15,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:57:15,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,684 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2019-11-15 19:57:15,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-15 19:57:15,687 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,694 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-15 19:57:15,709 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 19:57:15,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,714 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-11-15 19:57:15,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,722 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,722 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,739 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-15 19:57:15,744 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-11-15 19:57:15,751 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,755 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,767 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,767 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,767 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:59, output treesize:23 [2019-11-15 19:57:15,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,776 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:57:15,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,784 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:22 [2019-11-15 19:57:15,803 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:57:15,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,825 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-15 19:57:15,827 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:60, output treesize:36 [2019-11-15 19:57:15,879 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,880 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 19:57:15,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:15,897 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-11-15 19:57:15,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:15,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:15,907 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:74, output treesize:36 [2019-11-15 19:57:16,022 INFO L341 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 19:57:16,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 19:57:16,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,065 INFO L567 ElimStorePlain]: treesize reduction 27, result has 69.3 percent of original size [2019-11-15 19:57:16,105 INFO L341 Elim1Store]: treesize reduction 16, result has 70.9 percent of original size [2019-11-15 19:57:16,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 52 [2019-11-15 19:57:16,105 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,151 INFO L567 ElimStorePlain]: treesize reduction 16, result has 79.2 percent of original size [2019-11-15 19:57:16,151 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,151 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:61 [2019-11-15 19:57:16,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:16,249 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 109 [2019-11-15 19:57:16,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,262 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 62 [2019-11-15 19:57:16,263 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,385 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 40 [2019-11-15 19:57:16,385 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.3 percent of original size [2019-11-15 19:57:16,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 51 [2019-11-15 19:57:16,395 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,421 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:16,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 98 [2019-11-15 19:57:16,422 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,508 INFO L567 ElimStorePlain]: treesize reduction 32, result has 75.6 percent of original size [2019-11-15 19:57:16,509 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 19:57:16,509 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:150, output treesize:99 [2019-11-15 19:57:16,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,597 INFO L392 ElimStorePlain]: Different costs {6=[v_prenex_43, v_prenex_42], 12=[|v_#memory_$Pointer$.offset_59|, |v_#memory_$Pointer$.base_86|]} [2019-11-15 19:57:16,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:57:16,621 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:16,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 92 [2019-11-15 19:57:16,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:16,681 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:16,696 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:16,696 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 103 [2019-11-15 19:57:16,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:16,700 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:16,808 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-15 19:57:16,808 INFO L567 ElimStorePlain]: treesize reduction 52, result has 81.2 percent of original size [2019-11-15 19:57:16,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:16,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 216 [2019-11-15 19:57:16,894 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:17,007 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-15 19:57:17,007 INFO L567 ElimStorePlain]: treesize reduction 52, result has 80.0 percent of original size [2019-11-15 19:57:17,043 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:17,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 125 [2019-11-15 19:57:17,044 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:17,133 INFO L567 ElimStorePlain]: treesize reduction 36, result has 85.5 percent of original size [2019-11-15 19:57:17,134 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-15 19:57:17,134 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:217, output treesize:262 [2019-11-15 19:57:17,616 WARN L191 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 19:57:17,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:18,180 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-15 19:57:18,379 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-15 19:57:18,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,106 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 63 [2019-11-15 19:57:19,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,111 INFO L392 ElimStorePlain]: Different costs {18=[|v_#memory_$Pointer$.offset_60|, |v_#memory_$Pointer$.base_87|], 20=[v_prenex_45, v_prenex_44], 28=[v_prenex_47, v_prenex_46]} [2019-11-15 19:57:19,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:19,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 132 [2019-11-15 19:57:19,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:19,437 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2019-11-15 19:57:19,438 INFO L567 ElimStorePlain]: treesize reduction 48, result has 89.8 percent of original size [2019-11-15 19:57:19,467 INFO L341 Elim1Store]: treesize reduction 40, result has 39.4 percent of original size [2019-11-15 19:57:19,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 104 treesize of output 91 [2019-11-15 19:57:19,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,468 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:57:19,722 WARN L191 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 103 [2019-11-15 19:57:19,722 INFO L567 ElimStorePlain]: treesize reduction 23, result has 94.4 percent of original size [2019-11-15 19:57:19,839 INFO L341 Elim1Store]: treesize reduction 48, result has 68.8 percent of original size [2019-11-15 19:57:19,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 166 treesize of output 212 [2019-11-15 19:57:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,844 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:19,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:19,859 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-15 19:57:20,111 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 99 [2019-11-15 19:57:20,111 INFO L567 ElimStorePlain]: treesize reduction 118, result has 73.7 percent of original size [2019-11-15 19:57:20,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:20,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 114 [2019-11-15 19:57:20,132 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:20,309 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2019-11-15 19:57:20,309 INFO L567 ElimStorePlain]: treesize reduction 64, result has 83.1 percent of original size [2019-11-15 19:57:20,314 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:57:20,393 INFO L341 Elim1Store]: treesize reduction 64, result has 55.9 percent of original size [2019-11-15 19:57:20,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 151 treesize of output 179 [2019-11-15 19:57:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:20,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:20,412 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-15 19:57:20,714 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 88 [2019-11-15 19:57:20,714 INFO L567 ElimStorePlain]: treesize reduction 119, result has 69.5 percent of original size [2019-11-15 19:57:20,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:20,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 107 treesize of output 170 [2019-11-15 19:57:20,770 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:20,963 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 80 [2019-11-15 19:57:20,964 INFO L567 ElimStorePlain]: treesize reduction 132, result has 66.0 percent of original size [2019-11-15 19:57:20,965 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 19:57:20,965 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:437, output treesize:256 [2019-11-15 19:57:21,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:21,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:57:21,348 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_50, v_prenex_48], 6=[v_prenex_53, v_prenex_51], 7=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-11-15 19:57:21,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 63 [2019-11-15 19:57:21,360 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:21,485 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 84 [2019-11-15 19:57:21,485 INFO L567 ElimStorePlain]: treesize reduction 7, result has 97.7 percent of original size [2019-11-15 19:57:21,494 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 33 [2019-11-15 19:57:21,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:21,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,564 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 112 [2019-11-15 19:57:21,565 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:21,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 36 [2019-11-15 19:57:21,616 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:57:21,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:57:21,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 113 [2019-11-15 19:57:21,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:57:21,693 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-15 19:57:21,798 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-11-15 19:57:21,798 INFO L567 ElimStorePlain]: treesize reduction 32, result has 75.6 percent of original size [2019-11-15 19:57:21,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:57:22,000 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-15 19:57:22,004 INFO L168 Benchmark]: Toolchain (without parser) took 110229.25 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 501.7 MB). Free memory was 939.3 MB in the beginning and 1.4 GB in the end (delta: -462.8 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:22,004 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:22,004 INFO L168 Benchmark]: CACSL2BoogieTranslator took 598.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:22,004 INFO L168 Benchmark]: Boogie Preprocessor took 76.16 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:22,004 INFO L168 Benchmark]: RCFGBuilder took 927.20 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: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:22,004 INFO L168 Benchmark]: TraceAbstraction took 108623.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -349.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:22,005 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 598.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.16 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 927.20 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: 65.4 MB). Peak memory consumption was 65.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 108623.65 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 361.2 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -349.9 MB). Peak memory consumption was 11.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 19:57:24,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:57:24,435 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:57:24,447 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:57:24,447 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:57:24,448 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:57:24,450 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:57:24,452 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:57:24,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:57:24,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:57:24,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:57:24,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:57:24,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:57:24,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:57:24,461 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:57:24,462 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:57:24,463 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:57:24,464 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:57:24,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:57:24,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:57:24,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:57:24,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:57:24,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:57:24,475 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:57:24,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:57:24,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:57:24,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:57:24,481 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:57:24,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:57:24,482 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:57:24,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:57:24,484 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:57:24,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:57:24,486 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:57:24,487 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:57:24,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:57:24,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:57:24,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:57:24,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:57:24,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:57:24,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:57:24,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 19:57:24,509 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:57:24,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:57:24,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:57:24,511 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:57:24,511 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:57:24,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:57:24,512 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:57:24,512 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:57:24,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:57:24,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:57:24,513 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:57:24,513 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 19:57:24,514 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 19:57:24,514 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 19:57:24,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:57:24,514 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 19:57:24,515 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 19:57:24,515 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:57:24,515 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:57:24,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:57:24,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:57:24,516 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:57:24,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:57:24,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:57:24,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:57:24,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:57:24,517 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 19:57:24,518 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 19:57:24,518 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 19:57:24,518 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_4e3abcff-1c28-42a4-a55a-b15778d1412c/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> d166d612464eb82f26cf6bd810bec52eb6c5e35a [2019-11-15 19:57:24,555 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:57:24,568 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:57:24,572 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:57:24,574 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:57:24,574 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:57:24,575 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0513.i [2019-11-15 19:57:24,636 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/8cea1658f/afca8d2b917641eeacafff303cf6fbaf/FLAG9aa1516e6 [2019-11-15 19:57:25,147 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:57:25,151 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/sv-benchmarks/c/memsafety/test-0513.i [2019-11-15 19:57:25,170 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/8cea1658f/afca8d2b917641eeacafff303cf6fbaf/FLAG9aa1516e6 [2019-11-15 19:57:25,458 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/data/8cea1658f/afca8d2b917641eeacafff303cf6fbaf [2019-11-15 19:57:25,461 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:57:25,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 19:57:25,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:57:25,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:57:25,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:57:25,472 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:57:25" (1/1) ... [2019-11-15 19:57:25,474 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3252e0d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:25, skipping insertion in model container [2019-11-15 19:57:25,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:57:25" (1/1) ... [2019-11-15 19:57:25,481 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:57:25,519 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:57:25,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:57:25,983 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:57:26,047 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:57:26,123 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:57:26,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26 WrapperNode [2019-11-15 19:57:26,124 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:57:26,125 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:57:26,125 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:57:26,125 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:57:26,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,163 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... [2019-11-15 19:57:26,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:57:26,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:57:26,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:57:26,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:57:26,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:57:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 19:57:26,277 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:57:26,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 19:57:26,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 19:57:26,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 19:57:26,278 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 19:57:26,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 19:57:26,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 19:57:26,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 19:57:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 19:57:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 19:57:26,281 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 19:57:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 19:57:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 19:57:26,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 19:57:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 19:57:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 19:57:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 19:57:26,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 19:57:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 19:57:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 19:57:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 19:57:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 19:57:26,284 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 19:57:26,285 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 19:57:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 19:57:26,286 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 19:57:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 19:57:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 19:57:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 19:57:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 19:57:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 19:57:26,287 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 19:57:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 19:57:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 19:57:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 19:57:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 19:57:26,288 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 19:57:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 19:57:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 19:57:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 19:57:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 19:57:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 19:57:26,289 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 19:57:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 19:57:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 19:57:26,291 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 19:57:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 19:57:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 19:57:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 19:57:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 19:57:26,292 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 19:57:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 19:57:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 19:57:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 19:57:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 19:57:26,293 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 19:57:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 19:57:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 19:57:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 19:57:26,294 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 19:57:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 19:57:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 19:57:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 19:57:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 19:57:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 19:57:26,295 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 19:57:26,296 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 19:57:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 19:57:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 19:57:26,297 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 19:57:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 19:57:26,298 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 19:57:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 19:57:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 19:57:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 19:57:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 19:57:26,299 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 19:57:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 19:57:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 19:57:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 19:57:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 19:57:26,300 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 19:57:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 19:57:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 19:57:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 19:57:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 19:57:26,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 19:57:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 19:57:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 19:57:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 19:57:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 19:57:26,302 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 19:57:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 19:57:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 19:57:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 19:57:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 19:57:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 19:57:26,303 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 19:57:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 19:57:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 19:57:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 19:57:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 19:57:26,304 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 19:57:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 19:57:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 19:57:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 19:57:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 19:57:26,305 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 19:57:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 19:57:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 19:57:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 19:57:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 19:57:26,306 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 19:57:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 19:57:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 19:57:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 19:57:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 19:57:26,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:57:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:57:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 19:57:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:57:26,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:57:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 19:57:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 19:57:26,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:57:27,414 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:57:27,414 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 19:57:27,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:27 BoogieIcfgContainer [2019-11-15 19:57:27,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:57:27,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:57:27,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:57:27,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:57:27,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:57:25" (1/3) ... [2019-11-15 19:57:27,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a157b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:57:27, skipping insertion in model container [2019-11-15 19:57:27,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:57:26" (2/3) ... [2019-11-15 19:57:27,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a157b22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:57:27, skipping insertion in model container [2019-11-15 19:57:27,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:57:27" (3/3) ... [2019-11-15 19:57:27,429 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0513.i [2019-11-15 19:57:27,439 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:57:27,450 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 62 error locations. [2019-11-15 19:57:27,461 INFO L249 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2019-11-15 19:57:27,483 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:57:27,492 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 19:57:27,493 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:57:27,493 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:57:27,493 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:57:27,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:57:27,494 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:57:27,494 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:57:27,522 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states. [2019-11-15 19:57:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 19:57:27,536 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:57:27,537 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:57:27,539 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr59ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr55ASSERT_VIOLATIONMEMORY_FREE, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr54ASSERT_VIOLATIONMEMORY_FREE, mainErr57REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr60ASSERT_VIOLATIONMEMORY_FREE, mainErr30ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr29ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr56REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr61ENSURES_VIOLATIONMEMORY_LEAK, mainErr28ASSERT_VIOLATIONMEMORY_FREE, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr53ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION]=== [2019-11-15 19:57:27,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:57:27,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1412222844, now seen corresponding path program 1 times [2019-11-15 19:57:27,552 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:57:27,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1832147072] [2019-11-15 19:57:27,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e3abcff-1c28-42a4-a55a-b15778d1412c/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:57:27,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:57:27,772 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 19:57:27,781 INFO L168 Benchmark]: Toolchain (without parser) took 2317.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -80.7 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:27,783 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:57:27,783 INFO L168 Benchmark]: CACSL2BoogieTranslator took 657.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:27,785 INFO L168 Benchmark]: Boogie Preprocessor took 91.88 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-15 19:57:27,787 INFO L168 Benchmark]: RCFGBuilder took 1199.06 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: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:27,788 INFO L168 Benchmark]: TraceAbstraction took 361.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-15 19:57:27,798 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.41 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 657.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -165.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 91.88 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 1199.06 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: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 361.24 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Sort C_DOUBLE not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...