./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f369e67185304fce6130a1dfc66e8cb89abf0605 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f369e67185304fce6130a1dfc66e8cb89abf0605 .................................................................................................................................................................................................................................................................................................................................................. 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 23:37:00,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:37:00,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:37:00,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:37:00,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:37:00,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:37:00,633 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:37:00,635 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:37:00,636 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:37:00,637 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:37:00,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:37:00,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:37:00,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:37:00,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:37:00,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:37:00,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:37:00,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:37:00,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:37:00,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:37:00,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:37:00,648 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:37:00,649 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:37:00,650 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:37:00,651 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:37:00,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:37:00,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:37:00,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:37:00,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:37:00,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:37:00,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:37:00,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:37:00,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:37:00,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:37:00,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:37:00,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:37:00,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:37:00,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:37:00,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:37:00,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:37:00,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:37:00,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:37:00,661 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-15 23:37:00,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:37:00,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:37:00,676 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:37:00,676 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:37:00,676 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:37:00,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:37:00,676 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:37:00,677 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:37:00,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:37:00,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:37:00,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:37:00,682 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:37:00,682 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:37:00,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:37:00,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:37:00,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:37:00,683 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:37:00,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:37:00,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:37:00,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:37:00,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:37:00,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:37:00,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:37:00,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:37:00,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:37:00,685 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_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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-memcleanup) ) 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 -> f369e67185304fce6130a1dfc66e8cb89abf0605 [2019-11-15 23:37:00,742 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:37:00,751 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:37:00,754 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:37:00,755 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:37:00,756 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:37:00,756 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-15 23:37:00,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/fe49e40b3/c3a5970bc3224ff2b346b182de9412fb/FLAGb0f1db8b7 [2019-11-15 23:37:01,237 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:37:01,238 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-15 23:37:01,252 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/fe49e40b3/c3a5970bc3224ff2b346b182de9412fb/FLAGb0f1db8b7 [2019-11-15 23:37:01,655 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/fe49e40b3/c3a5970bc3224ff2b346b182de9412fb [2019-11-15 23:37:01,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:37:01,659 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:37:01,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:01,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:37:01,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:37:01,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:01" (1/1) ... [2019-11-15 23:37:01,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0c4c28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:01, skipping insertion in model container [2019-11-15 23:37:01,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:01" (1/1) ... [2019-11-15 23:37:01,675 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:37:01,726 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:37:02,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:02,149 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:37:02,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:02,273 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:37:02,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02 WrapperNode [2019-11-15 23:37:02,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:02,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:37:02,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:37:02,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:37:02,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,302 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,318 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,323 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... [2019-11-15 23:37:02,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:37:02,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:37:02,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:37:02,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:37:02,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:37:02,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:37:02,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:37:02,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:37:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:37:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:37:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:37:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:37:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:37:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:37:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:37:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:37:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:37:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:37:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:37:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:37:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:37:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:37:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:37:02,392 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:37:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:37:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:37:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:37:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:37:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:37:02,393 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:37:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:37:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:37:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:37:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:37:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:37:02,394 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:37:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:37:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:37:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:37:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:37:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:37:02,395 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:37:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:37:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:37:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:37:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:37:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:37:02,396 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:37:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:37:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:37:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:37:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:37:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:37:02,397 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:37:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:37:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:37:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:37:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:37:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:37:02,398 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:37:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:37:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:37:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:37:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:37:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:37:02,399 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:37:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:37:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:37:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:37:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:37:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:37:02,400 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:37:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:37:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:37:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:37:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:37:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:37:02,401 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:37:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:37:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:37:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:37:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:37:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:37:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:37:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:37:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:37:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:37:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:37:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:37:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:37:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:37:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:37:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:37:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:37:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:37:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:37:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:37:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:37:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:37:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:37:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:37:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:37:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:37:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:37:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:37:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:37:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:37:02,406 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:37:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:37:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:37:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:37:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 23:37:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:37:02,407 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:37:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:37:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:37:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:37:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:37:02,408 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:37:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:37:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:37:02,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:37:03,156 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:37:03,156 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:37:03,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:03 BoogieIcfgContainer [2019-11-15 23:37:03,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:37:03,158 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:37:03,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:37:03,161 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:37:03,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:37:01" (1/3) ... [2019-11-15 23:37:03,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1ed7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:37:03, skipping insertion in model container [2019-11-15 23:37:03,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:02" (2/3) ... [2019-11-15 23:37:03,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1ed7ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:37:03, skipping insertion in model container [2019-11-15 23:37:03,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:03" (3/3) ... [2019-11-15 23:37:03,164 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2019-11-15 23:37:03,173 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:37:03,179 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 60 error locations. [2019-11-15 23:37:03,189 INFO L249 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2019-11-15 23:37:03,206 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:37:03,207 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:37:03,207 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:37:03,207 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:37:03,207 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:37:03,207 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:37:03,207 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:37:03,208 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:37:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2019-11-15 23:37:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:37:03,234 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:03,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:03,237 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:03,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1810038840, now seen corresponding path program 1 times [2019-11-15 23:37:03,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:03,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476713442] [2019-11-15 23:37:03,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:03,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:03,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:03,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476713442] [2019-11-15 23:37:03,444 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:03,444 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:03,444 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309581562] [2019-11-15 23:37:03,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:37:03,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:03,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:03,469 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 4 states. [2019-11-15 23:37:03,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:03,995 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2019-11-15 23:37:03,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:03,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:37:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:04,010 INFO L225 Difference]: With dead ends: 154 [2019-11-15 23:37:04,010 INFO L226 Difference]: Without dead ends: 148 [2019-11-15 23:37:04,013 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-15 23:37:04,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 121. [2019-11-15 23:37:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:37:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-15 23:37:04,064 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 7 [2019-11-15 23:37:04,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:04,064 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-15 23:37:04,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:37:04,065 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-15 23:37:04,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:37:04,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:04,066 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:04,066 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:04,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:04,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1810038841, now seen corresponding path program 1 times [2019-11-15 23:37:04,067 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:04,067 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853255711] [2019-11-15 23:37:04,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:04,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:04,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:04,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:04,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:04,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853255711] [2019-11-15 23:37:04,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:04,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:37:04,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284611515] [2019-11-15 23:37:04,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:37:04,150 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:04,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:37:04,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:37:04,150 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 4 states. [2019-11-15 23:37:04,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:04,511 INFO L93 Difference]: Finished difference Result 145 states and 154 transitions. [2019-11-15 23:37:04,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:37:04,512 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:37:04,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:04,514 INFO L225 Difference]: With dead ends: 145 [2019-11-15 23:37:04,514 INFO L226 Difference]: Without dead ends: 145 [2019-11-15 23:37:04,515 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 23:37:04,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-15 23:37:04,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2019-11-15 23:37:04,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:37:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 125 transitions. [2019-11-15 23:37:04,536 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 125 transitions. Word has length 7 [2019-11-15 23:37:04,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:04,537 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 125 transitions. [2019-11-15 23:37:04,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:37:04,537 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 125 transitions. [2019-11-15 23:37:04,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:37:04,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:04,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:04,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:04,539 INFO L82 PathProgramCache]: Analyzing trace with hash 500914497, now seen corresponding path program 1 times [2019-11-15 23:37:04,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:04,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282825712] [2019-11-15 23:37:04,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:04,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:04,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:04,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 23:37:04,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282825712] [2019-11-15 23:37:04,686 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:04,686 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:04,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261020682] [2019-11-15 23:37:04,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:04,687 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:04,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:04,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:04,687 INFO L87 Difference]: Start difference. First operand 118 states and 125 transitions. Second operand 5 states. [2019-11-15 23:37:05,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:05,027 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2019-11-15 23:37:05,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:05,028 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 23:37:05,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:05,030 INFO L225 Difference]: With dead ends: 118 [2019-11-15 23:37:05,030 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 23:37:05,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 23:37:05,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 23:37:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2019-11-15 23:37:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-15 23:37:05,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2019-11-15 23:37:05,043 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 13 [2019-11-15 23:37:05,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:05,043 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2019-11-15 23:37:05,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2019-11-15 23:37:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:37:05,044 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:05,044 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:05,045 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:05,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:05,045 INFO L82 PathProgramCache]: Analyzing trace with hash 500914498, now seen corresponding path program 1 times [2019-11-15 23:37:05,045 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:05,045 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66605158] [2019-11-15 23:37:05,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:05,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:05,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:05,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66605158] [2019-11-15 23:37:05,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:05,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:05,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898139914] [2019-11-15 23:37:05,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:05,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:05,126 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 5 states. [2019-11-15 23:37:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:05,457 INFO L93 Difference]: Finished difference Result 142 states and 154 transitions. [2019-11-15 23:37:05,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:05,458 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 23:37:05,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:05,459 INFO L225 Difference]: With dead ends: 142 [2019-11-15 23:37:05,459 INFO L226 Difference]: Without dead ends: 142 [2019-11-15 23:37:05,460 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 23:37:05,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-15 23:37:05,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2019-11-15 23:37:05,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-15 23:37:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 139 transitions. [2019-11-15 23:37:05,475 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 139 transitions. Word has length 13 [2019-11-15 23:37:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 139 transitions. [2019-11-15 23:37:05,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:05,476 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 139 transitions. [2019-11-15 23:37:05,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:37:05,477 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:05,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:05,477 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:05,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:05,478 INFO L82 PathProgramCache]: Analyzing trace with hash 342494340, now seen corresponding path program 1 times [2019-11-15 23:37:05,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:05,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599825327] [2019-11-15 23:37:05,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:05,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:05,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:05,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599825327] [2019-11-15 23:37:05,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:05,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:05,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355285054] [2019-11-15 23:37:05,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:05,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:05,576 INFO L87 Difference]: Start difference. First operand 124 states and 139 transitions. Second operand 6 states. [2019-11-15 23:37:06,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:06,003 INFO L93 Difference]: Finished difference Result 202 states and 225 transitions. [2019-11-15 23:37:06,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:37:06,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:37:06,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:06,004 INFO L225 Difference]: With dead ends: 202 [2019-11-15 23:37:06,004 INFO L226 Difference]: Without dead ends: 202 [2019-11-15 23:37:06,005 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:37:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-11-15 23:37:06,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 123. [2019-11-15 23:37:06,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-15 23:37:06,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 137 transitions. [2019-11-15 23:37:06,013 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 137 transitions. Word has length 15 [2019-11-15 23:37:06,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:06,014 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 137 transitions. [2019-11-15 23:37:06,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:06,014 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2019-11-15 23:37:06,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:37:06,014 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:06,014 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:06,015 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:06,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 342494341, now seen corresponding path program 1 times [2019-11-15 23:37:06,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:06,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397205354] [2019-11-15 23:37:06,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:06,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:06,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:06,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:06,088 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397205354] [2019-11-15 23:37:06,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:06,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:06,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729980171] [2019-11-15 23:37:06,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:06,089 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:06,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:06,089 INFO L87 Difference]: Start difference. First operand 123 states and 137 transitions. Second operand 6 states. [2019-11-15 23:37:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:06,591 INFO L93 Difference]: Finished difference Result 211 states and 235 transitions. [2019-11-15 23:37:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:37:06,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:37:06,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:06,592 INFO L225 Difference]: With dead ends: 211 [2019-11-15 23:37:06,592 INFO L226 Difference]: Without dead ends: 211 [2019-11-15 23:37:06,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:37:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-15 23:37:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 122. [2019-11-15 23:37:06,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-15 23:37:06,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 135 transitions. [2019-11-15 23:37:06,599 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 135 transitions. Word has length 15 [2019-11-15 23:37:06,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:06,599 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 135 transitions. [2019-11-15 23:37:06,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 135 transitions. [2019-11-15 23:37:06,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:37:06,600 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:06,600 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:06,600 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:06,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:06,601 INFO L82 PathProgramCache]: Analyzing trace with hash 2143887174, now seen corresponding path program 1 times [2019-11-15 23:37:06,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:06,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114565948] [2019-11-15 23:37:06,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:06,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:06,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:06,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:06,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114565948] [2019-11-15 23:37:06,731 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:06,731 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:37:06,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156524005] [2019-11-15 23:37:06,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:37:06,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:06,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:37:06,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:37:06,732 INFO L87 Difference]: Start difference. First operand 122 states and 135 transitions. Second operand 10 states. [2019-11-15 23:37:07,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:07,362 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2019-11-15 23:37:07,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:37:07,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-15 23:37:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:07,363 INFO L225 Difference]: With dead ends: 126 [2019-11-15 23:37:07,363 INFO L226 Difference]: Without dead ends: 126 [2019-11-15 23:37:07,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:37:07,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-15 23:37:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 121. [2019-11-15 23:37:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-15 23:37:07,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 134 transitions. [2019-11-15 23:37:07,368 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 134 transitions. Word has length 19 [2019-11-15 23:37:07,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:07,369 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 134 transitions. [2019-11-15 23:37:07,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:37:07,369 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 134 transitions. [2019-11-15 23:37:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:37:07,370 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:07,370 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:07,370 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:07,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:07,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2143887175, now seen corresponding path program 1 times [2019-11-15 23:37:07,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:07,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335893562] [2019-11-15 23:37:07,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:07,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:07,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:07,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:07,591 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335893562] [2019-11-15 23:37:07,591 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:07,591 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:37:07,591 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240841848] [2019-11-15 23:37:07,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:37:07,592 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:37:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:37:07,592 INFO L87 Difference]: Start difference. First operand 121 states and 134 transitions. Second operand 11 states. [2019-11-15 23:37:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:08,442 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2019-11-15 23:37:08,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:37:08,443 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-15 23:37:08,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:08,444 INFO L225 Difference]: With dead ends: 124 [2019-11-15 23:37:08,444 INFO L226 Difference]: Without dead ends: 124 [2019-11-15 23:37:08,444 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:37:08,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-11-15 23:37:08,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2019-11-15 23:37:08,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-15 23:37:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2019-11-15 23:37:08,448 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 19 [2019-11-15 23:37:08,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:08,449 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2019-11-15 23:37:08,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:37:08,449 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2019-11-15 23:37:08,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-15 23:37:08,450 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:08,450 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:08,450 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:08,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:08,451 INFO L82 PathProgramCache]: Analyzing trace with hash 587283389, now seen corresponding path program 1 times [2019-11-15 23:37:08,451 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:08,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199613189] [2019-11-15 23:37:08,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:08,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:08,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:08,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:08,522 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199613189] [2019-11-15 23:37:08,523 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:08,523 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:08,523 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061712481] [2019-11-15 23:37:08,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:37:08,524 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:08,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:37:08,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:37:08,524 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand 6 states. [2019-11-15 23:37:08,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:08,751 INFO L93 Difference]: Finished difference Result 120 states and 134 transitions. [2019-11-15 23:37:08,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:37:08,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-15 23:37:08,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:08,753 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:37:08,753 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:37:08,753 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:37:08,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:37:08,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 115. [2019-11-15 23:37:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-15 23:37:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2019-11-15 23:37:08,757 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 20 [2019-11-15 23:37:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:08,757 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2019-11-15 23:37:08,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:37:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2019-11-15 23:37:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:37:08,758 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:08,758 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:08,758 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:08,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash 202148497, now seen corresponding path program 1 times [2019-11-15 23:37:08,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:08,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551107142] [2019-11-15 23:37:08,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:08,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:08,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:08,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:08,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551107142] [2019-11-15 23:37:08,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:08,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:08,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48116653] [2019-11-15 23:37:08,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:08,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:08,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:08,838 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand 7 states. [2019-11-15 23:37:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:09,267 INFO L93 Difference]: Finished difference Result 149 states and 166 transitions. [2019-11-15 23:37:09,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:09,267 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 23:37:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:09,269 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:37:09,269 INFO L226 Difference]: Without dead ends: 149 [2019-11-15 23:37:09,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:37:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-15 23:37:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 114. [2019-11-15 23:37:09,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:37:09,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 128 transitions. [2019-11-15 23:37:09,273 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 128 transitions. Word has length 22 [2019-11-15 23:37:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:09,274 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 128 transitions. [2019-11-15 23:37:09,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 128 transitions. [2019-11-15 23:37:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:37:09,275 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:09,275 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:09,275 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:09,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash 202148498, now seen corresponding path program 1 times [2019-11-15 23:37:09,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:09,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021202763] [2019-11-15 23:37:09,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:09,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:09,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:09,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:09,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:09,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021202763] [2019-11-15 23:37:09,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:09,368 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:37:09,368 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078709211] [2019-11-15 23:37:09,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:09,369 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:09,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:09,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:09,369 INFO L87 Difference]: Start difference. First operand 114 states and 128 transitions. Second operand 7 states. [2019-11-15 23:37:09,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:09,826 INFO L93 Difference]: Finished difference Result 155 states and 174 transitions. [2019-11-15 23:37:09,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:09,826 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-15 23:37:09,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:09,827 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:37:09,827 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 23:37:09,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:37:09,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 23:37:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 111. [2019-11-15 23:37:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-15 23:37:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-11-15 23:37:09,831 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 22 [2019-11-15 23:37:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:09,832 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-11-15 23:37:09,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-11-15 23:37:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:37:09,833 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:09,833 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:09,833 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:09,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:09,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1658360218, now seen corresponding path program 1 times [2019-11-15 23:37:09,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:09,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960732496] [2019-11-15 23:37:09,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:09,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:09,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:09,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:09,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:09,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960732496] [2019-11-15 23:37:09,948 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365127684] [2019-11-15 23:37:09,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:10,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:37:10,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:10,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:10,158 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 23:37:10,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,177 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 23:37:10,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:15 [2019-11-15 23:37:10,203 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 23:37:10,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:10,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:23 [2019-11-15 23:37:10,248 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-11-15 23:37:10,248 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 1 case distinctions, treesize of input 31 treesize of output 26 [2019-11-15 23:37:10,249 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:10,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-11-15 23:37:10,319 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:37:10,319 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 34 treesize of output 16 [2019-11-15 23:37:10,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:10,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:10,327 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 23:37:10,327 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:39, output treesize:15 [2019-11-15 23:37:10,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:10,387 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:10,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-11-15 23:37:10,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546455157] [2019-11-15 23:37:10,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:37:10,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:10,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:37:10,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:37:10,388 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 15 states. [2019-11-15 23:37:10,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:10,976 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2019-11-15 23:37:10,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:37:10,976 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2019-11-15 23:37:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:10,977 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:37:10,977 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 23:37:10,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:37:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 23:37:10,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 114. [2019-11-15 23:37:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-15 23:37:10,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2019-11-15 23:37:10,982 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 24 [2019-11-15 23:37:10,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:10,982 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2019-11-15 23:37:10,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:37:10,982 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2019-11-15 23:37:10,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:37:10,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:10,983 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:11,183 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:11,184 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:11,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:11,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1658360219, now seen corresponding path program 1 times [2019-11-15 23:37:11,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:11,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226703761] [2019-11-15 23:37:11,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:11,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:11,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:11,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:11,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226703761] [2019-11-15 23:37:11,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028591002] [2019-11-15 23:37:11,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:11,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:11,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 23:37:11,471 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:11,532 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,533 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 23:37:11,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,563 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,566 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 14 treesize of output 16 [2019-11-15 23:37:11,567 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,578 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-11-15 23:37:11,607 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 23:37:11,607 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,628 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 23:37:11,628 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,641 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 23:37:11,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:38 [2019-11-15 23:37:11,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:11,684 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 37 treesize of output 32 [2019-11-15 23:37:11,684 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:11,700 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 38 treesize of output 33 [2019-11-15 23:37:11,700 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,710 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:64, output treesize:56 [2019-11-15 23:37:11,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:11,786 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 22 [2019-11-15 23:37:11,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,796 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,799 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-15 23:37:11,799 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 19 [2019-11-15 23:37:11,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:11,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:11,807 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 23:37:11,808 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:70, output treesize:22 [2019-11-15 23:37:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:11,859 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:11,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2019-11-15 23:37:11,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226427188] [2019-11-15 23:37:11,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 23:37:11,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:11,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 23:37:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:37:11,860 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 17 states. [2019-11-15 23:37:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:13,039 INFO L93 Difference]: Finished difference Result 174 states and 190 transitions. [2019-11-15 23:37:13,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:37:13,040 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2019-11-15 23:37:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:13,042 INFO L225 Difference]: With dead ends: 174 [2019-11-15 23:37:13,042 INFO L226 Difference]: Without dead ends: 174 [2019-11-15 23:37:13,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:37:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-11-15 23:37:13,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 113. [2019-11-15 23:37:13,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-15 23:37:13,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-11-15 23:37:13,048 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 24 [2019-11-15 23:37:13,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:13,048 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-11-15 23:37:13,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 23:37:13,049 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-11-15 23:37:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:37:13,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:13,050 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:13,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:13,253 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:13,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:13,253 INFO L82 PathProgramCache]: Analyzing trace with hash -132071613, now seen corresponding path program 1 times [2019-11-15 23:37:13,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:13,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678618362] [2019-11-15 23:37:13,253 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:13,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:13,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:13,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678618362] [2019-11-15 23:37:13,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:13,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:37:13,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308649927] [2019-11-15 23:37:13,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:37:13,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:37:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:37:13,360 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 9 states. [2019-11-15 23:37:13,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:13,895 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2019-11-15 23:37:13,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:37:13,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 23:37:13,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:13,897 INFO L225 Difference]: With dead ends: 155 [2019-11-15 23:37:13,897 INFO L226 Difference]: Without dead ends: 155 [2019-11-15 23:37:13,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:37:13,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-15 23:37:13,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 117. [2019-11-15 23:37:13,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:37:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2019-11-15 23:37:13,902 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 25 [2019-11-15 23:37:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:13,902 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2019-11-15 23:37:13,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:37:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2019-11-15 23:37:13,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:37:13,903 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:13,904 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:13,904 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:13,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:13,904 INFO L82 PathProgramCache]: Analyzing trace with hash -132071612, now seen corresponding path program 1 times [2019-11-15 23:37:13,905 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:13,905 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635036490] [2019-11-15 23:37:13,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:13,905 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:13,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:14,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635036490] [2019-11-15 23:37:14,098 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:14,098 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:37:14,098 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062860384] [2019-11-15 23:37:14,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:37:14,099 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:14,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:37:14,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:37:14,099 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand 9 states. [2019-11-15 23:37:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:14,628 INFO L93 Difference]: Finished difference Result 178 states and 195 transitions. [2019-11-15 23:37:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:37:14,629 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 23:37:14,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:14,631 INFO L225 Difference]: With dead ends: 178 [2019-11-15 23:37:14,631 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 23:37:14,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:37:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 23:37:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2019-11-15 23:37:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 23:37:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 134 transitions. [2019-11-15 23:37:14,635 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 134 transitions. Word has length 25 [2019-11-15 23:37:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:14,635 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 134 transitions. [2019-11-15 23:37:14,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:37:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 134 transitions. [2019-11-15 23:37:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:37:14,636 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:14,636 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:14,636 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:14,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 661794806, now seen corresponding path program 1 times [2019-11-15 23:37:14,640 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:14,641 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327009281] [2019-11-15 23:37:14,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:14,641 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:14,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:14,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:14,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327009281] [2019-11-15 23:37:14,732 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:14,732 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:37:14,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869929186] [2019-11-15 23:37:14,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:37:14,733 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:14,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:37:14,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:37:14,733 INFO L87 Difference]: Start difference. First operand 119 states and 134 transitions. Second operand 7 states. [2019-11-15 23:37:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:15,078 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2019-11-15 23:37:15,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:37:15,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-15 23:37:15,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:15,079 INFO L225 Difference]: With dead ends: 177 [2019-11-15 23:37:15,080 INFO L226 Difference]: Without dead ends: 177 [2019-11-15 23:37:15,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:37:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-15 23:37:15,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2019-11-15 23:37:15,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 23:37:15,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2019-11-15 23:37:15,084 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 25 [2019-11-15 23:37:15,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:15,084 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2019-11-15 23:37:15,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:37:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2019-11-15 23:37:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:37:15,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:15,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:15,085 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:15,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:15,085 INFO L82 PathProgramCache]: Analyzing trace with hash -356113091, now seen corresponding path program 1 times [2019-11-15 23:37:15,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:15,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739349487] [2019-11-15 23:37:15,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,086 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:15,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:15,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739349487] [2019-11-15 23:37:15,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:15,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:37:15,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88127728] [2019-11-15 23:37:15,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:15,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:15,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:15,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:15,130 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand 5 states. [2019-11-15 23:37:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:15,317 INFO L93 Difference]: Finished difference Result 153 states and 171 transitions. [2019-11-15 23:37:15,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:15,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-11-15 23:37:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:15,318 INFO L225 Difference]: With dead ends: 153 [2019-11-15 23:37:15,318 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 23:37:15,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 23:37:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 23:37:15,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 131. [2019-11-15 23:37:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-15 23:37:15,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2019-11-15 23:37:15,322 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 28 [2019-11-15 23:37:15,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:15,323 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2019-11-15 23:37:15,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:15,323 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2019-11-15 23:37:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:37:15,323 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:15,324 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:15,324 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:15,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:15,324 INFO L82 PathProgramCache]: Analyzing trace with hash 986819088, now seen corresponding path program 2 times [2019-11-15 23:37:15,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:15,324 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298791163] [2019-11-15 23:37:15,324 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:15,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-15 23:37:15,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298791163] [2019-11-15 23:37:15,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:15,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:37:15,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946409705] [2019-11-15 23:37:15,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:37:15,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:37:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:37:15,509 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand 9 states. [2019-11-15 23:37:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:15,937 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2019-11-15 23:37:15,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:37:15,937 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2019-11-15 23:37:15,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:15,939 INFO L225 Difference]: With dead ends: 160 [2019-11-15 23:37:15,939 INFO L226 Difference]: Without dead ends: 160 [2019-11-15 23:37:15,939 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:37:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-15 23:37:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 129. [2019-11-15 23:37:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 23:37:15,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 145 transitions. [2019-11-15 23:37:15,943 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 145 transitions. Word has length 28 [2019-11-15 23:37:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:15,943 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 145 transitions. [2019-11-15 23:37:15,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:37:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 145 transitions. [2019-11-15 23:37:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:37:15,944 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:15,944 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:15,944 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:15,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1374157825, now seen corresponding path program 1 times [2019-11-15 23:37:15,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:15,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747881951] [2019-11-15 23:37:15,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:15,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:16,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:16,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747881951] [2019-11-15 23:37:16,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:16,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:37:16,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792486618] [2019-11-15 23:37:16,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:37:16,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:16,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:37:16,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:37:16,034 INFO L87 Difference]: Start difference. First operand 129 states and 145 transitions. Second operand 8 states. [2019-11-15 23:37:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:16,350 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2019-11-15 23:37:16,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:37:16,351 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-15 23:37:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:16,352 INFO L225 Difference]: With dead ends: 168 [2019-11-15 23:37:16,352 INFO L226 Difference]: Without dead ends: 168 [2019-11-15 23:37:16,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:37:16,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-15 23:37:16,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 129. [2019-11-15 23:37:16,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-15 23:37:16,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 144 transitions. [2019-11-15 23:37:16,356 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 144 transitions. Word has length 30 [2019-11-15 23:37:16,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:16,356 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 144 transitions. [2019-11-15 23:37:16,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:37:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 144 transitions. [2019-11-15 23:37:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:37:16,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:16,357 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 23:37:16,357 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:16,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:16,358 INFO L82 PathProgramCache]: Analyzing trace with hash -2079082638, now seen corresponding path program 1 times [2019-11-15 23:37:16,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:16,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793442943] [2019-11-15 23:37:16,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:16,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:16,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:16,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:16,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793442943] [2019-11-15 23:37:16,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397901610] [2019-11-15 23:37:16,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:16,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 23:37:16,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:16,678 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 23:37:16,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,708 INFO L567 ElimStorePlain]: treesize reduction 3, result has 90.0 percent of original size [2019-11-15 23:37:16,713 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 23:37:16,713 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,719 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,719 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:23 [2019-11-15 23:37:16,750 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,751 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 23:37:16,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,774 INFO L567 ElimStorePlain]: treesize reduction 5, result has 90.0 percent of original size [2019-11-15 23:37:16,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,778 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 23:37:16,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:41 [2019-11-15 23:37:16,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,829 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 23:37:16,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,846 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,849 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 23:37:16,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,860 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:79, output treesize:41 [2019-11-15 23:37:16,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,878 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 23:37:16,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:40 [2019-11-15 23:37:16,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,932 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 36 treesize of output 23 [2019-11-15 23:37:16,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:16,968 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 36 treesize of output 23 [2019-11-15 23:37:16,969 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:16,979 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:40 [2019-11-15 23:37:16,986 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 26 treesize of output 28 [2019-11-15 23:37:16,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:16,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:17,001 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 26 treesize of output 28 [2019-11-15 23:37:17,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:17,019 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:17,020 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 23:37:17,020 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:60 [2019-11-15 23:37:17,053 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:17,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:17,094 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 5 case distinctions, treesize of input 66 treesize of output 138 [2019-11-15 23:37:17,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:17,141 INFO L567 ElimStorePlain]: treesize reduction 120, result has 40.6 percent of original size [2019-11-15 23:37:17,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:17,144 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2019-11-15 23:37:17,145 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:17,167 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:17,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:17,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:86, output treesize:78 [2019-11-15 23:37:17,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:17,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:17,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 100 treesize of output 138 [2019-11-15 23:37:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:17,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:17,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:17,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:17,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:17,495 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:17,542 INFO L567 ElimStorePlain]: treesize reduction 40, result has 57.0 percent of original size [2019-11-15 23:37:17,569 INFO L341 Elim1Store]: treesize reduction 10, result has 63.0 percent of original size [2019-11-15 23:37:17,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 35 [2019-11-15 23:37:17,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:17,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:17,579 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 23:37:17,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2019-11-15 23:37:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:17,588 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:17,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 22 [2019-11-15 23:37:17,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982379821] [2019-11-15 23:37:17,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:37:17,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:37:17,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:37:17,593 INFO L87 Difference]: Start difference. First operand 129 states and 144 transitions. Second operand 22 states. [2019-11-15 23:37:18,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:18,980 INFO L93 Difference]: Finished difference Result 170 states and 186 transitions. [2019-11-15 23:37:18,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 23:37:18,980 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 23:37:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:18,981 INFO L225 Difference]: With dead ends: 170 [2019-11-15 23:37:18,981 INFO L226 Difference]: Without dead ends: 170 [2019-11-15 23:37:18,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2019-11-15 23:37:18,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-15 23:37:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 144. [2019-11-15 23:37:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:37:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 159 transitions. [2019-11-15 23:37:18,986 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 159 transitions. Word has length 30 [2019-11-15 23:37:18,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:18,986 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 159 transitions. [2019-11-15 23:37:18,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:37:18,986 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 159 transitions. [2019-11-15 23:37:18,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:37:18,987 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:18,987 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:19,190 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:19,191 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:19,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:19,191 INFO L82 PathProgramCache]: Analyzing trace with hash 498153405, now seen corresponding path program 1 times [2019-11-15 23:37:19,191 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:19,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530908668] [2019-11-15 23:37:19,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:19,191 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:19,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:19,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530908668] [2019-11-15 23:37:19,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975149896] [2019-11-15 23:37:19,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:19,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:37:19,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:19,560 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:19,561 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 23:37:19,561 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,587 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 23:37:19,587 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 23:37:19,634 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 23:37:19,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:19,652 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 23:37:19,754 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 23:37:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 23:37:19,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,769 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-15 23:37:19,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,770 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:49, output treesize:22 [2019-11-15 23:37:19,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:19,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 51 [2019-11-15 23:37:19,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:19,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,819 INFO L567 ElimStorePlain]: treesize reduction 20, result has 63.0 percent of original size [2019-11-15 23:37:19,820 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 23:37:19,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:23 [2019-11-15 23:37:19,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:37:19,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:19,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:19,874 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 23:37:19,874 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:15 [2019-11-15 23:37:19,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:19,917 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:19,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-15 23:37:19,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558099673] [2019-11-15 23:37:19,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:37:19,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:19,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:37:19,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:37:19,918 INFO L87 Difference]: Start difference. First operand 144 states and 159 transitions. Second operand 22 states. [2019-11-15 23:37:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:20,926 INFO L93 Difference]: Finished difference Result 227 states and 247 transitions. [2019-11-15 23:37:20,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:37:20,927 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 23:37:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:20,928 INFO L225 Difference]: With dead ends: 227 [2019-11-15 23:37:20,928 INFO L226 Difference]: Without dead ends: 227 [2019-11-15 23:37:20,928 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=881, Unknown=0, NotChecked=0, Total=1122 [2019-11-15 23:37:20,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-15 23:37:20,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 162. [2019-11-15 23:37:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-11-15 23:37:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 184 transitions. [2019-11-15 23:37:20,933 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 184 transitions. Word has length 30 [2019-11-15 23:37:20,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:20,933 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 184 transitions. [2019-11-15 23:37:20,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:37:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 184 transitions. [2019-11-15 23:37:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:37:20,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:20,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:21,138 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:21,139 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:21,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash 498153406, now seen corresponding path program 1 times [2019-11-15 23:37:21,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:21,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984935583] [2019-11-15 23:37:21,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:21,140 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:21,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:21,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984935583] [2019-11-15 23:37:21,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654737018] [2019-11-15 23:37:21,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:21,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:21,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-15 23:37:21,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:21,511 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_68|], 1=[|v_#valid_80|]} [2019-11-15 23:37:21,514 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 23:37:21,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,534 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,535 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 23:37:21,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,545 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 23:37:21,552 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 23:37:21,553 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,590 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 23:37:21,590 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,602 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 23:37:21,602 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 23:37:21,704 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 23:37:21,704 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 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 23:37:21,705 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,731 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.1 percent of original size [2019-11-15 23:37:21,735 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 23:37:21,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,744 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:70, output treesize:24 [2019-11-15 23:37:21,784 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,784 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 56 treesize of output 62 [2019-11-15 23:37:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:21,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:21,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:21,827 INFO L567 ElimStorePlain]: treesize reduction 108, result has 34.1 percent of original size [2019-11-15 23:37:21,831 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 55 treesize of output 50 [2019-11-15 23:37:21,831 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,845 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,846 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,846 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:63, output treesize:25 [2019-11-15 23:37:21,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 23:37:21,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,926 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 23:37:21,926 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:21,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:21,936 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 23:37:21,937 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:9 [2019-11-15 23:37:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:21,940 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:21,941 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2019-11-15 23:37:21,941 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301416929] [2019-11-15 23:37:21,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 23:37:21,941 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:21,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 23:37:21,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:37:21,942 INFO L87 Difference]: Start difference. First operand 162 states and 184 transitions. Second operand 18 states. [2019-11-15 23:37:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:22,832 INFO L93 Difference]: Finished difference Result 234 states and 257 transitions. [2019-11-15 23:37:22,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:37:22,833 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-15 23:37:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:22,834 INFO L225 Difference]: With dead ends: 234 [2019-11-15 23:37:22,834 INFO L226 Difference]: Without dead ends: 234 [2019-11-15 23:37:22,835 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:37:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-11-15 23:37:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 167. [2019-11-15 23:37:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-15 23:37:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 190 transitions. [2019-11-15 23:37:22,840 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 190 transitions. Word has length 30 [2019-11-15 23:37:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:22,840 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 190 transitions. [2019-11-15 23:37:22,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 23:37:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 190 transitions. [2019-11-15 23:37:22,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:37:22,841 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:22,841 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 23:37:23,045 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:23,045 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:23,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:23,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1519358958, now seen corresponding path program 1 times [2019-11-15 23:37:23,046 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:23,046 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716810168] [2019-11-15 23:37:23,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:23,046 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:23,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:23,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:23,234 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 23:37:23,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716810168] [2019-11-15 23:37:23,234 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149920793] [2019-11-15 23:37:23,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:23,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-15 23:37:23,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:23,394 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:23,395 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 23:37:23,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,418 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 23:37:23,418 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,418 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 23:37:23,448 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 23:37:23,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:23,468 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 23:37:23,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:23,550 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 39 treesize of output 57 [2019-11-15 23:37:23,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:23,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-15 23:37:23,574 INFO L567 ElimStorePlain]: treesize reduction 39, result has 52.4 percent of original size [2019-11-15 23:37:23,574 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 23:37:23,575 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-15 23:37:23,706 INFO L341 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 23:37:23,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 71 [2019-11-15 23:37:23,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,729 INFO L567 ElimStorePlain]: treesize reduction 24, result has 61.9 percent of original size [2019-11-15 23:37:23,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:62, output treesize:22 [2019-11-15 23:37:23,768 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:23,769 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 37 treesize of output 51 [2019-11-15 23:37:23,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:23,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:23,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:23,790 INFO L567 ElimStorePlain]: treesize reduction 70, result has 33.3 percent of original size [2019-11-15 23:37:23,790 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 23:37:23,791 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:34 [2019-11-15 23:37:23,858 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:23,858 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 36 treesize of output 31 [2019-11-15 23:37:23,859 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:23,888 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 23:37:23,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:23,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 23:37:23,938 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 23:37:23,938 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:23,938 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2019-11-15 23:37:23,938 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133364701] [2019-11-15 23:37:23,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 23:37:23,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:23,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 23:37:23,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:37:23,940 INFO L87 Difference]: Start difference. First operand 167 states and 190 transitions. Second operand 26 states. [2019-11-15 23:37:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:25,539 INFO L93 Difference]: Finished difference Result 245 states and 278 transitions. [2019-11-15 23:37:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-15 23:37:25,539 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 30 [2019-11-15 23:37:25,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:25,540 INFO L225 Difference]: With dead ends: 245 [2019-11-15 23:37:25,540 INFO L226 Difference]: Without dead ends: 245 [2019-11-15 23:37:25,541 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=482, Invalid=1870, Unknown=0, NotChecked=0, Total=2352 [2019-11-15 23:37:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-15 23:37:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 185. [2019-11-15 23:37:25,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-15 23:37:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2019-11-15 23:37:25,544 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 30 [2019-11-15 23:37:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:25,545 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2019-11-15 23:37:25,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 23:37:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2019-11-15 23:37:25,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:37:25,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:25,545 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 23:37:25,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:25,749 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:25,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:25,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1519358959, now seen corresponding path program 1 times [2019-11-15 23:37:25,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:25,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242795759] [2019-11-15 23:37:25,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:25,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:25,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:25,976 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 23:37:25,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242795759] [2019-11-15 23:37:25,976 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159052813] [2019-11-15 23:37:25,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:26,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:26,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-15 23:37:26,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:26,097 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_69|], 1=[|v_#valid_82|]} [2019-11-15 23:37:26,103 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 23:37:26,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,120 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,120 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 23:37:26,121 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,128 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 23:37:26,135 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 23:37:26,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,148 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 23:37:26,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,157 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,157 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 23:37:26,157 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:31 [2019-11-15 23:37:26,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 23:37:26,184 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,212 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 52 treesize of output 66 [2019-11-15 23:37:26,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:26,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:26,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:37:26,246 INFO L567 ElimStorePlain]: treesize reduction 51, result has 53.2 percent of original size [2019-11-15 23:37:26,247 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:26,247 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:57 [2019-11-15 23:37:26,354 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,355 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 40 treesize of output 63 [2019-11-15 23:37:26,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,388 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-11-15 23:37:26,435 INFO L341 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 23:37:26,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 88 [2019-11-15 23:37:26,436 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,469 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.7 percent of original size [2019-11-15 23:37:26,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:26,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:26,470 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 23:37:26,470 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:96, output treesize:24 [2019-11-15 23:37:26,511 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,511 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 56 treesize of output 62 [2019-11-15 23:37:26,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:26,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:26,513 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:26,548 INFO L567 ElimStorePlain]: treesize reduction 108, result has 34.1 percent of original size [2019-11-15 23:37:26,551 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 55 treesize of output 50 [2019-11-15 23:37:26,551 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,560 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:26,560 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:47 [2019-11-15 23:37:26,642 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,643 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 47 treesize of output 38 [2019-11-15 23:37:26,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,661 INFO L567 ElimStorePlain]: treesize reduction 12, result has 72.1 percent of original size [2019-11-15 23:37:26,664 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-15 23:37:26,664 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:26,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:26,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:9 [2019-11-15 23:37:26,674 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 23:37:26,675 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:26,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2019-11-15 23:37:26,675 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537505362] [2019-11-15 23:37:26,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 23:37:26,675 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:26,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 23:37:26,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:37:26,676 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand 22 states. [2019-11-15 23:37:28,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:28,189 INFO L93 Difference]: Finished difference Result 251 states and 286 transitions. [2019-11-15 23:37:28,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:37:28,190 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 23:37:28,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:28,191 INFO L225 Difference]: With dead ends: 251 [2019-11-15 23:37:28,192 INFO L226 Difference]: Without dead ends: 251 [2019-11-15 23:37:28,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=229, Invalid=1251, Unknown=2, NotChecked=0, Total=1482 [2019-11-15 23:37:28,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-15 23:37:28,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 195. [2019-11-15 23:37:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-11-15 23:37:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 224 transitions. [2019-11-15 23:37:28,197 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 224 transitions. Word has length 30 [2019-11-15 23:37:28,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:28,197 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 224 transitions. [2019-11-15 23:37:28,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 23:37:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 224 transitions. [2019-11-15 23:37:28,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:37:28,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:28,198 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:28,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:28,399 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1738744448, now seen corresponding path program 1 times [2019-11-15 23:37:28,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:28,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068268861] [2019-11-15 23:37:28,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:28,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:28,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:28,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068268861] [2019-11-15 23:37:28,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:28,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 23:37:28,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072298128] [2019-11-15 23:37:28,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:37:28,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:28,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:37:28,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:37:28,572 INFO L87 Difference]: Start difference. First operand 195 states and 224 transitions. Second operand 14 states. [2019-11-15 23:37:29,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:29,331 INFO L93 Difference]: Finished difference Result 242 states and 271 transitions. [2019-11-15 23:37:29,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:37:29,331 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-15 23:37:29,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:29,332 INFO L225 Difference]: With dead ends: 242 [2019-11-15 23:37:29,332 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 23:37:29,333 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:37:29,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 23:37:29,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 199. [2019-11-15 23:37:29,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-15 23:37:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 230 transitions. [2019-11-15 23:37:29,338 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 230 transitions. Word has length 31 [2019-11-15 23:37:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:29,338 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 230 transitions. [2019-11-15 23:37:29,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:37:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 230 transitions. [2019-11-15 23:37:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 23:37:29,339 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:29,339 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:29,339 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1738744447, now seen corresponding path program 1 times [2019-11-15 23:37:29,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:29,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985104276] [2019-11-15 23:37:29,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:29,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:29,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:29,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:29,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985104276] [2019-11-15 23:37:29,569 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:29,569 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 23:37:29,569 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6069425] [2019-11-15 23:37:29,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:37:29,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:29,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:37:29,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:37:29,570 INFO L87 Difference]: Start difference. First operand 199 states and 230 transitions. Second operand 14 states. [2019-11-15 23:37:30,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:30,742 INFO L93 Difference]: Finished difference Result 265 states and 297 transitions. [2019-11-15 23:37:30,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:37:30,743 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 31 [2019-11-15 23:37:30,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:30,744 INFO L225 Difference]: With dead ends: 265 [2019-11-15 23:37:30,744 INFO L226 Difference]: Without dead ends: 265 [2019-11-15 23:37:30,745 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:37:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-11-15 23:37:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 202. [2019-11-15 23:37:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-15 23:37:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 234 transitions. [2019-11-15 23:37:30,749 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 234 transitions. Word has length 31 [2019-11-15 23:37:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:30,750 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 234 transitions. [2019-11-15 23:37:30,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:37:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 234 transitions. [2019-11-15 23:37:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 23:37:30,750 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:30,750 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:30,751 INFO L410 AbstractCegarLoop]: === Iteration 27 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:30,751 INFO L82 PathProgramCache]: Analyzing trace with hash -288061773, now seen corresponding path program 2 times [2019-11-15 23:37:30,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:30,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831121423] [2019-11-15 23:37:30,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:30,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:30,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:31,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831121423] [2019-11-15 23:37:31,091 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405552320] [2019-11-15 23:37:31,091 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:31,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:37:31,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:37:31,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-15 23:37:31,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:31,249 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_70|], 1=[|v_#valid_83|]} [2019-11-15 23:37:31,252 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 23:37:31,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,276 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 23:37:31,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,286 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2019-11-15 23:37:31,320 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 23:37:31,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,332 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,332 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,332 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:27 [2019-11-15 23:37:31,437 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_35|], 2=[|v_#memory_$Pointer$.base_69|]} [2019-11-15 23:37:31,441 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 23:37:31,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,477 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 23:37:31,478 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 1 case distinctions, treesize of input 44 treesize of output 30 [2019-11-15 23:37:31,478 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,508 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-11-15 23:37:31,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,508 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:67, output treesize:36 [2019-11-15 23:37:31,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,563 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 88 treesize of output 82 [2019-11-15 23:37:31,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:31,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,596 INFO L567 ElimStorePlain]: treesize reduction 20, result has 81.1 percent of original size [2019-11-15 23:37:31,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:31,599 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 41 treesize of output 17 [2019-11-15 23:37:31,600 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,611 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 23:37:31,611 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:94, output treesize:48 [2019-11-15 23:37:31,696 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 49 treesize of output 29 [2019-11-15 23:37:31,697 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,705 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 23:37:31,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:25 [2019-11-15 23:37:31,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2019-11-15 23:37:31,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,773 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,773 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 19 treesize of output 19 [2019-11-15 23:37:31,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-11-15 23:37:31,781 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:31,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:31,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:31,783 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:41, output treesize:16 [2019-11-15 23:37:31,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:31,846 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:31,846 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-11-15 23:37:31,846 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701266523] [2019-11-15 23:37:31,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 23:37:31,846 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 23:37:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=632, Unknown=0, NotChecked=0, Total=702 [2019-11-15 23:37:31,847 INFO L87 Difference]: Start difference. First operand 202 states and 234 transitions. Second operand 27 states. [2019-11-15 23:37:33,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:33,738 INFO L93 Difference]: Finished difference Result 254 states and 284 transitions. [2019-11-15 23:37:33,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:37:33,738 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-15 23:37:33,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:33,740 INFO L225 Difference]: With dead ends: 254 [2019-11-15 23:37:33,740 INFO L226 Difference]: Without dead ends: 254 [2019-11-15 23:37:33,740 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=205, Invalid=1355, Unknown=0, NotChecked=0, Total=1560 [2019-11-15 23:37:33,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-11-15 23:37:33,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 204. [2019-11-15 23:37:33,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2019-11-15 23:37:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 236 transitions. [2019-11-15 23:37:33,743 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 236 transitions. Word has length 34 [2019-11-15 23:37:33,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:33,744 INFO L462 AbstractCegarLoop]: Abstraction has 204 states and 236 transitions. [2019-11-15 23:37:33,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 23:37:33,744 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 236 transitions. [2019-11-15 23:37:33,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:37:33,744 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:33,744 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:33,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:33,945 INFO L410 AbstractCegarLoop]: === Iteration 28 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:33,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:33,945 INFO L82 PathProgramCache]: Analyzing trace with hash -280770254, now seen corresponding path program 1 times [2019-11-15 23:37:33,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:33,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289457178] [2019-11-15 23:37:33,945 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:33,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:33,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 23:37:33,986 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289457178] [2019-11-15 23:37:33,986 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:37:33,986 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:37:33,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276139541] [2019-11-15 23:37:33,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:37:33,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:33,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:37:33,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:37:33,987 INFO L87 Difference]: Start difference. First operand 204 states and 236 transitions. Second operand 5 states. [2019-11-15 23:37:34,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:34,209 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2019-11-15 23:37:34,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:37:34,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-15 23:37:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:34,211 INFO L225 Difference]: With dead ends: 210 [2019-11-15 23:37:34,211 INFO L226 Difference]: Without dead ends: 210 [2019-11-15 23:37:34,211 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 23:37:34,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-15 23:37:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 205. [2019-11-15 23:37:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-11-15 23:37:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 237 transitions. [2019-11-15 23:37:34,215 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 237 transitions. Word has length 35 [2019-11-15 23:37:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:34,215 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 237 transitions. [2019-11-15 23:37:34,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:37:34,216 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 237 transitions. [2019-11-15 23:37:34,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:37:34,216 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:34,216 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] [2019-11-15 23:37:34,216 INFO L410 AbstractCegarLoop]: === Iteration 29 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:34,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:34,217 INFO L82 PathProgramCache]: Analyzing trace with hash -341611190, now seen corresponding path program 1 times [2019-11-15 23:37:34,217 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:34,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371220351] [2019-11-15 23:37:34,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:34,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:34,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:34,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371220351] [2019-11-15 23:37:34,545 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646497013] [2019-11-15 23:37:34,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:34,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 47 conjunts are in the unsatisfiable core [2019-11-15 23:37:34,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:34,722 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:34,723 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 23:37:34,723 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:34,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-15 23:37:34,778 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 23:37:34,779 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:34,792 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 23:37:34,792 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:34,806 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 23:37:34,806 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2019-11-15 23:37:34,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:34,902 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 23:37:34,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:34,942 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 23:37:34,942 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 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 23:37:34,942 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,957 INFO L567 ElimStorePlain]: treesize reduction 10, result has 65.5 percent of original size [2019-11-15 23:37:34,958 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:34,958 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:61, output treesize:19 [2019-11-15 23:37:35,008 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:35,009 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 55 treesize of output 73 [2019-11-15 23:37:35,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:35,010 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:35,035 INFO L567 ElimStorePlain]: treesize reduction 24, result has 66.2 percent of original size [2019-11-15 23:37:35,039 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 33 [2019-11-15 23:37:35,039 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:35,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:35,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:35,047 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:39 [2019-11-15 23:37:35,239 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:35,240 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 69 treesize of output 52 [2019-11-15 23:37:35,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:35,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:35,242 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:35,261 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-15 23:37:35,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-15 23:37:35,264 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:35,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:35,272 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 23:37:35,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:7 [2019-11-15 23:37:35,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:35,276 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:35,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 28 [2019-11-15 23:37:35,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707096658] [2019-11-15 23:37:35,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 23:37:35,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:35,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 23:37:35,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=686, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:37:35,277 INFO L87 Difference]: Start difference. First operand 205 states and 237 transitions. Second operand 28 states. [2019-11-15 23:37:37,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:37,239 INFO L93 Difference]: Finished difference Result 253 states and 283 transitions. [2019-11-15 23:37:37,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 23:37:37,241 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 35 [2019-11-15 23:37:37,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:37,243 INFO L225 Difference]: With dead ends: 253 [2019-11-15 23:37:37,243 INFO L226 Difference]: Without dead ends: 253 [2019-11-15 23:37:37,244 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=271, Invalid=2179, Unknown=0, NotChecked=0, Total=2450 [2019-11-15 23:37:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-15 23:37:37,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 207. [2019-11-15 23:37:37,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-11-15 23:37:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2019-11-15 23:37:37,248 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 35 [2019-11-15 23:37:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:37,248 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2019-11-15 23:37:37,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 23:37:37,248 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2019-11-15 23:37:37,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:37:37,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:37,250 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:37,453 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:37,453 INFO L410 AbstractCegarLoop]: === Iteration 30 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1472869294, now seen corresponding path program 2 times [2019-11-15 23:37:37,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:37,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418479392] [2019-11-15 23:37:37,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:37,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:37,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:37,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:37,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418479392] [2019-11-15 23:37:37,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402922029] [2019-11-15 23:37:37,661 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:37,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 23:37:37,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 23:37:37,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 23:37:37,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:37,871 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:37,872 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 23:37:37,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:37,877 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:37,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:37,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:37:37,903 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 23:37:37,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:37,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:37,915 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 23:37:37,915 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:37,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:37,923 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 23:37:37,923 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:18 [2019-11-15 23:37:37,977 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_63|], 2=[|v_#memory_$Pointer$.base_75|]} [2019-11-15 23:37:37,985 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 21 treesize of output 13 [2019-11-15 23:37:37,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,016 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,017 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 43 treesize of output 61 [2019-11-15 23:37:38,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:38,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,019 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:38,054 INFO L567 ElimStorePlain]: treesize reduction 152, result has 22.8 percent of original size [2019-11-15 23:37:38,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:38,054 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:60, output treesize:44 [2019-11-15 23:37:38,198 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,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, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 63 [2019-11-15 23:37:38,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,231 INFO L567 ElimStorePlain]: treesize reduction 28, result has 73.8 percent of original size [2019-11-15 23:37:38,278 INFO L341 Elim1Store]: treesize reduction 52, result has 50.5 percent of original size [2019-11-15 23:37:38,279 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 83 [2019-11-15 23:37:38,279 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,312 INFO L567 ElimStorePlain]: treesize reduction 24, result has 70.0 percent of original size [2019-11-15 23:37:38,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,313 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 23:37:38,313 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:22 [2019-11-15 23:37:38,345 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 47 treesize of output 41 [2019-11-15 23:37:38,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,366 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,367 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 69 [2019-11-15 23:37:38,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,368 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,381 INFO L567 ElimStorePlain]: treesize reduction 24, result has 63.6 percent of original size [2019-11-15 23:37:38,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2019-11-15 23:37:38,522 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,523 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 69 treesize of output 52 [2019-11-15 23:37:38,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:38,524 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:38,541 INFO L567 ElimStorePlain]: treesize reduction 16, result has 65.2 percent of original size [2019-11-15 23:37:38,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2019-11-15 23:37:38,543 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:38,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:38,547 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 23:37:38,547 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:69, output treesize:7 [2019-11-15 23:37:38,552 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:38,552 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:38,552 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 30 [2019-11-15 23:37:38,553 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600911521] [2019-11-15 23:37:38,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-11-15 23:37:38,553 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:38,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-11-15 23:37:38,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:37:38,554 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand 30 states. [2019-11-15 23:37:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:40,083 INFO L93 Difference]: Finished difference Result 237 states and 268 transitions. [2019-11-15 23:37:40,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-15 23:37:40,083 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 35 [2019-11-15 23:37:40,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:40,084 INFO L225 Difference]: With dead ends: 237 [2019-11-15 23:37:40,084 INFO L226 Difference]: Without dead ends: 237 [2019-11-15 23:37:40,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=1702, Unknown=0, NotChecked=0, Total=1980 [2019-11-15 23:37:40,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-11-15 23:37:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 202. [2019-11-15 23:37:40,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-15 23:37:40,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2019-11-15 23:37:40,088 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 35 [2019-11-15 23:37:40,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:40,089 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2019-11-15 23:37:40,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-11-15 23:37:40,089 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2019-11-15 23:37:40,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:37:40,090 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:40,090 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] [2019-11-15 23:37:40,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:40,294 INFO L410 AbstractCegarLoop]: === Iteration 31 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:40,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:40,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1121056597, now seen corresponding path program 1 times [2019-11-15 23:37:40,294 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:40,294 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692598206] [2019-11-15 23:37:40,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:40,294 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:40,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:40,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:40,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692598206] [2019-11-15 23:37:40,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664600877] [2019-11-15 23:37:40,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:40,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-11-15 23:37:40,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:40,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,720 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 23:37:40,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,728 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,729 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-15 23:37:40,756 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 23:37:40,756 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,764 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,767 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 23:37:40,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,774 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,774 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 23:37:40,775 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:22 [2019-11-15 23:37:40,874 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-11-15 23:37:40,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 25 [2019-11-15 23:37:40,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,894 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-11-15 23:37:40,896 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 34 treesize of output 14 [2019-11-15 23:37:40,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,910 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,910 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:22 [2019-11-15 23:37:40,948 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,948 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 55 treesize of output 73 [2019-11-15 23:37:40,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:40,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:40,949 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:40,973 INFO L567 ElimStorePlain]: treesize reduction 110, result has 33.3 percent of original size [2019-11-15 23:37:40,983 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 54 treesize of output 44 [2019-11-15 23:37:40,983 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:40,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:40,993 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:46 [2019-11-15 23:37:41,220 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:41,220 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 69 treesize of output 52 [2019-11-15 23:37:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:41,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:41,222 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:41,245 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-11-15 23:37:41,248 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2019-11-15 23:37:41,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:41,262 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:41,262 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 23:37:41,262 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:7 [2019-11-15 23:37:41,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:41,269 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:41,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 28 [2019-11-15 23:37:41,269 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422711361] [2019-11-15 23:37:41,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-15 23:37:41,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-15 23:37:41,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:37:41,271 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand 28 states. [2019-11-15 23:37:43,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:43,246 INFO L93 Difference]: Finished difference Result 242 states and 269 transitions. [2019-11-15 23:37:43,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 23:37:43,246 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 36 [2019-11-15 23:37:43,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:43,247 INFO L225 Difference]: With dead ends: 242 [2019-11-15 23:37:43,247 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 23:37:43,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=284, Invalid=2266, Unknown=0, NotChecked=0, Total=2550 [2019-11-15 23:37:43,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 23:37:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 202. [2019-11-15 23:37:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-11-15 23:37:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 232 transitions. [2019-11-15 23:37:43,252 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 232 transitions. Word has length 36 [2019-11-15 23:37:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:43,252 INFO L462 AbstractCegarLoop]: Abstraction has 202 states and 232 transitions. [2019-11-15 23:37:43,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-15 23:37:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 232 transitions. [2019-11-15 23:37:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:37:43,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:43,252 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] [2019-11-15 23:37:43,455 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:43,455 INFO L410 AbstractCegarLoop]: === Iteration 32 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:43,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:43,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1230160945, now seen corresponding path program 1 times [2019-11-15 23:37:43,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:43,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769168836] [2019-11-15 23:37:43,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:43,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:43,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:43,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769168836] [2019-11-15 23:37:43,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620491963] [2019-11-15 23:37:43,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:43,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-15 23:37:43,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:43,945 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:43,946 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 23:37:43,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:43,968 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-15 23:37:43,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:43,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-15 23:37:44,003 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 23:37:44,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:44,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:44,018 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 23:37:44,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:44,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:44,030 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 23:37:44,031 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:46, output treesize:39 [2019-11-15 23:37:44,153 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2019-11-15 23:37:44,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:44,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:44,194 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:44,194 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 52 treesize of output 66 [2019-11-15 23:37:44,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:44,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,196 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:44,277 INFO L567 ElimStorePlain]: treesize reduction 180, result has 26.8 percent of original size [2019-11-15 23:37:44,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:44,278 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:81, output treesize:65 [2019-11-15 23:37:44,556 INFO L341 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2019-11-15 23:37:44,556 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 47 treesize of output 56 [2019-11-15 23:37:44,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:44,627 INFO L567 ElimStorePlain]: treesize reduction 10, result has 90.7 percent of original size [2019-11-15 23:37:44,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:44,684 INFO L341 Elim1Store]: treesize reduction 28, result has 56.3 percent of original size [2019-11-15 23:37:44,685 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 2 case distinctions, treesize of input 79 treesize of output 79 [2019-11-15 23:37:44,686 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:44,754 INFO L567 ElimStorePlain]: treesize reduction 22, result has 81.0 percent of original size [2019-11-15 23:37:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:44,756 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:94 [2019-11-15 23:37:44,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,862 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:44,862 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 71 treesize of output 69 [2019-11-15 23:37:44,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:44,913 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:44,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 134 [2019-11-15 23:37:44,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:44,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:44,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:44,922 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:45,065 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2019-11-15 23:37:45,065 INFO L567 ElimStorePlain]: treesize reduction 112, result has 55.0 percent of original size [2019-11-15 23:37:45,093 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:45,093 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 1 case distinctions, treesize of input 64 treesize of output 82 [2019-11-15 23:37:45,094 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:45,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:45,131 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 72 treesize of output 120 [2019-11-15 23:37:45,131 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:45,239 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-11-15 23:37:45,240 INFO L567 ElimStorePlain]: treesize reduction 70, result has 63.9 percent of original size [2019-11-15 23:37:45,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:45,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 23:37:45,241 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:153, output treesize:124 [2019-11-15 23:37:45,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:45,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:45,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:45,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:45,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:45,848 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-15 23:37:45,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:45,861 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2019-11-15 23:37:45,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:45,874 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 23:37:45,875 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2019-11-15 23:37:45,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:45,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:45,906 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 2 case distinctions, treesize of input 87 treesize of output 91 [2019-11-15 23:37:45,906 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:46,040 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-11-15 23:37:46,040 INFO L567 ElimStorePlain]: treesize reduction 18, result has 89.2 percent of original size [2019-11-15 23:37:46,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 23:37:46,041 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:221, output treesize:148 [2019-11-15 23:37:46,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:46,310 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 5=[v_prenex_4]} [2019-11-15 23:37:46,318 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:46,318 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 23:37:46,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:46,376 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.1 percent of original size [2019-11-15 23:37:46,397 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:46,398 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 67 [2019-11-15 23:37:46,398 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:46,443 INFO L567 ElimStorePlain]: treesize reduction 18, result has 76.0 percent of original size [2019-11-15 23:37:46,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:46,444 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-15 23:37:46,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:100, output treesize:57 [2019-11-15 23:37:46,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:46,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:46,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 69 [2019-11-15 23:37:46,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:46,561 INFO L567 ElimStorePlain]: treesize reduction 28, result has 53.3 percent of original size [2019-11-15 23:37:46,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:46,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:32 [2019-11-15 23:37:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:46,622 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:37:46,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 34 [2019-11-15 23:37:46,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003753313] [2019-11-15 23:37:46,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-15 23:37:46,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:37:46,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-15 23:37:46,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 23:37:46,624 INFO L87 Difference]: Start difference. First operand 202 states and 232 transitions. Second operand 35 states. [2019-11-15 23:37:48,246 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63 [2019-11-15 23:37:48,520 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-11-15 23:37:49,250 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 63 [2019-11-15 23:37:49,576 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2019-11-15 23:37:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:37:51,259 INFO L93 Difference]: Finished difference Result 338 states and 379 transitions. [2019-11-15 23:37:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-15 23:37:51,260 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 36 [2019-11-15 23:37:51,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:37:51,261 INFO L225 Difference]: With dead ends: 338 [2019-11-15 23:37:51,261 INFO L226 Difference]: Without dead ends: 338 [2019-11-15 23:37:51,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=643, Invalid=3647, Unknown=0, NotChecked=0, Total=4290 [2019-11-15 23:37:51,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-15 23:37:51,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 210. [2019-11-15 23:37:51,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-11-15 23:37:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 240 transitions. [2019-11-15 23:37:51,268 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 240 transitions. Word has length 36 [2019-11-15 23:37:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:37:51,268 INFO L462 AbstractCegarLoop]: Abstraction has 210 states and 240 transitions. [2019-11-15 23:37:51,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-15 23:37:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 240 transitions. [2019-11-15 23:37:51,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 23:37:51,269 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:51,269 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] [2019-11-15 23:37:51,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:51,470 INFO L410 AbstractCegarLoop]: === Iteration 33 === [mainErr43REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr47REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr39REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION]=== [2019-11-15 23:37:51,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:51,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1230160944, now seen corresponding path program 1 times [2019-11-15 23:37:51,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:37:51,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446860821] [2019-11-15 23:37:51,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:51,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:37:51,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:37:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:51,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:37:51,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446860821] [2019-11-15 23:37:51,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551985688] [2019-11-15 23:37:51,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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 23:37:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:37:51,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-15 23:37:51,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:37:51,913 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_71|], 3=[|v_#valid_89|]} [2019-11-15 23:37:51,919 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 23:37:51,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:51,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:51,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:51,952 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 23:37:51,952 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:51,977 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-11-15 23:37:51,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:37:51,978 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:32 [2019-11-15 23:37:52,011 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 23:37:52,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,029 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 23:37:52,029 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,042 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,042 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 23:37:52,043 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:48 [2019-11-15 23:37:52,150 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,150 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 69 treesize of output 75 [2019-11-15 23:37:52,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:52,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,152 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:37:52,257 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-11-15 23:37:52,257 INFO L567 ElimStorePlain]: treesize reduction 232, result has 26.3 percent of original size [2019-11-15 23:37:52,262 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 68 treesize of output 63 [2019-11-15 23:37:52,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:52,288 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:90, output treesize:74 [2019-11-15 23:37:52,556 INFO L341 Elim1Store]: treesize reduction 60, result has 43.9 percent of original size [2019-11-15 23:37:52,556 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 47 treesize of output 56 [2019-11-15 23:37:52,557 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,622 INFO L567 ElimStorePlain]: treesize reduction 10, result has 91.4 percent of original size [2019-11-15 23:37:52,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 23:37:52,652 INFO L341 Elim1Store]: treesize reduction 28, result has 56.3 percent of original size [2019-11-15 23:37:52,652 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 2 case distinctions, treesize of input 88 treesize of output 84 [2019-11-15 23:37:52,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,711 INFO L567 ElimStorePlain]: treesize reduction 22, result has 82.4 percent of original size [2019-11-15 23:37:52,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 23:37:52,713 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:113, output treesize:103 [2019-11-15 23:37:52,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,773 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 80 treesize of output 75 [2019-11-15 23:37:52,774 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,824 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 90 treesize of output 150 [2019-11-15 23:37:52,825 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,925 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-11-15 23:37:52,925 INFO L567 ElimStorePlain]: treesize reduction 58, result has 73.3 percent of original size [2019-11-15 23:37:52,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,940 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 72 treesize of output 70 [2019-11-15 23:37:52,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,941 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:52,982 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:52,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 86 treesize of output 135 [2019-11-15 23:37:52,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:52,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:52,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:52,986 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 23:37:53,098 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2019-11-15 23:37:53,098 INFO L567 ElimStorePlain]: treesize reduction 113, result has 55.2 percent of original size [2019-11-15 23:37:53,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-15 23:37:53,100 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:171, output treesize:138 [2019-11-15 23:37:53,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:53,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:37:53,863 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 52 [2019-11-15 23:37:53,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:37:53,869 INFO L392 ElimStorePlain]: Different costs {1=[v_prenex_9, v_prenex_10], 5=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-11-15 23:37:53,893 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:53,894 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 75 treesize of output 58 [2019-11-15 23:37:53,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:53,995 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 65 [2019-11-15 23:37:53,995 INFO L567 ElimStorePlain]: treesize reduction 4, result has 97.4 percent of original size [2019-11-15 23:37:54,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 45 treesize of output 33 [2019-11-15 23:37:54,001 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:54,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:54,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:37:54,074 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 102 [2019-11-15 23:37:54,075 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 23:37:54,164 INFO L567 ElimStorePlain]: treesize reduction 18, result has 84.7 percent of original size [2019-11-15 23:37:54,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:37:54,366 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 23:37:54,370 INFO L168 Benchmark]: Toolchain (without parser) took 52711.07 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 495.5 MB). Free memory was 943.4 MB in the beginning and 900.9 MB in the end (delta: 42.5 MB). Peak memory consumption was 537.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:54,371 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:54,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 612.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:54,377 INFO L168 Benchmark]: Boogie Preprocessor took 58.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:54,377 INFO L168 Benchmark]: RCFGBuilder took 824.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 23:37:54,378 INFO L168 Benchmark]: TraceAbstraction took 51210.55 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 900.9 MB in the end (delta: 199.1 MB). Peak memory consumption was 506.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:54,380 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 612.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.2 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -227.3 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 58.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 824.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 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 51210.55 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 307.2 MB). Free memory was 1.1 GB in the beginning and 900.9 MB in the end (delta: 199.1 MB). Peak memory consumption was 506.3 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 23:37:56,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:37:56,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:37:56,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:37:56,493 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:37:56,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:37:56,496 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:37:56,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:37:56,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:37:56,504 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:37:56,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:37:56,506 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:37:56,506 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:37:56,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:37:56,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:37:56,509 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:37:56,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:37:56,510 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:37:56,512 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:37:56,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:37:56,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:37:56,516 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:37:56,517 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:37:56,518 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:37:56,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:37:56,521 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:37:56,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:37:56,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:37:56,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:37:56,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:37:56,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:37:56,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:37:56,526 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:37:56,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:37:56,528 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:37:56,528 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:37:56,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:37:56,529 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:37:56,529 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:37:56,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:37:56,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:37:56,531 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2019-11-15 23:37:56,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:37:56,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:37:56,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:37:56,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:37:56,546 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:37:56,547 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:37:56,547 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:37:56,547 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:37:56,547 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:37:56,548 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:37:56,548 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:37:56,548 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:37:56,548 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:37:56,548 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:37:56,549 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:37:56,549 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:37:56,549 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:37:56,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:37:56,550 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:37:56,550 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:37:56,550 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:37:56,550 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:37:56,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:37:56,551 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:37:56,551 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:37:56,551 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:37:56,551 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:37:56,552 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:37:56,552 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_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/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-memcleanup) ) 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 -> f369e67185304fce6130a1dfc66e8cb89abf0605 [2019-11-15 23:37:56,586 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:37:56,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:37:56,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:37:56,601 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:37:56,601 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:37:56,602 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-15 23:37:56,657 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/81dd1c7f4/19e58378575042fcb44afcd7a97b3acc/FLAG229e8f2d5 [2019-11-15 23:37:57,089 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:37:57,089 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/sv-benchmarks/c/forester-heap/dll-simple-white-blue-1.i [2019-11-15 23:37:57,101 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/81dd1c7f4/19e58378575042fcb44afcd7a97b3acc/FLAG229e8f2d5 [2019-11-15 23:37:57,500 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/data/81dd1c7f4/19e58378575042fcb44afcd7a97b3acc [2019-11-15 23:37:57,502 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:37:57,503 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:37:57,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:57,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:37:57,507 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:37:57,508 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:57" (1/1) ... [2019-11-15 23:37:57,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4905a49c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:57, skipping insertion in model container [2019-11-15 23:37:57,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:37:57" (1/1) ... [2019-11-15 23:37:57,517 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:37:57,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:37:58,004 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:58,016 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:37:58,077 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:37:58,124 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:37:58,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58 WrapperNode [2019-11-15 23:37:58,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:37:58,126 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:37:58,126 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:37:58,126 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:37:58,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,163 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,164 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,199 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... [2019-11-15 23:37:58,209 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:37:58,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:37:58,210 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:37:58,210 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:37:58,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:37:58,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:37:58,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:37:58,280 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:37:58,280 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:37:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:37:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:37:58,281 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:37:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:37:58,282 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:37:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:37:58,283 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:37:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:37:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:37:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:37:58,284 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:37:58,285 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:37:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:37:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:37:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:37:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:37:58,287 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:37:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:37:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:37:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:37:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:37:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:37:58,288 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:37:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:37:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:37:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:37:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:37:58,289 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:37:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:37:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:37:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:37:58,290 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:37:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:37:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:37:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:37:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:37:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:37:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:37:58,292 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:37:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:37:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:37:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:37:58,293 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:37:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:37:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:37:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:37:58,294 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:37:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:37:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:37:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:37:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:37:58,295 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:37:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:37:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:37:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:37:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:37:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:37:58,296 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:37:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:37:58,297 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:37:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:37:58,298 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:37:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:37:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:37:58,299 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:37:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:37:58,300 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:37:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:37:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:37:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:37:58,301 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:37:58,302 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:37:58,302 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:37:58,302 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:37:58,302 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:37:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:37:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:37:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:37:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:37:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:37:58,303 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:37:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:37:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:37:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:37:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:37:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:37:58,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:37:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:37:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:37:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:37:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:37:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:37:58,305 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:37:58,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:37:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:37:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:37:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:37:58,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:37:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:37:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:37:58,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:37:59,343 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:37:59,343 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:37:59,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:59 BoogieIcfgContainer [2019-11-15 23:37:59,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:37:59,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:37:59,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:37:59,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:37:59,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:37:57" (1/3) ... [2019-11-15 23:37:59,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28282c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:37:59, skipping insertion in model container [2019-11-15 23:37:59,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:37:58" (2/3) ... [2019-11-15 23:37:59,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28282c88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:37:59, skipping insertion in model container [2019-11-15 23:37:59,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:37:59" (3/3) ... [2019-11-15 23:37:59,352 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-simple-white-blue-1.i [2019-11-15 23:37:59,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:37:59,368 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 60 error locations. [2019-11-15 23:37:59,382 INFO L249 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2019-11-15 23:37:59,408 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:37:59,408 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:37:59,409 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:37:59,409 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:37:59,410 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:37:59,410 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:37:59,410 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:37:59,410 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:37:59,432 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-15 23:37:59,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:37:59,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:37:59,452 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:37:59,455 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION, mainErr56ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr44REQUIRES_VIOLATION, mainErr46REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr48REQUIRES_VIOLATION, mainErr50REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr52REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr53REQUIRES_VIOLATION, mainErr55REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr59ENSURES_VIOLATIONMEMORY_LEAK, mainErr13REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr58ASSERT_VIOLATIONMEMORY_FREE, mainErr17REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr42REQUIRES_VIOLATION, mainErr43REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr45REQUIRES_VIOLATION, mainErr47REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr49REQUIRES_VIOLATION, mainErr51REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr54REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr57ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION]=== [2019-11-15 23:37:59,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:37:59,460 INFO L82 PathProgramCache]: Analyzing trace with hash 34969974, now seen corresponding path program 1 times [2019-11-15 23:37:59,469 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:37:59,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1667006178] [2019-11-15 23:37:59,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a16c2a9-b85c-4277-bd9e-368ffcde7fe5/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:37:59,706 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:37:59,706 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 23:37:59,710 INFO L168 Benchmark]: Toolchain (without parser) took 2206.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 943.0 MB in the beginning and 1.1 GB in the end (delta: -150.5 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:59,711 INFO L168 Benchmark]: CDTParser took 0.25 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 23:37:59,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 621.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -232.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:59,712 INFO L168 Benchmark]: Boogie Preprocessor took 83.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:37:59,712 INFO L168 Benchmark]: RCFGBuilder took 1134.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:59,713 INFO L168 Benchmark]: TraceAbstraction took 362.86 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: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:37:59,716 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.25 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 621.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 943.0 MB in the beginning and 1.2 GB in the end (delta: -232.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.58 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1134.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 65.1 MB). Peak memory consumption was 65.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 362.86 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: 17.3 MB). Peak memory consumption was 17.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...