./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.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_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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 66b1645e6497ed5e04695d784e7a77b914e4f212 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i -s /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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 66b1645e6497ed5e04695d784e7a77b914e4f212 ..................................................................................................................................................................................................................................................................................................................................................................... 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-16 00:08:00,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:08:00,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:08:00,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:08:00,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:08:00,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:08:00,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:08:00,734 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:08:00,738 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:08:00,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:08:00,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:08:00,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:08:00,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:08:00,748 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:08:00,750 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:08:00,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:08:00,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:08:00,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:08:00,755 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:08:00,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:08:00,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:08:00,763 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:08:00,766 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:08:00,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:08:00,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:08:00,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:08:00,770 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:08:00,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:08:00,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:08:00,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:08:00,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:08:00,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:08:00,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:08:00,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:08:00,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:08:00,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:08:00,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:08:00,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:08:00,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:08:00,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:08:00,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:08:00,780 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-16 00:08:00,806 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:08:00,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:08:00,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:08:00,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:08:00,818 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:08:00,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:08:00,818 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:08:00,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:08:00,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:08:00,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:08:00,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:08:00,819 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:08:00,820 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:08:00,820 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:08:00,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:08:00,820 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:08:00,821 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:08:00,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:08:00,822 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:08:00,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:08:00,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:08:00,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:08:00,823 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:08:00,823 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:08:00,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:08:00,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:08:00,824 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_c5b4e9de-b231-44fb-a504-7086af62d4f9/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 -> 66b1645e6497ed5e04695d784e7a77b914e4f212 [2019-11-16 00:08:00,856 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:08:00,866 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:08:00,868 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:08:00,870 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:08:00,870 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:08:00,871 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2019-11-16 00:08:00,935 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/9341234a7/4536f9a14b094218b7d935de475e16c9/FLAG51a571627 [2019-11-16 00:08:01,435 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:08:01,438 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2019-11-16 00:08:01,457 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/9341234a7/4536f9a14b094218b7d935de475e16c9/FLAG51a571627 [2019-11-16 00:08:01,758 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/9341234a7/4536f9a14b094218b7d935de475e16c9 [2019-11-16 00:08:01,760 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:08:01,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:08:01,762 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:08:01,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:08:01,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:08:01,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:01" (1/1) ... [2019-11-16 00:08:01,771 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@694e38d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:01, skipping insertion in model container [2019-11-16 00:08:01,772 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:08:01" (1/1) ... [2019-11-16 00:08:01,778 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:08:01,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:08:02,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:08:02,278 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:08:02,323 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:08:02,379 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:08:02,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02 WrapperNode [2019-11-16 00:08:02,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:08:02,381 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:08:02,381 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:08:02,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:08:02,395 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,454 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... [2019-11-16 00:08:02,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:08:02,461 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:08:02,461 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:08:02,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:08:02,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:08:02,531 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:08:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:08:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:08:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:08:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:08:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:08:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-16 00:08:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-16 00:08:02,533 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_insert [2019-11-16 00:08:02,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:08:02,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:08:02,534 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:08:02,534 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:08:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:08:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:08:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:08:02,535 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:08:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:08:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:08:02,536 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:08:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:08:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:08:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:08:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:08:02,537 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:08:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:08:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:08:02,538 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:08:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:08:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:08:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:08:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:08:02,539 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:08:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:08:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:08:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:08:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:08:02,540 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:08:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:08:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:08:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:08:02,541 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:08:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:08:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:08:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:08:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:08:02,542 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:08:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:08:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:08:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:08:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:08:02,543 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:08:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:08:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:08:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:08:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:08:02,544 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:08:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:08:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:08:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:08:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:08:02,545 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:08:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:08:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:08:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:08:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:08:02,546 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:08:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:08:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:08:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:08:02,547 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:08:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:08:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:08:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:08:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:08:02,548 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:08:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:08:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:08:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:08:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:08:02,549 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:08:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:08:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:08:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:08:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:08:02,550 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:08:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:08:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:08:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:08:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:08:02,551 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:08:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:08:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:08:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:08:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:08:02,552 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:08:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:08:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:08:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:08:02,553 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:08:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:08:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:08:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:08:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:08:02,554 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:08:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:08:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:08:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:08:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:08:02,555 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:08:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:08:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:08:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:08:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:08:02,556 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:08:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:08:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:08:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:08:02,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:08:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:08:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:08:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-16 00:08:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-16 00:08:02,558 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:08:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:08:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_insert [2019-11-16 00:08:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:08:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:08:02,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:08:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-16 00:08:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:08:02,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:08:03,115 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:08:03,610 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:08:03,610 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:08:03,612 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:03 BoogieIcfgContainer [2019-11-16 00:08:03,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:08:03,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:08:03,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:08:03,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:08:03,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:08:01" (1/3) ... [2019-11-16 00:08:03,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@864d89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:03, skipping insertion in model container [2019-11-16 00:08:03,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:08:02" (2/3) ... [2019-11-16 00:08:03,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@864d89b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:08:03, skipping insertion in model container [2019-11-16 00:08:03,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:08:03" (3/3) ... [2019-11-16 00:08:03,619 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2019-11-16 00:08:03,629 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:08:03,636 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2019-11-16 00:08:03,648 INFO L249 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2019-11-16 00:08:03,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:08:03,666 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:08:03,667 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:08:03,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:08:03,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:08:03,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:08:03,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:08:03,667 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:08:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2019-11-16 00:08:03,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:08:03,696 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:03,697 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:03,699 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:03,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:03,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1463698493, now seen corresponding path program 1 times [2019-11-16 00:08:03,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:03,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416861201] [2019-11-16 00:08:03,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:03,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:03,951 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-16 00:08:03,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416861201] [2019-11-16 00:08:03,957 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:03,958 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:03,958 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203639645] [2019-11-16 00:08:03,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:03,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:03,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:03,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:03,978 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 4 states. [2019-11-16 00:08:04,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:04,553 INFO L93 Difference]: Finished difference Result 206 states and 221 transitions. [2019-11-16 00:08:04,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:04,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:08:04,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:04,567 INFO L225 Difference]: With dead ends: 206 [2019-11-16 00:08:04,567 INFO L226 Difference]: Without dead ends: 199 [2019-11-16 00:08:04,569 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-16 00:08:04,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-16 00:08:04,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 180. [2019-11-16 00:08:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-16 00:08:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2019-11-16 00:08:04,641 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 12 [2019-11-16 00:08:04,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:04,642 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2019-11-16 00:08:04,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:04,642 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2019-11-16 00:08:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:08:04,643 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:04,643 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:04,644 INFO L410 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1463698492, now seen corresponding path program 1 times [2019-11-16 00:08:04,645 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:04,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903615592] [2019-11-16 00:08:04,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:04,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:04,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:04,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:04,745 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-16 00:08:04,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903615592] [2019-11-16 00:08:04,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:04,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:08:04,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612148278] [2019-11-16 00:08:04,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:08:04,747 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:08:04,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:08:04,748 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. Second operand 4 states. [2019-11-16 00:08:05,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:05,234 INFO L93 Difference]: Finished difference Result 196 states and 207 transitions. [2019-11-16 00:08:05,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:08:05,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-16 00:08:05,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:05,236 INFO L225 Difference]: With dead ends: 196 [2019-11-16 00:08:05,236 INFO L226 Difference]: Without dead ends: 196 [2019-11-16 00:08:05,237 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-16 00:08:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-16 00:08:05,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 177. [2019-11-16 00:08:05,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-16 00:08:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2019-11-16 00:08:05,262 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 12 [2019-11-16 00:08:05,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:05,263 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2019-11-16 00:08:05,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:08:05,263 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2019-11-16 00:08:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-16 00:08:05,264 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:05,264 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:05,264 INFO L410 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:05,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:05,265 INFO L82 PathProgramCache]: Analyzing trace with hash 147525888, now seen corresponding path program 1 times [2019-11-16 00:08:05,265 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:05,265 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186277335] [2019-11-16 00:08:05,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,265 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:05,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:05,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:05,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:05,491 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-16 00:08:05,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186277335] [2019-11-16 00:08:05,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:05,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:05,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561682787] [2019-11-16 00:08:05,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:05,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:05,501 INFO L87 Difference]: Start difference. First operand 177 states and 187 transitions. Second operand 7 states. [2019-11-16 00:08:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:06,117 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2019-11-16 00:08:06,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:06,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-11-16 00:08:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:06,120 INFO L225 Difference]: With dead ends: 197 [2019-11-16 00:08:06,120 INFO L226 Difference]: Without dead ends: 197 [2019-11-16 00:08:06,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-16 00:08:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 178. [2019-11-16 00:08:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-16 00:08:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 188 transitions. [2019-11-16 00:08:06,133 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 188 transitions. Word has length 20 [2019-11-16 00:08:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:06,135 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 188 transitions. [2019-11-16 00:08:06,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 188 transitions. [2019-11-16 00:08:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:08:06,136 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:06,136 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:06,137 INFO L410 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash -507601777, now seen corresponding path program 1 times [2019-11-16 00:08:06,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:06,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584374717] [2019-11-16 00:08:06,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:06,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:06,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584374717] [2019-11-16 00:08:06,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:06,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:08:06,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889131881] [2019-11-16 00:08:06,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:08:06,412 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:06,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:08:06,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:08:06,413 INFO L87 Difference]: Start difference. First operand 178 states and 188 transitions. Second operand 9 states. [2019-11-16 00:08:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:07,046 INFO L93 Difference]: Finished difference Result 197 states and 209 transitions. [2019-11-16 00:08:07,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:07,046 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2019-11-16 00:08:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:07,048 INFO L225 Difference]: With dead ends: 197 [2019-11-16 00:08:07,048 INFO L226 Difference]: Without dead ends: 197 [2019-11-16 00:08:07,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:07,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-16 00:08:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2019-11-16 00:08:07,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-16 00:08:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 187 transitions. [2019-11-16 00:08:07,057 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 187 transitions. Word has length 30 [2019-11-16 00:08:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:07,058 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 187 transitions. [2019-11-16 00:08:07,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:08:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 187 transitions. [2019-11-16 00:08:07,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-16 00:08:07,059 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:07,059 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:07,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:07,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:07,060 INFO L82 PathProgramCache]: Analyzing trace with hash -507601778, now seen corresponding path program 1 times [2019-11-16 00:08:07,060 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:07,060 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210717439] [2019-11-16 00:08:07,060 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:08:07,190 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210717439] [2019-11-16 00:08:07,190 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:07,190 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:08:07,190 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612944463] [2019-11-16 00:08:07,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:08:07,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:07,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:08:07,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:07,191 INFO L87 Difference]: Start difference. First operand 177 states and 187 transitions. Second operand 8 states. [2019-11-16 00:08:07,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:07,877 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2019-11-16 00:08:07,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:07,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-11-16 00:08:07,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:07,879 INFO L225 Difference]: With dead ends: 196 [2019-11-16 00:08:07,879 INFO L226 Difference]: Without dead ends: 196 [2019-11-16 00:08:07,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:07,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-16 00:08:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2019-11-16 00:08:07,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-16 00:08:07,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2019-11-16 00:08:07,887 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 30 [2019-11-16 00:08:07,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:07,888 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2019-11-16 00:08:07,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:08:07,888 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2019-11-16 00:08:07,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:08:07,893 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:07,893 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:07,893 INFO L410 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:07,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:07,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1820962735, now seen corresponding path program 1 times [2019-11-16 00:08:07,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:07,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089526629] [2019-11-16 00:08:07,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:07,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:07,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:08,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089526629] [2019-11-16 00:08:08,164 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1419038727] [2019-11-16 00:08:08,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:08:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:08,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:08:08,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:08,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-16 00:08:08,508 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:08,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 23 [2019-11-16 00:08:08,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:08,526 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-16 00:08:08,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:08,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-11-16 00:08:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:08,541 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:08,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2019-11-16 00:08:08,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951834699] [2019-11-16 00:08:08,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:08:08,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:08,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:08:08,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:08:08,543 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand 12 states. [2019-11-16 00:08:10,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:10,000 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2019-11-16 00:08:10,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:08:10,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-11-16 00:08:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:10,009 INFO L225 Difference]: With dead ends: 203 [2019-11-16 00:08:10,009 INFO L226 Difference]: Without dead ends: 203 [2019-11-16 00:08:10,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:08:10,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-16 00:08:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2019-11-16 00:08:10,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-16 00:08:10,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 194 transitions. [2019-11-16 00:08:10,026 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 194 transitions. Word has length 32 [2019-11-16 00:08:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:10,027 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 194 transitions. [2019-11-16 00:08:10,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:08:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 194 transitions. [2019-11-16 00:08:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-16 00:08:10,029 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:10,030 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:10,230 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:10,231 INFO L410 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:10,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:10,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1820962736, now seen corresponding path program 1 times [2019-11-16 00:08:10,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:10,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717554312] [2019-11-16 00:08:10,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:10,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:10,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,669 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:10,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717554312] [2019-11-16 00:08:10,670 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311724770] [2019-11-16 00:08:10,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:08:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:10,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-16 00:08:10,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:10,826 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:10,826 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:10,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:10,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:10,836 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:08:11,022 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:11,022 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-16 00:08:11,023 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:11,052 INFO L567 ElimStorePlain]: treesize reduction 14, result has 50.0 percent of original size [2019-11-16 00:08:11,053 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:11,053 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-11-16 00:08:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:08:11,064 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:11,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-11-16 00:08:11,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010192638] [2019-11-16 00:08:11,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-16 00:08:11,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:11,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-16 00:08:11,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:08:11,066 INFO L87 Difference]: Start difference. First operand 181 states and 194 transitions. Second operand 16 states. [2019-11-16 00:08:12,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:12,466 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2019-11-16 00:08:12,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:12,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 32 [2019-11-16 00:08:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:12,468 INFO L225 Difference]: With dead ends: 203 [2019-11-16 00:08:12,469 INFO L226 Difference]: Without dead ends: 203 [2019-11-16 00:08:12,469 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-11-16 00:08:12,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-16 00:08:12,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2019-11-16 00:08:12,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-16 00:08:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 193 transitions. [2019-11-16 00:08:12,474 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 193 transitions. Word has length 32 [2019-11-16 00:08:12,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:12,475 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 193 transitions. [2019-11-16 00:08:12,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-16 00:08:12,475 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 193 transitions. [2019-11-16 00:08:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-16 00:08:12,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:12,476 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:12,684 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:12,685 INFO L410 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:12,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:12,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1893652934, now seen corresponding path program 1 times [2019-11-16 00:08:12,685 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:12,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108540267] [2019-11-16 00:08:12,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,686 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:12,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,811 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:12,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108540267] [2019-11-16 00:08:12,813 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580771885] [2019-11-16 00:08:12,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:08:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:12,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:08:12,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:12,982 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:12,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 8 [2019-11-16 00:08:12,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40574881] [2019-11-16 00:08:12,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:08:12,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:08:12,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:12,983 INFO L87 Difference]: Start difference. First operand 181 states and 193 transitions. Second operand 8 states. [2019-11-16 00:08:13,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:13,433 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2019-11-16 00:08:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:13,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2019-11-16 00:08:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:13,435 INFO L225 Difference]: With dead ends: 201 [2019-11-16 00:08:13,435 INFO L226 Difference]: Without dead ends: 201 [2019-11-16 00:08:13,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-16 00:08:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 181. [2019-11-16 00:08:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-11-16 00:08:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2019-11-16 00:08:13,442 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 34 [2019-11-16 00:08:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:13,442 INFO L462 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2019-11-16 00:08:13,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:08:13,443 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2019-11-16 00:08:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:08:13,443 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:13,444 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:13,648 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:13,653 INFO L410 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:13,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:13,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1431081885, now seen corresponding path program 1 times [2019-11-16 00:08:13,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:13,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700829050] [2019-11-16 00:08:13,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,653 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:13,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:13,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700829050] [2019-11-16 00:08:13,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574565962] [2019-11-16 00:08:13,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:08:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:13,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-16 00:08:14,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:14,029 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:14,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 10 [2019-11-16 00:08:14,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640671928] [2019-11-16 00:08:14,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-16 00:08:14,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:14,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-16 00:08:14,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:08:14,031 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand 11 states. [2019-11-16 00:08:14,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:14,710 INFO L93 Difference]: Finished difference Result 211 states and 225 transitions. [2019-11-16 00:08:14,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:08:14,710 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-11-16 00:08:14,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:14,712 INFO L225 Difference]: With dead ends: 211 [2019-11-16 00:08:14,712 INFO L226 Difference]: Without dead ends: 211 [2019-11-16 00:08:14,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:08:14,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-16 00:08:14,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 184. [2019-11-16 00:08:14,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:08:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 197 transitions. [2019-11-16 00:08:14,723 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 197 transitions. Word has length 35 [2019-11-16 00:08:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:14,724 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 197 transitions. [2019-11-16 00:08:14,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-16 00:08:14,724 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 197 transitions. [2019-11-16 00:08:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:08:14,725 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:14,726 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:14,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:14,929 INFO L410 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:14,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1431081886, now seen corresponding path program 1 times [2019-11-16 00:08:14,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:14,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412465346] [2019-11-16 00:08:14,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,930 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:14,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:14,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:08:15,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412465346] [2019-11-16 00:08:15,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022043023] [2019-11-16 00:08:15,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:15,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:15,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-16 00:08:15,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:08:15,193 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:15,193 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 6 [2019-11-16 00:08:15,193 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402559759] [2019-11-16 00:08:15,195 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:08:15,195 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:08:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:08:15,195 INFO L87 Difference]: Start difference. First operand 184 states and 197 transitions. Second operand 7 states. [2019-11-16 00:08:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:15,909 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2019-11-16 00:08:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:08:15,910 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-11-16 00:08:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:15,912 INFO L225 Difference]: With dead ends: 204 [2019-11-16 00:08:15,912 INFO L226 Difference]: Without dead ends: 204 [2019-11-16 00:08:15,913 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:15,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-16 00:08:15,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 184. [2019-11-16 00:08:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-16 00:08:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2019-11-16 00:08:15,921 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 35 [2019-11-16 00:08:15,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:15,924 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2019-11-16 00:08:15,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:08:15,924 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2019-11-16 00:08:15,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:08:15,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:15,925 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:16,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:16,129 INFO L410 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:16,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1413865503, now seen corresponding path program 1 times [2019-11-16 00:08:16,130 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:16,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704788303] [2019-11-16 00:08:16,131 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:16,132 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:16,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:08:16,281 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704788303] [2019-11-16 00:08:16,281 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:16,281 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:08:16,281 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765328063] [2019-11-16 00:08:16,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:08:16,282 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:16,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:08:16,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:08:16,282 INFO L87 Difference]: Start difference. First operand 184 states and 196 transitions. Second operand 9 states. [2019-11-16 00:08:16,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:16,923 INFO L93 Difference]: Finished difference Result 203 states and 216 transitions. [2019-11-16 00:08:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:16,923 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-16 00:08:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:16,925 INFO L225 Difference]: With dead ends: 203 [2019-11-16 00:08:16,925 INFO L226 Difference]: Without dead ends: 203 [2019-11-16 00:08:16,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:08:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-11-16 00:08:16,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 183. [2019-11-16 00:08:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2019-11-16 00:08:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2019-11-16 00:08:16,931 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 36 [2019-11-16 00:08:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:16,931 INFO L462 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2019-11-16 00:08:16,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:08:16,932 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2019-11-16 00:08:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-16 00:08:16,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:16,932 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:16,933 INFO L410 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:16,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:16,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1413865502, now seen corresponding path program 1 times [2019-11-16 00:08:16,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:16,933 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135311486] [2019-11-16 00:08:16,933 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:16,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:16,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:08:17,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135311486] [2019-11-16 00:08:17,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:17,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:08:17,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468937730] [2019-11-16 00:08:17,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:08:17,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:08:17,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:08:17,111 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand 10 states. [2019-11-16 00:08:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:17,802 INFO L93 Difference]: Finished difference Result 201 states and 214 transitions. [2019-11-16 00:08:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:17,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-11-16 00:08:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:17,804 INFO L225 Difference]: With dead ends: 201 [2019-11-16 00:08:17,804 INFO L226 Difference]: Without dead ends: 201 [2019-11-16 00:08:17,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:08:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-16 00:08:17,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 182. [2019-11-16 00:08:17,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-11-16 00:08:17,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 194 transitions. [2019-11-16 00:08:17,814 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 194 transitions. Word has length 36 [2019-11-16 00:08:17,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:17,814 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 194 transitions. [2019-11-16 00:08:17,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:08:17,814 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 194 transitions. [2019-11-16 00:08:17,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-16 00:08:17,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:17,815 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:08:17,816 INFO L410 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:17,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:17,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1114443410, now seen corresponding path program 1 times [2019-11-16 00:08:17,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:17,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819403842] [2019-11-16 00:08:17,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:17,817 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:17,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:08:17,926 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819403842] [2019-11-16 00:08:17,926 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:08:17,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:08:17,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203422388] [2019-11-16 00:08:17,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:08:17,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:08:17,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:08:17,928 INFO L87 Difference]: Start difference. First operand 182 states and 194 transitions. Second operand 8 states. [2019-11-16 00:08:18,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:18,349 INFO L93 Difference]: Finished difference Result 189 states and 198 transitions. [2019-11-16 00:08:18,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:08:18,350 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2019-11-16 00:08:18,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:18,351 INFO L225 Difference]: With dead ends: 189 [2019-11-16 00:08:18,352 INFO L226 Difference]: Without dead ends: 189 [2019-11-16 00:08:18,352 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:08:18,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-16 00:08:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 170. [2019-11-16 00:08:18,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-11-16 00:08:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 178 transitions. [2019-11-16 00:08:18,361 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 178 transitions. Word has length 47 [2019-11-16 00:08:18,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:18,361 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 178 transitions. [2019-11-16 00:08:18,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:08:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 178 transitions. [2019-11-16 00:08:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:08:18,362 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:18,362 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:08:18,363 INFO L410 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:18,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:18,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1059875281, now seen corresponding path program 1 times [2019-11-16 00:08:18,364 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:18,364 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443944200] [2019-11-16 00:08:18,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:18,364 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:18,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:18,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:19,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:08:19,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443944200] [2019-11-16 00:08:19,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388559868] [2019-11-16 00:08:19,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:19,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:19,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-16 00:08:19,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:19,354 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:19,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:19,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-16 00:08:19,367 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:08:19,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:19,373 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:08:19,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:19,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:19,507 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:08:19,507 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:08:19,508 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,520 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:19,521 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:19,521 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:27 [2019-11-16 00:08:19,649 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:19,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:08:19,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,661 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:19,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,662 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:08:19,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:19,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:19,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:19,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:08:19,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:19,707 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.0 percent of original size [2019-11-16 00:08:19,707 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:19,708 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:26 [2019-11-16 00:08:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:08:19,748 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:19,748 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 21 [2019-11-16 00:08:19,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375968590] [2019-11-16 00:08:19,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-16 00:08:19,749 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:19,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-16 00:08:19,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:08:19,750 INFO L87 Difference]: Start difference. First operand 170 states and 178 transitions. Second operand 22 states. [2019-11-16 00:08:20,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:20,980 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2019-11-16 00:08:20,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:08:20,996 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 53 [2019-11-16 00:08:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:20,998 INFO L225 Difference]: With dead ends: 180 [2019-11-16 00:08:20,998 INFO L226 Difference]: Without dead ends: 180 [2019-11-16 00:08:20,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2019-11-16 00:08:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-16 00:08:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 159. [2019-11-16 00:08:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2019-11-16 00:08:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2019-11-16 00:08:21,003 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 53 [2019-11-16 00:08:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:21,003 INFO L462 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2019-11-16 00:08:21,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-16 00:08:21,003 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2019-11-16 00:08:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-16 00:08:21,004 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:21,004 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:08:21,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:21,205 INFO L410 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:21,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:21,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1059875282, now seen corresponding path program 1 times [2019-11-16 00:08:21,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:21,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115278974] [2019-11-16 00:08:21,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:21,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:21,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,652 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-16 00:08:21,652 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115278974] [2019-11-16 00:08:21,653 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979342694] [2019-11-16 00:08:21,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:21,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-16 00:08:21,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:21,832 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:08:21,833 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:21,839 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:21,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:21,840 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-16 00:08:21,848 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-16 00:08:21,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:21,858 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:21,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:21,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-16 00:08:21,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:21,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:22,010 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-16 00:08:22,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-11-16 00:08:22,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:22,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:22,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:22,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2019-11-16 00:08:22,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:22,147 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-16 00:08:22,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:22,154 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:22,155 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:22,155 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-11-16 00:08:22,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:22,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:22,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:22,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 36 [2019-11-16 00:08:22,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:22,234 INFO L567 ElimStorePlain]: treesize reduction 14, result has 67.4 percent of original size [2019-11-16 00:08:22,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:22,235 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:30, output treesize:29 [2019-11-16 00:08:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-11-16 00:08:22,274 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:08:22,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2019-11-16 00:08:22,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628007302] [2019-11-16 00:08:22,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:08:22,275 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:08:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-11-16 00:08:22,276 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand 18 states. [2019-11-16 00:08:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:08:23,496 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2019-11-16 00:08:23,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-16 00:08:23,496 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 53 [2019-11-16 00:08:23,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:08:23,498 INFO L225 Difference]: With dead ends: 168 [2019-11-16 00:08:23,498 INFO L226 Difference]: Without dead ends: 168 [2019-11-16 00:08:23,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2019-11-16 00:08:23,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-11-16 00:08:23,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 148. [2019-11-16 00:08:23,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-16 00:08:23,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 156 transitions. [2019-11-16 00:08:23,504 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 156 transitions. Word has length 53 [2019-11-16 00:08:23,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:08:23,505 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 156 transitions. [2019-11-16 00:08:23,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:08:23,505 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 156 transitions. [2019-11-16 00:08:23,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:08:23,506 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:08:23,506 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:08:23,707 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:23,707 INFO L410 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:08:23,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:08:23,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1854935535, now seen corresponding path program 1 times [2019-11-16 00:08:23,707 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:08:23,708 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870248239] [2019-11-16 00:08:23,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:23,708 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:08:23,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:08:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:23,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:08:24,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870248239] [2019-11-16 00:08:24,450 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246837511] [2019-11-16 00:08:24,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:08:24,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:08:24,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-16 00:08:24,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:08:24,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:08:24,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:24,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:24,886 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_2| vanished before elimination [2019-11-16 00:08:24,886 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:08:24,886 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:7 [2019-11-16 00:08:36,464 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:36,464 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 44 [2019-11-16 00:08:36,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:36,495 INFO L567 ElimStorePlain]: treesize reduction 26, result has 65.8 percent of original size [2019-11-16 00:08:36,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:36,537 INFO L341 Elim1Store]: treesize reduction 82, result has 17.2 percent of original size [2019-11-16 00:08:36,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 29 [2019-11-16 00:08:36,537 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:36,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:36,557 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:08:36,557 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:39 [2019-11-16 00:08:38,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:08:38,654 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:08:38,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 15 [2019-11-16 00:08:38,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:08:38,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:08:38,660 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-16 00:08:38,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:11 [2019-11-16 00:08:38,677 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-16 00:08:38,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:08:38,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [20] total 31 [2019-11-16 00:08:38,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504024523] [2019-11-16 00:08:38,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-16 00:08:38,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:08:38,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-16 00:08:38,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=900, Unknown=7, NotChecked=0, Total=992 [2019-11-16 00:08:38,679 INFO L87 Difference]: Start difference. First operand 148 states and 156 transitions. Second operand 18 states. [2019-11-16 00:08:57,872 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-11-16 00:09:01,911 WARN L191 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-16 00:09:05,360 WARN L191 SmtUtils]: Spent 3.40 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-11-16 00:09:29,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:09:29,079 INFO L93 Difference]: Finished difference Result 216 states and 228 transitions. [2019-11-16 00:09:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-16 00:09:29,079 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 56 [2019-11-16 00:09:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:09:29,082 INFO L225 Difference]: With dead ends: 216 [2019-11-16 00:09:29,082 INFO L226 Difference]: Without dead ends: 216 [2019-11-16 00:09:29,083 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 30.2s TimeCoverageRelationStatistics Valid=168, Invalid=1541, Unknown=13, NotChecked=0, Total=1722 [2019-11-16 00:09:29,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-16 00:09:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 155. [2019-11-16 00:09:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-16 00:09:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2019-11-16 00:09:29,090 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 56 [2019-11-16 00:09:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:09:29,090 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2019-11-16 00:09:29,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-16 00:09:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2019-11-16 00:09:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-16 00:09:29,091 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:09:29,091 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:09:29,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:29,292 INFO L410 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:09:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:09:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1854935534, now seen corresponding path program 1 times [2019-11-16 00:09:29,293 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:09:29,293 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873763778] [2019-11-16 00:09:29,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,293 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:09:29,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:09:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:30,412 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-16 00:09:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:09:30,430 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873763778] [2019-11-16 00:09:30,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772476258] [2019-11-16 00:09:30,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:09:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:09:30,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-16 00:09:30,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:09:30,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:09:30,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:30,627 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:30,628 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:30,628 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:09:31,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-16 00:09:31,166 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:31,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:31,177 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_BEFORE_CALL_5| vanished before elimination [2019-11-16 00:09:31,180 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 15 treesize of output 7 [2019-11-16 00:09:31,180 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:31,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:31,187 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:09:31,188 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:10 [2019-11-16 00:09:46,563 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:46,564 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 53 [2019-11-16 00:09:46,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:46,621 INFO L567 ElimStorePlain]: treesize reduction 26, result has 77.8 percent of original size [2019-11-16 00:09:46,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-11-16 00:09:46,632 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:46,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:46,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,661 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,662 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:46,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-11-16 00:09:46,664 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:46,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:46,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:46,689 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:100, output treesize:69 [2019-11-16 00:09:48,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:48,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:48,789 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2019-11-16 00:09:48,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:48,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:48,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:09:48,817 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-16 00:09:48,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2019-11-16 00:09:48,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:09:48,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:09:48,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:09:48,831 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:80, output treesize:17 [2019-11-16 00:09:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-16 00:09:48,999 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:09:49,001 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 42 [2019-11-16 00:09:49,001 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401993254] [2019-11-16 00:09:49,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-16 00:09:49,002 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:09:49,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-16 00:09:49,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1682, Unknown=8, NotChecked=0, Total=1806 [2019-11-16 00:09:49,003 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand 43 states. [2019-11-16 00:09:49,535 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-11-16 00:10:06,495 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-16 00:10:06,840 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-11-16 00:10:11,278 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 43 [2019-11-16 00:10:32,063 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 67 [2019-11-16 00:10:32,530 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-11-16 00:10:33,103 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 72 [2019-11-16 00:10:46,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:46,551 INFO L93 Difference]: Finished difference Result 212 states and 224 transitions. [2019-11-16 00:10:46,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:10:46,552 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 56 [2019-11-16 00:10:46,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:46,553 INFO L225 Difference]: With dead ends: 212 [2019-11-16 00:10:46,553 INFO L226 Difference]: Without dead ends: 212 [2019-11-16 00:10:46,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 44.5s TimeCoverageRelationStatistics Valid=269, Invalid=3253, Unknown=18, NotChecked=0, Total=3540 [2019-11-16 00:10:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-11-16 00:10:46,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 155. [2019-11-16 00:10:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-16 00:10:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2019-11-16 00:10:46,559 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 56 [2019-11-16 00:10:46,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:46,559 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2019-11-16 00:10:46,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-16 00:10:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2019-11-16 00:10:46,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:10:46,560 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:46,561 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:46,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:46,768 INFO L410 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:46,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:46,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1668428231, now seen corresponding path program 1 times [2019-11-16 00:10:46,769 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:46,769 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068513938] [2019-11-16 00:10:46,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:46,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:46,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:46,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:46,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:46,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:46,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:10:46,860 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068513938] [2019-11-16 00:10:46,860 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:46,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:10:46,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191711489] [2019-11-16 00:10:46,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:10:46,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:10:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:10:46,862 INFO L87 Difference]: Start difference. First operand 155 states and 171 transitions. Second operand 5 states. [2019-11-16 00:10:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:47,243 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2019-11-16 00:10:47,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:10:47,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-11-16 00:10:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:47,245 INFO L225 Difference]: With dead ends: 172 [2019-11-16 00:10:47,245 INFO L226 Difference]: Without dead ends: 172 [2019-11-16 00:10:47,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 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-16 00:10:47,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-11-16 00:10:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 151. [2019-11-16 00:10:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-16 00:10:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2019-11-16 00:10:47,249 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 57 [2019-11-16 00:10:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:47,249 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2019-11-16 00:10:47,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:10:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2019-11-16 00:10:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:10:47,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:47,250 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:47,251 INFO L410 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:47,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:47,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1336291718, now seen corresponding path program 1 times [2019-11-16 00:10:47,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:47,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46501846] [2019-11-16 00:10:47,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:47,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:47,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:47,379 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:10:47,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46501846] [2019-11-16 00:10:47,380 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:47,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:10:47,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609841377] [2019-11-16 00:10:47,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:10:47,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:10:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:10:47,382 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand 8 states. [2019-11-16 00:10:47,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:47,961 INFO L93 Difference]: Finished difference Result 164 states and 174 transitions. [2019-11-16 00:10:47,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:47,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-16 00:10:47,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:47,962 INFO L225 Difference]: With dead ends: 164 [2019-11-16 00:10:47,962 INFO L226 Difference]: Without dead ends: 164 [2019-11-16 00:10:47,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:10:47,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-16 00:10:47,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2019-11-16 00:10:47,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-16 00:10:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 154 transitions. [2019-11-16 00:10:47,966 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 154 transitions. Word has length 59 [2019-11-16 00:10:47,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:47,966 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 154 transitions. [2019-11-16 00:10:47,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:10:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 154 transitions. [2019-11-16 00:10:47,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:10:47,967 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:47,967 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:47,968 INFO L410 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:47,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1336291717, now seen corresponding path program 1 times [2019-11-16 00:10:47,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:47,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626024541] [2019-11-16 00:10:47,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:47,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:47,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:10:48,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626024541] [2019-11-16 00:10:48,083 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:48,083 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:10:48,083 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375716494] [2019-11-16 00:10:48,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:10:48,084 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:48,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:10:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:10:48,085 INFO L87 Difference]: Start difference. First operand 145 states and 154 transitions. Second operand 8 states. [2019-11-16 00:10:48,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:48,450 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2019-11-16 00:10:48,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:10:48,451 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-11-16 00:10:48,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:48,452 INFO L225 Difference]: With dead ends: 163 [2019-11-16 00:10:48,452 INFO L226 Difference]: Without dead ends: 163 [2019-11-16 00:10:48,452 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-11-16 00:10:48,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-16 00:10:48,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 144. [2019-11-16 00:10:48,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-16 00:10:48,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2019-11-16 00:10:48,455 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 59 [2019-11-16 00:10:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:48,455 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2019-11-16 00:10:48,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:10:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2019-11-16 00:10:48,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:10:48,455 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:48,456 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:10:48,456 INFO L410 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:48,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:48,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1335151970, now seen corresponding path program 1 times [2019-11-16 00:10:48,456 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:48,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44187578] [2019-11-16 00:10:48,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:48,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:48,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:10:48,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44187578] [2019-11-16 00:10:48,585 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:48,586 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:10:48,586 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265893080] [2019-11-16 00:10:48,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:10:48,586 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:48,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:10:48,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:10:48,587 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand 9 states. [2019-11-16 00:10:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:49,156 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2019-11-16 00:10:49,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:10:49,156 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2019-11-16 00:10:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:49,158 INFO L225 Difference]: With dead ends: 160 [2019-11-16 00:10:49,158 INFO L226 Difference]: Without dead ends: 160 [2019-11-16 00:10:49,158 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:10:49,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-16 00:10:49,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 141. [2019-11-16 00:10:49,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-11-16 00:10:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2019-11-16 00:10:49,163 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 59 [2019-11-16 00:10:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:49,164 INFO L462 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2019-11-16 00:10:49,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:10:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2019-11-16 00:10:49,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:10:49,165 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:49,165 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:49,166 INFO L410 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:49,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:49,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1559960396, now seen corresponding path program 1 times [2019-11-16 00:10:49,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:49,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22337865] [2019-11-16 00:10:49,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:49,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:49,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:10:49,277 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22337865] [2019-11-16 00:10:49,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:49,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:10:49,278 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316982693] [2019-11-16 00:10:49,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:10:49,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:49,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:10:49,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:10:49,279 INFO L87 Difference]: Start difference. First operand 141 states and 148 transitions. Second operand 6 states. [2019-11-16 00:10:49,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:49,693 INFO L93 Difference]: Finished difference Result 161 states and 169 transitions. [2019-11-16 00:10:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:10:49,695 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:10:49,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:49,696 INFO L225 Difference]: With dead ends: 161 [2019-11-16 00:10:49,696 INFO L226 Difference]: Without dead ends: 161 [2019-11-16 00:10:49,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:10:49,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-11-16 00:10:49,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 140. [2019-11-16 00:10:49,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-11-16 00:10:49,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2019-11-16 00:10:49,699 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 60 [2019-11-16 00:10:49,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:49,699 INFO L462 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2019-11-16 00:10:49,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:10:49,700 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2019-11-16 00:10:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-16 00:10:49,700 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:49,700 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:49,701 INFO L410 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:49,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1559960397, now seen corresponding path program 1 times [2019-11-16 00:10:49,701 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:49,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152451598] [2019-11-16 00:10:49,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:49,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:49,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:49,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-16 00:10:49,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152451598] [2019-11-16 00:10:49,813 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:49,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:10:49,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063198891] [2019-11-16 00:10:49,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:10:49,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:49,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:10:49,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:10:49,815 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand 6 states. [2019-11-16 00:10:50,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:50,212 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2019-11-16 00:10:50,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:10:50,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-16 00:10:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:50,213 INFO L225 Difference]: With dead ends: 158 [2019-11-16 00:10:50,213 INFO L226 Difference]: Without dead ends: 158 [2019-11-16 00:10:50,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:10:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-16 00:10:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 139. [2019-11-16 00:10:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-11-16 00:10:50,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2019-11-16 00:10:50,216 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 60 [2019-11-16 00:10:50,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:50,216 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2019-11-16 00:10:50,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:10:50,217 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2019-11-16 00:10:50,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-16 00:10:50,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:50,217 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:50,217 INFO L410 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:50,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:50,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1114132173, now seen corresponding path program 1 times [2019-11-16 00:10:50,218 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:50,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010553509] [2019-11-16 00:10:50,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:50,218 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:50,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:50,405 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-16 00:10:50,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010553509] [2019-11-16 00:10:50,405 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:10:50,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:10:50,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636311514] [2019-11-16 00:10:50,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-16 00:10:50,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:10:50,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-16 00:10:50,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:10:50,408 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand 9 states. [2019-11-16 00:10:50,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:10:50,842 INFO L93 Difference]: Finished difference Result 152 states and 160 transitions. [2019-11-16 00:10:50,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:10:50,842 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2019-11-16 00:10:50,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:10:50,843 INFO L225 Difference]: With dead ends: 152 [2019-11-16 00:10:50,844 INFO L226 Difference]: Without dead ends: 152 [2019-11-16 00:10:50,844 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:10:50,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-16 00:10:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 133. [2019-11-16 00:10:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-11-16 00:10:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2019-11-16 00:10:50,847 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 61 [2019-11-16 00:10:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:10:50,848 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2019-11-16 00:10:50,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-16 00:10:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2019-11-16 00:10:50,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:10:50,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:10:50,848 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:10:50,849 INFO L410 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:10:50,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:10:50,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1234165551, now seen corresponding path program 1 times [2019-11-16 00:10:50,849 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:10:50,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630028497] [2019-11-16 00:10:50,849 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:50,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:10:50,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:10:50,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:51,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:52,600 WARN L191 SmtUtils]: Spent 371.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-11-16 00:10:52,615 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:10:52,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630028497] [2019-11-16 00:10:52,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [418884086] [2019-11-16 00:10:52,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:10:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:10:52,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 100 conjunts are in the unsatisfiable core [2019-11-16 00:10:52,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:10:52,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:52,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:10:52,995 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:52,998 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:52,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:52,998 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-16 00:10:53,096 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-16 00:10:53,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:53,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:53,103 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:10:53,103 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-11-16 00:10:53,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:10:53,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:53,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:53,166 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-16 00:10:53,166 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-11-16 00:10:53,286 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:53,286 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 52 [2019-11-16 00:10:53,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:53,309 INFO L567 ElimStorePlain]: treesize reduction 22, result has 63.3 percent of original size [2019-11-16 00:10:53,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:53,310 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:42, output treesize:38 [2019-11-16 00:10:55,380 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 27 DAG size of output: 23 [2019-11-16 00:10:55,439 INFO L341 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2019-11-16 00:10:55,439 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 48 treesize of output 75 [2019-11-16 00:10:55,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:55,484 INFO L567 ElimStorePlain]: treesize reduction 58, result has 48.7 percent of original size [2019-11-16 00:10:55,485 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-16 00:10:55,485 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:53, output treesize:55 [2019-11-16 00:10:56,238 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 7 [2019-11-16 00:10:56,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:10:56,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:56,262 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_BEFORE_CALL_5|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-11-16 00:10:56,266 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 79 treesize of output 63 [2019-11-16 00:10:56,267 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:56,282 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:10:56,376 INFO L341 Elim1Store]: treesize reduction 10, result has 87.7 percent of original size [2019-11-16 00:10:56,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 87 [2019-11-16 00:10:56,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:10:56,385 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:56,454 INFO L567 ElimStorePlain]: treesize reduction 38, result has 47.9 percent of original size [2019-11-16 00:10:56,454 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:10:56,455 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:119, output treesize:31 [2019-11-16 00:11:01,166 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:01,166 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 159 [2019-11-16 00:11:01,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:01,255 INFO L567 ElimStorePlain]: treesize reduction 82, result has 70.9 percent of original size [2019-11-16 00:11:01,257 INFO L392 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_30|], 36=[|v_#memory_$Pointer$.base_BEFORE_CALL_9|]} [2019-11-16 00:11:01,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 115 [2019-11-16 00:11:01,275 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:01,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:01,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,321 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:01,706 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 99 [2019-11-16 00:11:01,706 INFO L341 Elim1Store]: treesize reduction 213, result has 64.3 percent of original size [2019-11-16 00:11:01,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 160 treesize of output 441 [2019-11-16 00:11:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:11:01,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:11:01,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:01,780 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:01,944 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 54 [2019-11-16 00:11:01,944 INFO L567 ElimStorePlain]: treesize reduction 424, result has 22.8 percent of original size [2019-11-16 00:11:01,945 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:01,945 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:180, output treesize:178 [2019-11-16 00:11:02,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:02,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:02,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 101 [2019-11-16 00:11:02,196 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:02,240 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:02,241 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:02,241 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:189, output treesize:142 [2019-11-16 00:11:02,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:02,783 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2019-11-16 00:11:02,783 INFO L341 Elim1Store]: treesize reduction 20, result has 88.7 percent of original size [2019-11-16 00:11:02,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 13 case distinctions, treesize of input 136 treesize of output 200 [2019-11-16 00:11:02,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:02,825 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:02,906 INFO L567 ElimStorePlain]: treesize reduction 124, result has 29.1 percent of original size [2019-11-16 00:11:02,906 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:02,907 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:146, output treesize:51 [2019-11-16 00:11:03,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:03,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:03,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 13 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:11:03,164 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:11:03,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 57 [2019-11-16 00:11:03,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452972997] [2019-11-16 00:11:03,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-11-16 00:11:03,165 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:11:03,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-11-16 00:11:03,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3126, Unknown=2, NotChecked=0, Total=3306 [2019-11-16 00:11:03,167 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand 58 states. [2019-11-16 00:11:03,992 WARN L191 SmtUtils]: Spent 484.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-16 00:11:20,819 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2019-11-16 00:11:23,080 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-11-16 00:11:26,446 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-16 00:11:26,772 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 130 [2019-11-16 00:11:29,234 WARN L191 SmtUtils]: Spent 2.15 s on a formula simplification that was a NOOP. DAG size: 151 [2019-11-16 00:11:29,646 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 109 [2019-11-16 00:11:38,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:11:38,146 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2019-11-16 00:11:38,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-16 00:11:38,147 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 63 [2019-11-16 00:11:38,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:11:38,148 INFO L225 Difference]: With dead ends: 151 [2019-11-16 00:11:38,148 INFO L226 Difference]: Without dead ends: 151 [2019-11-16 00:11:38,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 27.8s TimeCoverageRelationStatistics Valid=433, Invalid=6367, Unknown=6, NotChecked=0, Total=6806 [2019-11-16 00:11:38,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-16 00:11:38,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 132. [2019-11-16 00:11:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-16 00:11:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2019-11-16 00:11:38,153 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 63 [2019-11-16 00:11:38,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:11:38,153 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2019-11-16 00:11:38,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-11-16 00:11:38,153 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2019-11-16 00:11:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:11:38,154 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:38,154 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:11:38,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:38,358 INFO L410 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:38,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:38,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1234165552, now seen corresponding path program 1 times [2019-11-16 00:11:38,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:11:38,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414563380] [2019-11-16 00:11:38,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:38,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:11:38,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:11:38,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:41,111 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-16 00:11:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:11:41,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414563380] [2019-11-16 00:11:41,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22704236] [2019-11-16 00:11:41,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:41,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:11:41,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-16 00:11:41,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:11:41,338 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-16 00:11:41,339 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,340 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:41,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-16 00:11:41,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:41,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-16 00:11:41,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:41,900 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:41,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-16 00:11:41,901 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,914 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:41,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:41,914 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:21 [2019-11-16 00:11:42,090 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-16 00:11:42,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,104 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,107 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-16 00:11:42,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,120 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-11-16 00:11:42,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:11:42,211 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2019-11-16 00:11:42,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:64 [2019-11-16 00:11:42,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:42,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 128 [2019-11-16 00:11:42,486 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,544 INFO L567 ElimStorePlain]: treesize reduction 92, result has 57.4 percent of original size [2019-11-16 00:11:42,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:42,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 52 [2019-11-16 00:11:42,548 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,571 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:128, output treesize:108 [2019-11-16 00:11:42,695 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:42,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:42,745 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 88 treesize of output 154 [2019-11-16 00:11:42,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,862 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-11-16 00:11:42,862 INFO L567 ElimStorePlain]: treesize reduction 88, result has 53.2 percent of original size [2019-11-16 00:11:42,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:42,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-16 00:11:42,870 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2019-11-16 00:11:42,871 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:42,905 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:42,906 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-16 00:11:42,906 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:134, output treesize:154 [2019-11-16 00:11:43,812 INFO L392 ElimStorePlain]: Different costs {0=[|v_#valid_BEFORE_CALL_23|], 1=[|v_#length_BEFORE_CALL_18|]} [2019-11-16 00:11:43,817 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-16 00:11:43,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:43,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:43,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 26 [2019-11-16 00:11:43,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-16 00:11:43,900 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-16 00:11:44,037 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-16 00:11:44,038 INFO L341 Elim1Store]: treesize reduction 18, result has 88.2 percent of original size [2019-11-16 00:11:44,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 267 treesize of output 275 [2019-11-16 00:11:44,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:11:44,046 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-16 00:11:44,208 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-16 00:11:44,208 INFO L567 ElimStorePlain]: treesize reduction 120, result has 53.7 percent of original size [2019-11-16 00:11:44,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:11:44,410 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.generateProof(TraceAbstractionRefinementEngine.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:299) ... 21 more [2019-11-16 00:11:44,414 INFO L168 Benchmark]: Toolchain (without parser) took 222652.82 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -131.9 MB). Peak memory consumption was 170.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:44,414 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:44,415 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:44,415 INFO L168 Benchmark]: Boogie Preprocessor took 79.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:44,417 INFO L168 Benchmark]: RCFGBuilder took 1150.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:44,417 INFO L168 Benchmark]: TraceAbstraction took 220800.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -62.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:44,419 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 618.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.5 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -151.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.47 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1150.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 81.6 MB). Peak memory consumption was 81.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 220800.37 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -62.5 MB). Peak memory consumption was 121.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.tryExecuteInterpolantGenerator(TraceAbstractionRefinementEngine.java:307) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:11:46,691 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:11:46,693 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:11:46,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:11:46,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:11:46,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:11:46,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:11:46,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:11:46,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:11:46,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:11:46,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:11:46,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:11:46,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:11:46,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:11:46,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:11:46,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:11:46,716 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:11:46,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:11:46,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:11:46,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:11:46,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:11:46,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:11:46,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:11:46,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:11:46,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:11:46,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:11:46,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:11:46,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:11:46,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:11:46,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:11:46,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:11:46,731 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:11:46,732 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:11:46,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:11:46,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:11:46,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:11:46,734 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:11:46,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:11:46,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:11:46,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:11:46,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:11:46,737 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-16 00:11:46,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:11:46,754 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:11:46,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:11:46,756 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:11:46,756 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:11:46,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:11:46,757 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:11:46,757 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:11:46,757 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:11:46,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:11:46,758 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:11:46,759 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-16 00:11:46,759 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-16 00:11:46,759 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-16 00:11:46,759 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:11:46,759 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:11:46,760 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:11:46,760 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:11:46,760 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:11:46,761 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:11:46,761 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:11:46,761 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:11:46,762 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:11:46,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:11:46,762 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:11:46,762 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:11:46,763 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:11:46,763 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:11:46,763 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:11:46,763 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_c5b4e9de-b231-44fb-a504-7086af62d4f9/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 -> 66b1645e6497ed5e04695d784e7a77b914e4f212 [2019-11-16 00:11:46,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:11:46,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:11:46,813 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:11:46,814 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:11:46,815 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:11:46,815 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/../../sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2019-11-16 00:11:46,877 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/7324330b7/e55a1b7aaf4e42758a4182d1975cfa57/FLAGb6b26fb88 [2019-11-16 00:11:47,387 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:11:47,388 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/sv-benchmarks/c/list-simple/dll2c_insert_unequal.i [2019-11-16 00:11:47,408 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/7324330b7/e55a1b7aaf4e42758a4182d1975cfa57/FLAGb6b26fb88 [2019-11-16 00:11:47,737 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/bin/uautomizer/data/7324330b7/e55a1b7aaf4e42758a4182d1975cfa57 [2019-11-16 00:11:47,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:11:47,741 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-16 00:11:47,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:47,743 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:11:47,746 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:11:47,747 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:47" (1/1) ... [2019-11-16 00:11:47,749 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@710bad03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:47, skipping insertion in model container [2019-11-16 00:11:47,749 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:11:47" (1/1) ... [2019-11-16 00:11:47,756 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:11:47,808 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:11:48,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:48,273 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:11:48,330 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:11:48,387 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:11:48,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48 WrapperNode [2019-11-16 00:11:48,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:11:48,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:11:48,389 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:11:48,389 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:11:48,403 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,403 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,423 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... [2019-11-16 00:11:48,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:11:48,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:11:48,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:11:48,466 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:11:48,467 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:11:48,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-16 00:11:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:11:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-16 00:11:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-16 00:11:48,529 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-16 00:11:48,530 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-16 00:11:48,530 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-16 00:11:48,530 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-16 00:11:48,530 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_insert [2019-11-16 00:11:48,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-16 00:11:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-16 00:11:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-16 00:11:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-16 00:11:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-16 00:11:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-16 00:11:48,531 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-16 00:11:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-16 00:11:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-16 00:11:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-16 00:11:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-16 00:11:48,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-16 00:11:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-16 00:11:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-16 00:11:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-16 00:11:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-16 00:11:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-16 00:11:48,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-16 00:11:48,534 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-16 00:11:48,534 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-16 00:11:48,534 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-16 00:11:48,534 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-16 00:11:48,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-16 00:11:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-16 00:11:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-16 00:11:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-16 00:11:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-16 00:11:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-16 00:11:48,535 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-16 00:11:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-16 00:11:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-16 00:11:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-16 00:11:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-16 00:11:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-16 00:11:48,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-16 00:11:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-16 00:11:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-16 00:11:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-16 00:11:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-16 00:11:48,537 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-16 00:11:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-16 00:11:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-16 00:11:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-16 00:11:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-16 00:11:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-16 00:11:48,538 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-16 00:11:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-16 00:11:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-16 00:11:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-16 00:11:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-16 00:11:48,539 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-16 00:11:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-16 00:11:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-16 00:11:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-16 00:11:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-16 00:11:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-16 00:11:48,540 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-16 00:11:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-16 00:11:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-16 00:11:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-16 00:11:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-16 00:11:48,541 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-16 00:11:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-16 00:11:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-16 00:11:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-16 00:11:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-16 00:11:48,542 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-16 00:11:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-16 00:11:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-16 00:11:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-16 00:11:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-16 00:11:48,543 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-16 00:11:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-16 00:11:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-16 00:11:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-16 00:11:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-16 00:11:48,544 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-16 00:11:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-16 00:11:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-16 00:11:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-16 00:11:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-16 00:11:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-16 00:11:48,545 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-16 00:11:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-16 00:11:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-16 00:11:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-16 00:11:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-16 00:11:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-16 00:11:48,546 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-16 00:11:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-16 00:11:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-16 00:11:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-16 00:11:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-16 00:11:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-16 00:11:48,547 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-16 00:11:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-16 00:11:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-16 00:11:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-16 00:11:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-16 00:11:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-16 00:11:48,548 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-16 00:11:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-16 00:11:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-16 00:11:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-16 00:11:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-16 00:11:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-16 00:11:48,549 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-16 00:11:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-16 00:11:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-16 00:11:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-16 00:11:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-16 00:11:48,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-16 00:11:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-16 00:11:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-16 00:11:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-16 00:11:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:11:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_insert [2019-11-16 00:11:48,551 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-16 00:11:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:11:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-16 00:11:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-16 00:11:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-16 00:11:48,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:11:49,066 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-16 00:11:49,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:11:49,775 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-16 00:11:49,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:49 BoogieIcfgContainer [2019-11-16 00:11:49,777 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:11:49,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:11:49,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:11:49,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:11:49,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:11:47" (1/3) ... [2019-11-16 00:11:49,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f56881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:49, skipping insertion in model container [2019-11-16 00:11:49,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:11:48" (2/3) ... [2019-11-16 00:11:49,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f56881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:49, skipping insertion in model container [2019-11-16 00:11:49,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:49" (3/3) ... [2019-11-16 00:11:49,785 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_insert_unequal.i [2019-11-16 00:11:49,793 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:11:49,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 81 error locations. [2019-11-16 00:11:49,818 INFO L249 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2019-11-16 00:11:49,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:11:49,838 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-16 00:11:49,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:11:49,839 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:11:49,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:11:49,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:11:49,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:11:49,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:11:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states. [2019-11-16 00:11:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-16 00:11:49,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:11:49,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:11:49,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_insertErr6REQUIRES_VIOLATION, dll_circular_insertErr28REQUIRES_VIOLATION, dll_circular_insertErr27REQUIRES_VIOLATION, dll_circular_insertErr29REQUIRES_VIOLATION, dll_circular_insertErr7REQUIRES_VIOLATION, dll_circular_insertErr8REQUIRES_VIOLATION, dll_circular_insertErr25REQUIRES_VIOLATION, dll_circular_insertErr3REQUIRES_VIOLATION, dll_circular_insertErr4REQUIRES_VIOLATION, dll_circular_insertErr5REQUIRES_VIOLATION, dll_circular_insertErr26REQUIRES_VIOLATION, dll_circular_insertErr33REQUIRES_VIOLATION, dll_circular_insertErr11REQUIRES_VIOLATION, dll_circular_insertErr12REQUIRES_VIOLATION, dll_circular_insertErr13REQUIRES_VIOLATION, dll_circular_insertErr34REQUIRES_VIOLATION, dll_circular_insertErr9REQUIRES_VIOLATION, dll_circular_insertErr30REQUIRES_VIOLATION, dll_circular_insertErr10REQUIRES_VIOLATION, dll_circular_insertErr32REQUIRES_VIOLATION, dll_circular_insertErr31REQUIRES_VIOLATION, dll_circular_insertErr17REQUIRES_VIOLATION, dll_circular_insertErr18REQUIRES_VIOLATION, dll_circular_insertErr14REQUIRES_VIOLATION, dll_circular_insertErr35REQUIRES_VIOLATION, dll_circular_insertErr15REQUIRES_VIOLATION, dll_circular_insertErr16REQUIRES_VIOLATION, dll_circular_insertErr1REQUIRES_VIOLATION, dll_circular_insertErr22REQUIRES_VIOLATION, dll_circular_insertErr2REQUIRES_VIOLATION, dll_circular_insertErr24REQUIRES_VIOLATION, dll_circular_insertErr23REQUIRES_VIOLATION, dll_circular_insertErr19REQUIRES_VIOLATION, dll_circular_insertErr20REQUIRES_VIOLATION, dll_circular_insertErr0REQUIRES_VIOLATION, dll_circular_insertErr21REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr13REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr19REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr18REQUIRES_VIOLATION, mainErr17REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION]=== [2019-11-16 00:11:49,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:11:49,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1463698493, now seen corresponding path program 1 times [2019-11-16 00:11:49,911 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:11:49,912 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2110176534] [2019-11-16 00:11:49,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c5b4e9de-b231-44fb-a504-7086af62d4f9/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-16 00:11:50,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-16 00:11:50,144 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-16 00:11:50,149 INFO L168 Benchmark]: Toolchain (without parser) took 2407.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 938.9 MB in the beginning and 1.0 GB in the end (delta: -104.5 MB). Peak memory consumption was 69.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:50,150 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:11:50,151 INFO L168 Benchmark]: CACSL2BoogieTranslator took 646.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:50,153 INFO L168 Benchmark]: Boogie Preprocessor took 76.27 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-16 00:11:50,154 INFO L168 Benchmark]: RCFGBuilder took 1311.49 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: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:50,155 INFO L168 Benchmark]: TraceAbstraction took 368.83 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: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:11:50,158 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 646.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 938.9 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 76.27 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 1311.49 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: 82.0 MB). Peak memory consumption was 82.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 368.83 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: 11.9 MB). Peak memory consumption was 11.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...