./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 647186f77af479db589ba9ca6b990f259feeb9ca ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-circular-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 647186f77af479db589ba9ca6b990f259feeb9ca ..................................................................................................................................................................................................................................................................................................................................................... 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:44:13,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:44:13,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:44:13,798 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:44:13,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:44:13,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:44:13,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:44:13,810 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:44:13,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:44:13,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:44:13,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:44:13,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:44:13,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:44:13,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:44:13,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:44:13,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:44:13,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:44:13,827 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:44:13,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:44:13,833 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:44:13,836 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:44:13,837 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:44:13,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:44:13,841 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:44:13,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:44:13,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:44:13,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:44:13,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:44:13,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:44:13,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:44:13,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:44:13,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:44:13,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:44:13,848 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:44:13,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:44:13,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:44:13,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:44:13,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:44:13,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:44:13,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:44:13,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:44:13,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 23:44:13,877 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:44:13,887 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:44:13,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:44:13,889 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:44:13,889 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:44:13,889 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:44:13,889 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:44:13,890 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:44:13,890 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:44:13,890 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:44:13,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:44:13,891 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:44:13,891 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:44:13,891 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:44:13,892 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:44:13,892 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:44:13,892 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:44:13,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:44:13,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:44:13,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:44:13,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:44:13,893 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:44:13,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:44:13,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:44:13,894 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:44:13,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:44:13,895 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_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647186f77af479db589ba9ca6b990f259feeb9ca [2019-11-15 23:44:13,929 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:44:13,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:44:13,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:44:13,948 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:44:13,948 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:44:13,949 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-11-15 23:44:14,005 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/dbab1d07d/67f0ef54c4cf464883ff5a70ee0a5259/FLAG4b22b1a42 [2019-11-15 23:44:14,480 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:44:14,482 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-11-15 23:44:14,499 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/dbab1d07d/67f0ef54c4cf464883ff5a70ee0a5259/FLAG4b22b1a42 [2019-11-15 23:44:14,809 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/dbab1d07d/67f0ef54c4cf464883ff5a70ee0a5259 [2019-11-15 23:44:14,812 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:44:14,813 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:44:14,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:14,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:44:14,818 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:44:14,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:14" (1/1) ... [2019-11-15 23:44:14,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db29549 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:14, skipping insertion in model container [2019-11-15 23:44:14,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:44:14" (1/1) ... [2019-11-15 23:44:14,828 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:44:14,858 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:44:15,255 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:15,264 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:44:15,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:44:15,349 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:44:15,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15 WrapperNode [2019-11-15 23:44:15,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:44:15,350 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:44:15,350 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:44:15,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:44:15,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,400 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... [2019-11-15 23:44:15,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:44:15,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:44:15,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:44:15,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:44:15,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:44:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:44:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:44:15,485 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:44:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:44:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:44:15,486 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:44:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:44:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:44:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:44:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:44:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:44:15,488 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:44:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:44:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:44:15,489 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:44:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:44:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:44:15,490 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:44:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:44:15,493 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:44:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:44:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:44:15,494 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:44:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:44:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:44:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:44:15,495 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:44:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:44:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:44:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:44:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:44:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:44:15,497 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:44:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:44:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:44:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:44:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:44:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:44:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:44:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:44:15,500 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:44:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:44:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:44:15,501 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:44:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:44:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:44:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:44:15,502 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:44:15,503 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:44:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:44:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:44:15,504 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:44:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:44:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:44:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:44:15,505 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:44:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:44:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:44:15,506 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:44:15,507 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:44:15,507 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:44:15,508 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:44:15,508 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:44:15,508 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:44:15,508 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:44:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:44:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:44:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:44:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:44:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:44:15,509 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:44:15,510 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:44:15,511 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:44:15,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:44:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:44:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:44:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:44:15,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:44:16,272 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:44:16,273 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:44:16,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:16 BoogieIcfgContainer [2019-11-15 23:44:16,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:44:16,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:44:16,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:44:16,278 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:44:16,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:44:14" (1/3) ... [2019-11-15 23:44:16,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b6f82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:16, skipping insertion in model container [2019-11-15 23:44:16,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:44:15" (2/3) ... [2019-11-15 23:44:16,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b6f82a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:44:16, skipping insertion in model container [2019-11-15 23:44:16,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:44:16" (3/3) ... [2019-11-15 23:44:16,281 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-11-15 23:44:16,291 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:44:16,301 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-15 23:44:16,311 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-15 23:44:16,332 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:44:16,334 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:44:16,335 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:44:16,335 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:44:16,335 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:44:16,335 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:44:16,336 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:44:16,336 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:44:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-15 23:44:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:44:16,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:16,369 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:16,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:16,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1137974197, now seen corresponding path program 1 times [2019-11-15 23:44:16,392 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:16,392 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348796380] [2019-11-15 23:44:16,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:16,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:16,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:16,565 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:44:16,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348796380] [2019-11-15 23:44:16,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:16,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:16,567 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865224778] [2019-11-15 23:44:16,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:16,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:16,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:16,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:16,583 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-11-15 23:44:16,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:16,907 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-11-15 23:44:16,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:16,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:44:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:16,919 INFO L225 Difference]: With dead ends: 115 [2019-11-15 23:44:16,920 INFO L226 Difference]: Without dead ends: 112 [2019-11-15 23:44:16,922 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:44:16,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-15 23:44:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2019-11-15 23:44:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-15 23:44:16,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2019-11-15 23:44:16,986 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2019-11-15 23:44:16,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:16,987 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2019-11-15 23:44:16,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:16,987 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2019-11-15 23:44:16,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:44:16,988 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:16,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:16,988 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:16,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1137974196, now seen corresponding path program 1 times [2019-11-15 23:44:16,989 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:16,989 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157416689] [2019-11-15 23:44:16,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:16,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:16,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:17,090 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:44:17,090 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157416689] [2019-11-15 23:44:17,091 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:17,091 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:44:17,091 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995368150] [2019-11-15 23:44:17,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:17,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:17,096 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 4 states. [2019-11-15 23:44:17,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:17,336 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2019-11-15 23:44:17,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:17,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-11-15 23:44:17,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:17,340 INFO L225 Difference]: With dead ends: 109 [2019-11-15 23:44:17,340 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 23:44:17,340 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:44:17,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 23:44:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 97. [2019-11-15 23:44:17,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 23:44:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2019-11-15 23:44:17,356 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 7 [2019-11-15 23:44:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:17,356 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2019-11-15 23:44:17,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2019-11-15 23:44:17,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:44:17,357 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:17,357 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:17,358 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:17,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:17,358 INFO L82 PathProgramCache]: Analyzing trace with hash 301966095, now seen corresponding path program 1 times [2019-11-15 23:44:17,358 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:17,358 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064806948] [2019-11-15 23:44:17,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:17,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:17,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:17,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:17,474 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:44:17,474 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064806948] [2019-11-15 23:44:17,474 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:17,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:17,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788963983] [2019-11-15 23:44:17,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:17,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:17,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:17,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:17,476 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand 5 states. [2019-11-15 23:44:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:17,734 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2019-11-15 23:44:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:44:17,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 23:44:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:17,736 INFO L225 Difference]: With dead ends: 94 [2019-11-15 23:44:17,736 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 23:44:17,736 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:44:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 23:44:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2019-11-15 23:44:17,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-15 23:44:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2019-11-15 23:44:17,744 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 13 [2019-11-15 23:44:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:17,745 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2019-11-15 23:44:17,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2019-11-15 23:44:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 23:44:17,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:17,746 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:17,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash 301966096, now seen corresponding path program 1 times [2019-11-15 23:44:17,748 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:17,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864730922] [2019-11-15 23:44:17,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:17,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:17,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:17,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:17,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:17,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864730922] [2019-11-15 23:44:17,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:17,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:17,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278691827] [2019-11-15 23:44:17,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:44:17,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:17,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:44:17,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:44:17,862 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand 5 states. [2019-11-15 23:44:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:18,143 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-11-15 23:44:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:44:18,143 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-11-15 23:44:18,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:18,145 INFO L225 Difference]: With dead ends: 109 [2019-11-15 23:44:18,145 INFO L226 Difference]: Without dead ends: 109 [2019-11-15 23:44:18,145 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-15 23:44:18,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 93. [2019-11-15 23:44:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:44:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-11-15 23:44:18,156 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 13 [2019-11-15 23:44:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:18,157 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-11-15 23:44:18,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:44:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-11-15 23:44:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:44:18,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:18,158 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:18,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:18,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1868354153, now seen corresponding path program 1 times [2019-11-15 23:44:18,158 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:18,158 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885483268] [2019-11-15 23:44:18,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:18,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:18,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:18,233 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:44:18,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885483268] [2019-11-15 23:44:18,233 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:18,233 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:18,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464724288] [2019-11-15 23:44:18,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:18,234 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:18,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:18,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:18,235 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 6 states. [2019-11-15 23:44:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:18,628 INFO L93 Difference]: Finished difference Result 139 states and 150 transitions. [2019-11-15 23:44:18,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:44:18,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:44:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:18,630 INFO L225 Difference]: With dead ends: 139 [2019-11-15 23:44:18,630 INFO L226 Difference]: Without dead ends: 139 [2019-11-15 23:44:18,631 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:44:18,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-15 23:44:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 92. [2019-11-15 23:44:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 23:44:18,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2019-11-15 23:44:18,643 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 15 [2019-11-15 23:44:18,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:18,643 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2019-11-15 23:44:18,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:18,644 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2019-11-15 23:44:18,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 23:44:18,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:18,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:18,646 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:18,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:18,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1868354152, now seen corresponding path program 1 times [2019-11-15 23:44:18,647 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:18,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346483826] [2019-11-15 23:44:18,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:18,647 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:18,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:18,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:18,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:18,761 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:44:18,761 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346483826] [2019-11-15 23:44:18,761 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:18,761 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:18,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375408686] [2019-11-15 23:44:18,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:18,762 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:18,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:18,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:18,762 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand 6 states. [2019-11-15 23:44:19,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:19,146 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2019-11-15 23:44:19,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:19,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-15 23:44:19,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:19,147 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:44:19,147 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:44:19,147 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:44:19,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:44:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 91. [2019-11-15 23:44:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-11-15 23:44:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2019-11-15 23:44:19,155 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 15 [2019-11-15 23:44:19,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:19,155 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2019-11-15 23:44:19,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:19,155 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2019-11-15 23:44:19,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:44:19,156 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:19,156 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:19,156 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:19,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:19,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1746126442, now seen corresponding path program 1 times [2019-11-15 23:44:19,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:19,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248616274] [2019-11-15 23:44:19,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:19,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:19,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:19,334 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:44:19,334 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248616274] [2019-11-15 23:44:19,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:19,334 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:44:19,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500663787] [2019-11-15 23:44:19,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:19,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:19,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:19,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:19,336 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand 9 states. [2019-11-15 23:44:19,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:19,773 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-11-15 23:44:19,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:44:19,774 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-15 23:44:19,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:19,775 INFO L225 Difference]: With dead ends: 134 [2019-11-15 23:44:19,775 INFO L226 Difference]: Without dead ends: 134 [2019-11-15 23:44:19,776 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:44:19,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-15 23:44:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2019-11-15 23:44:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:44:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2019-11-15 23:44:19,781 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 18 [2019-11-15 23:44:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:19,782 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2019-11-15 23:44:19,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2019-11-15 23:44:19,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:44:19,782 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:19,782 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:19,783 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:19,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:19,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1746126441, now seen corresponding path program 1 times [2019-11-15 23:44:19,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:19,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652572124] [2019-11-15 23:44:19,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:19,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:19,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:19,960 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:44:19,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652572124] [2019-11-15 23:44:19,961 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:19,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:44:19,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681797622] [2019-11-15 23:44:19,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:19,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:19,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:19,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:19,962 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand 9 states. [2019-11-15 23:44:20,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:20,425 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2019-11-15 23:44:20,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:44:20,425 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-15 23:44:20,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:20,426 INFO L225 Difference]: With dead ends: 164 [2019-11-15 23:44:20,427 INFO L226 Difference]: Without dead ends: 164 [2019-11-15 23:44:20,427 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:44:20,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-15 23:44:20,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 108. [2019-11-15 23:44:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-15 23:44:20,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-11-15 23:44:20,432 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 18 [2019-11-15 23:44:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:20,433 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-11-15 23:44:20,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:20,433 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-11-15 23:44:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:44:20,434 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:20,434 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:44:20,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:20,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:20,434 INFO L82 PathProgramCache]: Analyzing trace with hash 160792281, now seen corresponding path program 1 times [2019-11-15 23:44:20,434 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:20,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427953347] [2019-11-15 23:44:20,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:20,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:20,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:20,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:20,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:20,545 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:44:20,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427953347] [2019-11-15 23:44:20,546 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:20,546 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:44:20,546 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300378013] [2019-11-15 23:44:20,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:44:20,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:20,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:44:20,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:20,547 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 10 states. [2019-11-15 23:44:21,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:21,094 INFO L93 Difference]: Finished difference Result 116 states and 130 transitions. [2019-11-15 23:44:21,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:44:21,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-15 23:44:21,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:21,095 INFO L225 Difference]: With dead ends: 116 [2019-11-15 23:44:21,095 INFO L226 Difference]: Without dead ends: 116 [2019-11-15 23:44:21,096 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:44:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-15 23:44:21,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2019-11-15 23:44:21,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-15 23:44:21,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-11-15 23:44:21,100 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 19 [2019-11-15 23:44:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:21,100 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-11-15 23:44:21,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:44:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-11-15 23:44:21,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-15 23:44:21,101 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:21,102 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:44:21,102 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:21,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:21,102 INFO L82 PathProgramCache]: Analyzing trace with hash 160792282, now seen corresponding path program 1 times [2019-11-15 23:44:21,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:21,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079955732] [2019-11-15 23:44:21,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:21,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:21,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:21,276 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:44:21,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079955732] [2019-11-15 23:44:21,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:21,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:44:21,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490066230] [2019-11-15 23:44:21,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:44:21,277 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:21,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:44:21,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:44:21,278 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 11 states. [2019-11-15 23:44:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:22,040 INFO L93 Difference]: Finished difference Result 111 states and 125 transitions. [2019-11-15 23:44:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 23:44:22,041 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-15 23:44:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:22,042 INFO L225 Difference]: With dead ends: 111 [2019-11-15 23:44:22,042 INFO L226 Difference]: Without dead ends: 111 [2019-11-15 23:44:22,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:44:22,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-15 23:44:22,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 96. [2019-11-15 23:44:22,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:44:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 109 transitions. [2019-11-15 23:44:22,047 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 109 transitions. Word has length 19 [2019-11-15 23:44:22,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:22,047 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 109 transitions. [2019-11-15 23:44:22,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:44:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 109 transitions. [2019-11-15 23:44:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:44:22,048 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:22,048 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] [2019-11-15 23:44:22,048 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:22,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:22,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1791138080, now seen corresponding path program 1 times [2019-11-15 23:44:22,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:22,049 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980750664] [2019-11-15 23:44:22,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:22,049 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:22,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:22,211 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:44:22,211 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980750664] [2019-11-15 23:44:22,211 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:22,211 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:44:22,212 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421404207] [2019-11-15 23:44:22,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:44:22,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:22,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:44:22,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:22,213 INFO L87 Difference]: Start difference. First operand 96 states and 109 transitions. Second operand 10 states. [2019-11-15 23:44:22,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:22,661 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2019-11-15 23:44:22,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:44:22,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 23:44:22,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:22,662 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:44:22,662 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:44:22,663 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:44:22,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:44:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2019-11-15 23:44:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:44:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-11-15 23:44:22,666 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 21 [2019-11-15 23:44:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:22,666 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-11-15 23:44:22,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:44:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-11-15 23:44:22,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:44:22,667 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:22,667 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] [2019-11-15 23:44:22,668 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:22,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:22,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1791138081, now seen corresponding path program 1 times [2019-11-15 23:44:22,668 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:22,668 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905423464] [2019-11-15 23:44:22,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:22,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:22,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:22,842 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:44:22,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905423464] [2019-11-15 23:44:22,843 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:22,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:44:22,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953908586] [2019-11-15 23:44:22,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:22,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:22,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:22,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:22,844 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 9 states. [2019-11-15 23:44:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:23,284 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2019-11-15 23:44:23,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:23,285 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2019-11-15 23:44:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:23,286 INFO L225 Difference]: With dead ends: 150 [2019-11-15 23:44:23,286 INFO L226 Difference]: Without dead ends: 150 [2019-11-15 23:44:23,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:44:23,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-15 23:44:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 96. [2019-11-15 23:44:23,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-15 23:44:23,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2019-11-15 23:44:23,290 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 21 [2019-11-15 23:44:23,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:23,290 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2019-11-15 23:44:23,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2019-11-15 23:44:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:44:23,291 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:23,291 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:44:23,292 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash -309311156, now seen corresponding path program 1 times [2019-11-15 23:44:23,292 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:23,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88194198] [2019-11-15 23:44:23,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:23,292 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:23,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:23,357 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:44:23,357 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88194198] [2019-11-15 23:44:23,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:23,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:44:23,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583365399] [2019-11-15 23:44:23,358 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:44:23,358 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:44:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:44:23,359 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 8 states. [2019-11-15 23:44:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:23,747 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2019-11-15 23:44:23,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:44:23,747 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-15 23:44:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:23,748 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:44:23,749 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 23:44:23,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:44:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 23:44:23,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 97. [2019-11-15 23:44:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-15 23:44:23,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 109 transitions. [2019-11-15 23:44:23,752 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 109 transitions. Word has length 22 [2019-11-15 23:44:23,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:23,752 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 109 transitions. [2019-11-15 23:44:23,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:44:23,753 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 109 transitions. [2019-11-15 23:44:23,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:44:23,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:23,754 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:44:23,754 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:23,757 INFO L82 PathProgramCache]: Analyzing trace with hash -309311155, now seen corresponding path program 1 times [2019-11-15 23:44:23,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:23,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111921813] [2019-11-15 23:44:23,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:23,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:23,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:24,027 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:44:24,027 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111921813] [2019-11-15 23:44:24,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:24,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-15 23:44:24,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165165766] [2019-11-15 23:44:24,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:44:24,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:24,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:44:24,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:44:24,029 INFO L87 Difference]: Start difference. First operand 97 states and 109 transitions. Second operand 12 states. [2019-11-15 23:44:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:24,553 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2019-11-15 23:44:24,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:44:24,556 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-15 23:44:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:24,557 INFO L225 Difference]: With dead ends: 140 [2019-11-15 23:44:24,557 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:44:24,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:44:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:44:24,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 116. [2019-11-15 23:44:24,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-15 23:44:24,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 141 transitions. [2019-11-15 23:44:24,579 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 141 transitions. Word has length 22 [2019-11-15 23:44:24,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:24,579 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 141 transitions. [2019-11-15 23:44:24,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:44:24,579 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2019-11-15 23:44:24,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:44:24,581 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:24,581 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:44:24,581 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:24,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:24,582 INFO L82 PathProgramCache]: Analyzing trace with hash -895272901, now seen corresponding path program 1 times [2019-11-15 23:44:24,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:24,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871856015] [2019-11-15 23:44:24,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:24,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:24,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:24,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:24,835 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:44:24,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871856015] [2019-11-15 23:44:24,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:24,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 23:44:24,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626826207] [2019-11-15 23:44:24,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 23:44:24,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 23:44:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:44:24,836 INFO L87 Difference]: Start difference. First operand 116 states and 141 transitions. Second operand 13 states. [2019-11-15 23:44:25,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:25,334 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2019-11-15 23:44:25,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:44:25,335 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-11-15 23:44:25,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:25,336 INFO L225 Difference]: With dead ends: 153 [2019-11-15 23:44:25,336 INFO L226 Difference]: Without dead ends: 153 [2019-11-15 23:44:25,336 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=301, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:44:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-15 23:44:25,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 117. [2019-11-15 23:44:25,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:44:25,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2019-11-15 23:44:25,340 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 24 [2019-11-15 23:44:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:25,340 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2019-11-15 23:44:25,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 23:44:25,341 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2019-11-15 23:44:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:44:25,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:25,342 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:44:25,342 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1983655933, now seen corresponding path program 1 times [2019-11-15 23:44:25,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:25,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172226764] [2019-11-15 23:44:25,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:25,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:25,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:25,502 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:44:25,503 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172226764] [2019-11-15 23:44:25,503 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:25,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:44:25,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570383857] [2019-11-15 23:44:25,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:25,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:25,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:25,504 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand 9 states. [2019-11-15 23:44:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:25,807 INFO L93 Difference]: Finished difference Result 147 states and 160 transitions. [2019-11-15 23:44:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:25,808 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 23:44:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:25,809 INFO L225 Difference]: With dead ends: 147 [2019-11-15 23:44:25,809 INFO L226 Difference]: Without dead ends: 147 [2019-11-15 23:44:25,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:44:25,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-15 23:44:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 118. [2019-11-15 23:44:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-11-15 23:44:25,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2019-11-15 23:44:25,813 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 25 [2019-11-15 23:44:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:25,813 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2019-11-15 23:44:25,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:25,813 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2019-11-15 23:44:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:44:25,814 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:25,814 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] [2019-11-15 23:44:25,814 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:25,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1339863425, now seen corresponding path program 1 times [2019-11-15 23:44:25,815 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:25,815 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434894418] [2019-11-15 23:44:25,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:25,815 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:25,815 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:25,864 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:44:25,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434894418] [2019-11-15 23:44:25,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:25,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:44:25,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678810904] [2019-11-15 23:44:25,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:25,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:25,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:25,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:44:25,866 INFO L87 Difference]: Start difference. First operand 118 states and 143 transitions. Second operand 6 states. [2019-11-15 23:44:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:26,094 INFO L93 Difference]: Finished difference Result 120 states and 143 transitions. [2019-11-15 23:44:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:26,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-11-15 23:44:26,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:26,095 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:44:26,095 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:44:26,096 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:44:26,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:44:26,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2019-11-15 23:44:26,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:44:26,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 140 transitions. [2019-11-15 23:44:26,099 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 140 transitions. Word has length 26 [2019-11-15 23:44:26,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:26,099 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 140 transitions. [2019-11-15 23:44:26,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:26,100 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 140 transitions. [2019-11-15 23:44:26,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:44:26,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:26,100 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] [2019-11-15 23:44:26,101 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:26,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:26,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1339863426, now seen corresponding path program 1 times [2019-11-15 23:44:26,101 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:26,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109186941] [2019-11-15 23:44:26,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:26,103 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:26,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:26,305 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:44:26,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109186941] [2019-11-15 23:44:26,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:26,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:44:26,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853374689] [2019-11-15 23:44:26,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:44:26,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:44:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:26,307 INFO L87 Difference]: Start difference. First operand 117 states and 140 transitions. Second operand 10 states. [2019-11-15 23:44:26,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:26,681 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2019-11-15 23:44:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:44:26,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-15 23:44:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:26,683 INFO L225 Difference]: With dead ends: 143 [2019-11-15 23:44:26,683 INFO L226 Difference]: Without dead ends: 143 [2019-11-15 23:44:26,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:44:26,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-15 23:44:26,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 117. [2019-11-15 23:44:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 23:44:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2019-11-15 23:44:26,687 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 26 [2019-11-15 23:44:26,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:26,687 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2019-11-15 23:44:26,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:44:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2019-11-15 23:44:26,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:44:26,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:26,688 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] [2019-11-15 23:44:26,689 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:26,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:26,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1363745843, now seen corresponding path program 1 times [2019-11-15 23:44:26,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:26,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174915235] [2019-11-15 23:44:26,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:26,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:26,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:26,807 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:44:26,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174915235] [2019-11-15 23:44:26,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:26,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:44:26,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878447890] [2019-11-15 23:44:26,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:26,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:44:26,809 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand 9 states. [2019-11-15 23:44:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:27,085 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2019-11-15 23:44:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:44:27,086 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-11-15 23:44:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:27,087 INFO L225 Difference]: With dead ends: 137 [2019-11-15 23:44:27,087 INFO L226 Difference]: Without dead ends: 137 [2019-11-15 23:44:27,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:44:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-15 23:44:27,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2019-11-15 23:44:27,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 23:44:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 141 transitions. [2019-11-15 23:44:27,091 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 141 transitions. Word has length 26 [2019-11-15 23:44:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:27,091 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 141 transitions. [2019-11-15 23:44:27,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 141 transitions. [2019-11-15 23:44:27,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:44:27,092 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:27,092 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] [2019-11-15 23:44:27,092 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:27,092 INFO L82 PathProgramCache]: Analyzing trace with hash 672134982, now seen corresponding path program 1 times [2019-11-15 23:44:27,093 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:27,093 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990577822] [2019-11-15 23:44:27,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:27,093 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:27,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:27,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:27,354 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:44:27,354 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990577822] [2019-11-15 23:44:27,354 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:27,354 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:44:27,355 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538834941] [2019-11-15 23:44:27,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:44:27,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:27,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:44:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:44:27,355 INFO L87 Difference]: Start difference. First operand 119 states and 141 transitions. Second operand 10 states. [2019-11-15 23:44:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:27,859 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-15 23:44:27,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:44:27,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2019-11-15 23:44:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:27,860 INFO L225 Difference]: With dead ends: 133 [2019-11-15 23:44:27,860 INFO L226 Difference]: Without dead ends: 133 [2019-11-15 23:44:27,861 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:44:27,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-15 23:44:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 119. [2019-11-15 23:44:27,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 23:44:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2019-11-15 23:44:27,864 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 27 [2019-11-15 23:44:27,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:27,864 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2019-11-15 23:44:27,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:44:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2019-11-15 23:44:27,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:44:27,866 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:27,866 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:44:27,866 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:27,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:27,868 INFO L82 PathProgramCache]: Analyzing trace with hash -924344926, now seen corresponding path program 1 times [2019-11-15 23:44:27,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:27,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866885922] [2019-11-15 23:44:27,868 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:27,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:27,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:28,011 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:44:28,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866885922] [2019-11-15 23:44:28,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725543422] [2019-11-15 23:44:28,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:44:28,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:28,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:44:28,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:44:28,204 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 17 treesize of output 9 [2019-11-15 23:44:28,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:28,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:28,211 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:44:28,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-15 23:44:28,213 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:44:28,213 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:44:28,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2019-11-15 23:44:28,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168433771] [2019-11-15 23:44:28,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:28,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:28,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:28,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:44:28,215 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand 6 states. [2019-11-15 23:44:28,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:28,467 INFO L93 Difference]: Finished difference Result 122 states and 142 transitions. [2019-11-15 23:44:28,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:28,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-15 23:44:28,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:28,468 INFO L225 Difference]: With dead ends: 122 [2019-11-15 23:44:28,469 INFO L226 Difference]: Without dead ends: 122 [2019-11-15 23:44:28,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:44:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-15 23:44:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2019-11-15 23:44:28,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-15 23:44:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2019-11-15 23:44:28,473 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 28 [2019-11-15 23:44:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:28,473 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2019-11-15 23:44:28,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2019-11-15 23:44:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:44:28,474 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:28,474 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:44:28,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:44:28,682 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:28,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:28,682 INFO L82 PathProgramCache]: Analyzing trace with hash -924344925, now seen corresponding path program 1 times [2019-11-15 23:44:28,682 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:28,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139716433] [2019-11-15 23:44:28,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:28,683 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:28,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:28,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:28,870 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:44:28,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139716433] [2019-11-15 23:44:28,870 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1961314903] [2019-11-15 23:44:28,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:44:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:28,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:44:29,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:44:29,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-11-15 23:44:29,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:29,059 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:29,061 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 28 treesize of output 16 [2019-11-15 23:44:29,062 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:29,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:29,070 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:44:29,071 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:13 [2019-11-15 23:44:29,108 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:44:29,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:44:29,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2019-11-15 23:44:29,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792050081] [2019-11-15 23:44:29,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:44:29,109 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:29,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:44:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:44:29,109 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand 6 states. [2019-11-15 23:44:29,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:29,307 INFO L93 Difference]: Finished difference Result 120 states and 138 transitions. [2019-11-15 23:44:29,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:44:29,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-11-15 23:44:29,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:29,309 INFO L225 Difference]: With dead ends: 120 [2019-11-15 23:44:29,310 INFO L226 Difference]: Without dead ends: 120 [2019-11-15 23:44:29,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:44:29,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-15 23:44:29,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2019-11-15 23:44:29,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-15 23:44:29,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 137 transitions. [2019-11-15 23:44:29,314 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 137 transitions. Word has length 28 [2019-11-15 23:44:29,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:29,314 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 137 transitions. [2019-11-15 23:44:29,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:44:29,314 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 137 transitions. [2019-11-15 23:44:29,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:44:29,314 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:29,315 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] [2019-11-15 23:44:29,521 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:44:29,521 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:29,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:29,521 INFO L82 PathProgramCache]: Analyzing trace with hash 308258484, now seen corresponding path program 1 times [2019-11-15 23:44:29,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:29,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235296108] [2019-11-15 23:44:29,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:29,522 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:29,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:29,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:29,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:29,557 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:44:29,558 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235296108] [2019-11-15 23:44:29,558 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:44:29,558 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:44:29,558 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135641246] [2019-11-15 23:44:29,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:44:29,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:44:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:29,559 INFO L87 Difference]: Start difference. First operand 119 states and 137 transitions. Second operand 4 states. [2019-11-15 23:44:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:29,662 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2019-11-15 23:44:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:44:29,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-15 23:44:29,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:29,664 INFO L225 Difference]: With dead ends: 184 [2019-11-15 23:44:29,664 INFO L226 Difference]: Without dead ends: 184 [2019-11-15 23:44:29,664 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:44:29,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-11-15 23:44:29,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 134. [2019-11-15 23:44:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 23:44:29,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2019-11-15 23:44:29,669 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 29 [2019-11-15 23:44:29,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:29,669 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2019-11-15 23:44:29,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:44:29,670 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2019-11-15 23:44:29,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 23:44:29,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:29,670 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:29,670 INFO L410 AbstractCegarLoop]: === Iteration 24 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:29,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:29,671 INFO L82 PathProgramCache]: Analyzing trace with hash 762759047, now seen corresponding path program 1 times [2019-11-15 23:44:29,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:29,671 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833357031] [2019-11-15 23:44:29,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:29,671 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:29,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:29,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:29,809 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:44:29,809 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833357031] [2019-11-15 23:44:29,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185659805] [2019-11-15 23:44:29,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:44:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:29,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 23:44:29,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:44:30,023 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 17 [2019-11-15 23:44:30,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:30,032 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:30,034 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 21 treesize of output 13 [2019-11-15 23:44:30,034 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:30,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:30,037 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:44:30,037 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:9 [2019-11-15 23:44:30,086 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 19 treesize of output 7 [2019-11-15 23:44:30,086 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:30,088 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:30,088 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:44:30,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-15 23:44:30,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:44:30,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:44:30,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 18 [2019-11-15 23:44:30,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547693780] [2019-11-15 23:44:30,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:44:30,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:30,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:44:30,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:44:30,111 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand 9 states. [2019-11-15 23:44:30,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:44:30,500 INFO L93 Difference]: Finished difference Result 154 states and 175 transitions. [2019-11-15 23:44:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:44:30,501 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-15 23:44:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:44:30,502 INFO L225 Difference]: With dead ends: 154 [2019-11-15 23:44:30,502 INFO L226 Difference]: Without dead ends: 154 [2019-11-15 23:44:30,502 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-15 23:44:30,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-15 23:44:30,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2019-11-15 23:44:30,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 23:44:30,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 171 transitions. [2019-11-15 23:44:30,506 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 171 transitions. Word has length 30 [2019-11-15 23:44:30,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:44:30,506 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 171 transitions. [2019-11-15 23:44:30,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:44:30,507 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 171 transitions. [2019-11-15 23:44:30,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:44:30,507 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:44:30,507 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:44:30,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:44:30,711 INFO L410 AbstractCegarLoop]: === Iteration 25 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:44:30,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:44:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash -2013346099, now seen corresponding path program 1 times [2019-11-15 23:44:30,711 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:44:30,711 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38865103] [2019-11-15 23:44:30,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:30,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:44:30,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:44:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:30,904 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:44:30,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38865103] [2019-11-15 23:44:30,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133364701] [2019-11-15 23:44:30,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:44:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:44:31,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-15 23:44:31,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:44:31,109 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:31,110 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:44:31,111 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:31,144 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-15 23:44:31,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 23:44:31,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-15 23:44:31,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:44:31,180 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:31,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:31,203 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:44:31,203 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:29 [2019-11-15 23:44:31,295 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:31,295 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:44:31,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:44:31,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:44:31,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:44:31,300 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:44:31,357 INFO L567 ElimStorePlain]: treesize reduction 136, result has 24.0 percent of original size [2019-11-15 23:44:31,358 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:44:31,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:50, output treesize:42 [2019-11-15 23:44:31,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:31,570 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 49 treesize of output 110 [2019-11-15 23:44:31,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:31,617 INFO L567 ElimStorePlain]: treesize reduction 60, result has 38.8 percent of original size [2019-11-15 23:44:31,617 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:44:31,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:38 [2019-11-15 23:44:33,678 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-15 23:44:33,712 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-11-15 23:44:33,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-11-15 23:44:33,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:33,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:33,734 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:44:33,734 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:29 [2019-11-15 23:44:37,833 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2019-11-15 23:44:37,833 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 60 treesize of output 79 [2019-11-15 23:44:37,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 23:44:37,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:44:37,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:44:37,836 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-15 23:44:37,856 INFO L567 ElimStorePlain]: treesize reduction 82, result has 29.9 percent of original size [2019-11-15 23:44:37,857 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:44:37,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:65, output treesize:34 [2019-11-15 23:44:37,899 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 23:44:37,899 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:44:37,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 23:44:37,909 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-11-15 23:44:37,910 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:44:37,910 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:41, output treesize:15 [2019-11-15 23:44:37,960 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:44:37,961 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:44:37,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-11-15 23:44:37,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791758214] [2019-11-15 23:44:37,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-15 23:44:37,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:44:37,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-15 23:44:37,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=443, Unknown=2, NotChecked=0, Total=552 [2019-11-15 23:44:37,963 INFO L87 Difference]: Start difference. First operand 149 states and 171 transitions. Second operand 24 states. [2019-11-15 23:45:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:45:09,683 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions. [2019-11-15 23:45:09,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 23:45:09,684 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-11-15 23:45:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:45:09,686 INFO L225 Difference]: With dead ends: 255 [2019-11-15 23:45:09,686 INFO L226 Difference]: Without dead ends: 255 [2019-11-15 23:45:09,686 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=365, Invalid=1191, Unknown=4, NotChecked=0, Total=1560 [2019-11-15 23:45:09,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-11-15 23:45:09,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 175. [2019-11-15 23:45:09,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-11-15 23:45:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 201 transitions. [2019-11-15 23:45:09,691 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 201 transitions. Word has length 32 [2019-11-15 23:45:09,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:45:09,692 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 201 transitions. [2019-11-15 23:45:09,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-15 23:45:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 201 transitions. [2019-11-15 23:45:09,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:45:09,692 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:09,692 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:09,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:45:09,896 INFO L410 AbstractCegarLoop]: === Iteration 26 === [mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr26REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr37REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr41REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION, mainErr20REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr21REQUIRES_VIOLATION]=== [2019-11-15 23:45:09,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:09,897 INFO L82 PathProgramCache]: Analyzing trace with hash -2013346098, now seen corresponding path program 1 times [2019-11-15 23:45:09,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:45:09,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681187170] [2019-11-15 23:45:09,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:45:09,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:45:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:45:09,941 ERROR L253 erpolLogProxyWrapper]: Interpolant 13 not inductive [2019-11-15 23:45:09,953 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:863) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:385) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:332) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:193) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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:45:09,958 INFO L168 Benchmark]: Toolchain (without parser) took 55145.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 374.3 MB). Free memory was 947.4 MB in the beginning and 1.0 GB in the end (delta: -63.2 MB). Peak memory consumption was 311.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:09,960 INFO L168 Benchmark]: CDTParser took 0.22 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:45:09,960 INFO L168 Benchmark]: CACSL2BoogieTranslator took 535.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:09,961 INFO L168 Benchmark]: Boogie Preprocessor took 62.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:09,961 INFO L168 Benchmark]: RCFGBuilder took 860.99 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: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:09,961 INFO L168 Benchmark]: TraceAbstraction took 53682.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.5 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:09,964 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.22 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 535.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 947.4 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 62.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 860.99 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: 61.2 MB). Peak memory consumption was 61.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53682.02 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 221.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.5 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:221) 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:45:12,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:45:12,084 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:45:12,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:45:12,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:45:12,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:45:12,097 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:45:12,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:45:12,100 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:45:12,101 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:45:12,102 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:45:12,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:45:12,104 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:45:12,105 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:45:12,105 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:45:12,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:45:12,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:45:12,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:45:12,110 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:45:12,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:45:12,114 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:45:12,115 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:45:12,116 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:45:12,117 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:45:12,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:45:12,120 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:45:12,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:45:12,121 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:45:12,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:45:12,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:45:12,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:45:12,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:45:12,123 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:45:12,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:45:12,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:45:12,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:45:12,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:45:12,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:45:12,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:45:12,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:45:12,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:45:12,128 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 23:45:12,141 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:45:12,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:45:12,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:45:12,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:45:12,143 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:45:12,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:45:12,144 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:45:12,144 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 23:45:12,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:45:12,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:45:12,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:45:12,145 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 23:45:12,145 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 23:45:12,145 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 23:45:12,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:45:12,146 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:45:12,146 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:45:12,146 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:45:12,146 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:45:12,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:45:12,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:45:12,147 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:45:12,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:45:12,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:45:12,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:45:12,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:45:12,148 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:45:12,149 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:45:12,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:45:12,149 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_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 647186f77af479db589ba9ca6b990f259feeb9ca [2019-11-15 23:45:12,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:45:12,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:45:12,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:45:12,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:45:12,192 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:45:12,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/../../sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-11-15 23:45:12,243 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/f4016b037/4b2d509bcebc4a1281d9d6d3c857fde1/FLAGd66e32fe4 [2019-11-15 23:45:12,659 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:45:12,659 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/sv-benchmarks/c/forester-heap/dll-circular-2.i [2019-11-15 23:45:12,669 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/f4016b037/4b2d509bcebc4a1281d9d6d3c857fde1/FLAGd66e32fe4 [2019-11-15 23:45:12,967 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/bin/uautomizer/data/f4016b037/4b2d509bcebc4a1281d9d6d3c857fde1 [2019-11-15 23:45:12,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:45:12,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 23:45:12,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:12,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:45:12,975 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:45:12,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:12" (1/1) ... [2019-11-15 23:45:12,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7115118e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:12, skipping insertion in model container [2019-11-15 23:45:12,979 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:45:12" (1/1) ... [2019-11-15 23:45:12,985 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:45:13,043 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:45:13,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:13,424 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:45:13,487 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:45:13,542 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:45:13,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13 WrapperNode [2019-11-15 23:45:13,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:45:13,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:45:13,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:45:13,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:45:13,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,573 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,573 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... [2019-11-15 23:45:13,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:45:13,608 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:45:13,608 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:45:13,608 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:45:13,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:45:13,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 23:45:13,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:45:13,659 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 23:45:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 23:45:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 23:45:13,659 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 23:45:13,660 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 23:45:13,660 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 23:45:13,660 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 23:45:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 23:45:13,661 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 23:45:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 23:45:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 23:45:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 23:45:13,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 23:45:13,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 23:45:13,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 23:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 23:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 23:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 23:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 23:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 23:45:13,664 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 23:45:13,665 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 23:45:13,665 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 23:45:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 23:45:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 23:45:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 23:45:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 23:45:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 23:45:13,666 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 23:45:13,667 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 23:45:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 23:45:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 23:45:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 23:45:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 23:45:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 23:45:13,668 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 23:45:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 23:45:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 23:45:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 23:45:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 23:45:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 23:45:13,669 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 23:45:13,670 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 23:45:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 23:45:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 23:45:13,671 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 23:45:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 23:45:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 23:45:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 23:45:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 23:45:13,672 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 23:45:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 23:45:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 23:45:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 23:45:13,673 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 23:45:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-15 23:45:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 23:45:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 23:45:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 23:45:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 23:45:13,674 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 23:45:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 23:45:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 23:45:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 23:45:13,675 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 23:45:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 23:45:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 23:45:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 23:45:13,676 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 23:45:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 23:45:13,677 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 23:45:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 23:45:13,678 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 23:45:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 23:45:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 23:45:13,679 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 23:45:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 23:45:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 23:45:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 23:45:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 23:45:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 23:45:13,680 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 23:45:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 23:45:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 23:45:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 23:45:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 23:45:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 23:45:13,681 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 23:45:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 23:45:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 23:45:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 23:45:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 23:45:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 23:45:13,682 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 23:45:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 23:45:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 23:45:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 23:45:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 23:45:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 23:45:13,683 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 23:45:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 23:45:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 23:45:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 23:45:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 23:45:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 23:45:13,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 23:45:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 23:45:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 23:45:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 23:45:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-15 23:45:13,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 23:45:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:45:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:45:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 23:45:13,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:45:14,576 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:45:14,576 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 23:45:14,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:14 BoogieIcfgContainer [2019-11-15 23:45:14,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:45:14,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:45:14,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:45:14,582 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:45:14,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:45:12" (1/3) ... [2019-11-15 23:45:14,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3d64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:14, skipping insertion in model container [2019-11-15 23:45:14,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:45:13" (2/3) ... [2019-11-15 23:45:14,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b3d64f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:45:14, skipping insertion in model container [2019-11-15 23:45:14,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:45:14" (3/3) ... [2019-11-15 23:45:14,585 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-11-15 23:45:14,594 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:45:14,601 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 49 error locations. [2019-11-15 23:45:14,611 INFO L249 AbstractCegarLoop]: Starting to check reachability of 49 error locations. [2019-11-15 23:45:14,630 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:45:14,630 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 23:45:14,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:45:14,631 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:45:14,631 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:45:14,631 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:45:14,632 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:45:14,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:45:14,648 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-15 23:45:14,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 23:45:14,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:45:14,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:45:14,659 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr21REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr40REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr38REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr36REQUIRES_VIOLATION, mainErr45ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr34REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr31REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr29REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr27REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr25REQUIRES_VIOLATION, mainErr46ASSERT_VIOLATIONMEMORY_FREE, mainErr23REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr47ASSERT_VIOLATIONMEMORY_FREE, mainErr20REQUIRES_VIOLATION, mainErr41REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr39REQUIRES_VIOLATION, mainErr42ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr37REQUIRES_VIOLATION, mainErr43ASSERT_VIOLATIONMEMORY_FREE, mainErr14REQUIRES_VIOLATION, mainErr35REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr33REQUIRES_VIOLATION, mainErr32REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr30REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr28REQUIRES_VIOLATION, mainErr48ENSURES_VIOLATIONMEMORY_LEAK, mainErr5REQUIRES_VIOLATION, mainErr44ASSERT_VIOLATIONMEMORY_FREE, mainErr26REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr24REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr22REQUIRES_VIOLATION]=== [2019-11-15 23:45:14,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:45:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1381924233, now seen corresponding path program 1 times [2019-11-15 23:45:14,673 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:45:14,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [618039652] [2019-11-15 23:45:14,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dd50f115-3c20-4271-8940-65a4a675f473/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:45:14,892 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 23:45:14,892 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:45:14,898 INFO L168 Benchmark]: Toolchain (without parser) took 1926.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -103.9 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:14,898 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:45:14,899 INFO L168 Benchmark]: CACSL2BoogieTranslator took 571.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:14,900 INFO L168 Benchmark]: Boogie Preprocessor took 64.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:14,903 INFO L168 Benchmark]: RCFGBuilder took 970.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:14,905 INFO L168 Benchmark]: TraceAbstraction took 316.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:45:14,913 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 571.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 970.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 65.0 MB). Peak memory consumption was 65.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 316.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.9 MB). Peak memory consumption was 12.9 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...