./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0235-1.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_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0235-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/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 b34bc11a33e7949c7dab475214181d5ea8e454c9 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0235-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/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 b34bc11a33e7949c7dab475214181d5ea8e454c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort C_DOUBLE not declared --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:44:37,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:44:37,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:44:37,018 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:44:37,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:44:37,019 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:44:37,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:44:37,022 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:44:37,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:44:37,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:44:37,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:44:37,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:44:37,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:44:37,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:44:37,042 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:44:37,043 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:44:37,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:44:37,045 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:44:37,046 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:44:37,048 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:44:37,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:44:37,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:44:37,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:44:37,052 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:44:37,055 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:44:37,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:44:37,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:44:37,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:44:37,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:44:37,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:44:37,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:44:37,064 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:44:37,066 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:44:37,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:44:37,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:44:37,074 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:44:37,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:44:37,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:44:37,075 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:44:37,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:44:37,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:44:37,081 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 19:44:37,099 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:44:37,100 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:44:37,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:44:37,101 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:44:37,102 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:44:37,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:44:37,102 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:44:37,102 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:44:37,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:44:37,103 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:44:37,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:44:37,103 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 19:44:37,104 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 19:44:37,104 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 19:44:37,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:44:37,104 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:44:37,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:44:37,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:44:37,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:44:37,105 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:44:37,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:44:37,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:44:37,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:44:37,106 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:44:37,107 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:44:37,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:44:37,107 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_2f31c9e9-e1de-4751-a74c-b8c998980760/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 -> b34bc11a33e7949c7dab475214181d5ea8e454c9 [2019-11-15 19:44:37,134 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:44:37,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:44:37,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:44:37,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:44:37,148 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:44:37,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0235-1.i [2019-11-15 19:44:37,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/4e0a0a157/bdcb4de715034c2c8223888fe4444f61/FLAGa1db77169 [2019-11-15 19:44:37,683 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:44:37,683 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/sv-benchmarks/c/memsafety/test-0235-1.i [2019-11-15 19:44:37,700 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/4e0a0a157/bdcb4de715034c2c8223888fe4444f61/FLAGa1db77169 [2019-11-15 19:44:37,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/4e0a0a157/bdcb4de715034c2c8223888fe4444f61 [2019-11-15 19:44:37,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:44:37,944 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 19:44:37,945 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:44:37,946 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:44:37,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:44:37,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:44:37" (1/1) ... [2019-11-15 19:44:37,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55228500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:37, skipping insertion in model container [2019-11-15 19:44:37,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:44:37" (1/1) ... [2019-11-15 19:44:37,958 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:44:38,024 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:44:38,447 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:44:38,455 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:44:38,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:44:38,639 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:44:38,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38 WrapperNode [2019-11-15 19:44:38,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:44:38,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:44:38,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:44:38,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:44:38,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,653 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,711 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,719 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,724 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... [2019-11-15 19:44:38,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:44:38,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:44:38,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:44:38,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:44:38,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:44:38,806 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 19:44:38,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:44:38,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 19:44:38,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 19:44:38,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 19:44:38,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 19:44:38,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 19:44:38,808 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2019-11-15 19:44:38,808 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2019-11-15 19:44:38,808 INFO L138 BoogieDeclarations]: Found implementation of procedure l4_insert [2019-11-15 19:44:38,808 INFO L138 BoogieDeclarations]: Found implementation of procedure l3_insert [2019-11-15 19:44:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure l2_insert [2019-11-15 19:44:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_insert [2019-11-15 19:44:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_insert [2019-11-15 19:44:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure l4_destroy [2019-11-15 19:44:38,809 INFO L138 BoogieDeclarations]: Found implementation of procedure l3_destroy [2019-11-15 19:44:38,810 INFO L138 BoogieDeclarations]: Found implementation of procedure l2_destroy [2019-11-15 19:44:38,810 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_destroy [2019-11-15 19:44:38,810 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2019-11-15 19:44:38,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 19:44:38,811 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-15 19:44:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 19:44:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 19:44:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 19:44:38,811 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 19:44:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 19:44:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 19:44:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 19:44:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 19:44:38,812 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 19:44:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 19:44:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 19:44:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 19:44:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 19:44:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 19:44:38,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 19:44:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 19:44:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 19:44:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 19:44:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 19:44:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 19:44:38,814 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 19:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 19:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 19:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 19:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 19:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 19:44:38,815 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 19:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 19:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 19:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 19:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 19:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 19:44:38,816 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 19:44:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 19:44:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 19:44:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 19:44:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 19:44:38,817 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 19:44:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 19:44:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 19:44:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 19:44:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 19:44:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 19:44:38,818 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 19:44:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 19:44:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 19:44:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 19:44:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 19:44:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 19:44:38,819 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 19:44:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 19:44:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 19:44:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 19:44:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 19:44:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 19:44:38,820 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 19:44:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 19:44:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 19:44:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 19:44:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 19:44:38,821 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 19:44:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 19:44:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 19:44:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 19:44:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 19:44:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 19:44:38,822 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 19:44:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 19:44:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 19:44:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 19:44:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 19:44:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 19:44:38,823 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 19:44:38,824 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 19:44:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 19:44:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 19:44:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 19:44:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 19:44:38,825 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 19:44:38,826 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 19:44:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 19:44:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 19:44:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 19:44:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 19:44:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 19:44:38,827 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 19:44:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 19:44:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 19:44:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 19:44:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 19:44:38,828 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 19:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 19:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 19:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 19:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 19:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 19:44:38,829 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-15 19:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-15 19:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-15 19:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-15 19:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-15 19:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-15 19:44:38,830 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-15 19:44:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-15 19:44:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-15 19:44:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-15 19:44:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-15 19:44:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-15 19:44:38,831 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-15 19:44:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-15 19:44:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-15 19:44:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-15 19:44:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-15 19:44:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-15 19:44:38,832 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-15 19:44:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-15 19:44:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-15 19:44:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-15 19:44:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-15 19:44:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-15 19:44:38,833 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-15 19:44:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-15 19:44:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-15 19:44:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-15 19:44:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-15 19:44:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-15 19:44:38,834 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-15 19:44:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-15 19:44:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-15 19:44:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-15 19:44:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-15 19:44:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-15 19:44:38,835 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-15 19:44:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-15 19:44:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure ffsl [2019-11-15 19:44:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure ffsll [2019-11-15 19:44:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-15 19:44:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-15 19:44:38,836 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp_l [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp_l [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure explicit_bzero [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-15 19:44:38,837 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-15 19:44:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-15 19:44:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2019-11-15 19:44:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:44:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-15 19:44:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 19:44:38,838 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2019-11-15 19:44:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure l4_insert [2019-11-15 19:44:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:44:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:44:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure l3_insert [2019-11-15 19:44:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure l2_insert [2019-11-15 19:44:38,839 INFO L130 BoogieDeclarations]: Found specification of procedure l1_insert [2019-11-15 19:44:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure l0_insert [2019-11-15 19:44:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure l4_destroy [2019-11-15 19:44:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:44:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure l3_destroy [2019-11-15 19:44:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure l2_destroy [2019-11-15 19:44:38,840 INFO L130 BoogieDeclarations]: Found specification of procedure l1_destroy [2019-11-15 19:44:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2019-11-15 19:44:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 19:44:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 19:44:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:44:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 19:44:38,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:44:39,450 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 19:44:39,828 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:44:39,828 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 19:44:39,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:44:39 BoogieIcfgContainer [2019-11-15 19:44:39,830 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:44:39,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:44:39,831 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:44:39,834 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:44:39,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:44:37" (1/3) ... [2019-11-15 19:44:39,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66739630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:44:39, skipping insertion in model container [2019-11-15 19:44:39,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:44:38" (2/3) ... [2019-11-15 19:44:39,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66739630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:44:39, skipping insertion in model container [2019-11-15 19:44:39,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:44:39" (3/3) ... [2019-11-15 19:44:39,837 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0235-1.i [2019-11-15 19:44:39,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:44:39,854 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2019-11-15 19:44:39,866 INFO L249 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2019-11-15 19:44:39,882 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:44:39,883 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 19:44:39,883 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:44:39,883 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:44:39,883 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:44:39,883 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:44:39,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:44:39,884 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:44:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states. [2019-11-15 19:44:39,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 19:44:39,915 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:39,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:39,918 INFO L410 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:44:39,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:39,923 INFO L82 PathProgramCache]: Analyzing trace with hash 274394843, now seen corresponding path program 1 times [2019-11-15 19:44:39,931 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:39,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134153017] [2019-11-15 19:44:39,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:39,932 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:39,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:40,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:40,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134153017] [2019-11-15 19:44:40,088 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:40,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:44:40,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434688322] [2019-11-15 19:44:40,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:40,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:40,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:40,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:40,108 INFO L87 Difference]: Start difference. First operand 266 states. Second operand 3 states. [2019-11-15 19:44:40,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:40,831 INFO L93 Difference]: Finished difference Result 376 states and 433 transitions. [2019-11-15 19:44:40,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:40,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-11-15 19:44:40,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:40,854 INFO L225 Difference]: With dead ends: 376 [2019-11-15 19:44:40,854 INFO L226 Difference]: Without dead ends: 373 [2019-11-15 19:44:40,855 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:40,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-11-15 19:44:40,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 263. [2019-11-15 19:44:40,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-15 19:44:40,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 292 transitions. [2019-11-15 19:44:40,956 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 292 transitions. Word has length 7 [2019-11-15 19:44:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:40,957 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 292 transitions. [2019-11-15 19:44:40,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 292 transitions. [2019-11-15 19:44:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 19:44:40,958 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:40,958 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:40,959 INFO L410 AbstractCegarLoop]: === Iteration 2 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:44:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:40,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1429234381, now seen corresponding path program 1 times [2019-11-15 19:44:40,967 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:40,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891101836] [2019-11-15 19:44:40,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:40,968 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:40,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:40,994 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:44:40,995 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1471413973] [2019-11-15 19:44:40,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:41,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 19:44:41,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:44:41,278 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:44:41,278 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:41,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:41,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:44:41,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-15 19:44:41,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:41,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891101836] [2019-11-15 19:44:41,293 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:44:41,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471413973] [2019-11-15 19:44:41,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:41,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:44:41,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140311994] [2019-11-15 19:44:41,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:44:41,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:41,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:44:41,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:41,296 INFO L87 Difference]: Start difference. First operand 263 states and 292 transitions. Second operand 3 states. [2019-11-15 19:44:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:41,460 INFO L93 Difference]: Finished difference Result 262 states and 291 transitions. [2019-11-15 19:44:41,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:44:41,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-11-15 19:44:41,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:41,462 INFO L225 Difference]: With dead ends: 262 [2019-11-15 19:44:41,463 INFO L226 Difference]: Without dead ends: 262 [2019-11-15 19:44:41,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:44:41,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2019-11-15 19:44:41,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2019-11-15 19:44:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-11-15 19:44:41,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 291 transitions. [2019-11-15 19:44:41,481 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 291 transitions. Word has length 12 [2019-11-15 19:44:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:41,481 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 291 transitions. [2019-11-15 19:44:41,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:44:41,482 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 291 transitions. [2019-11-15 19:44:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-15 19:44:41,482 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:41,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:41,686 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:41,686 INFO L410 AbstractCegarLoop]: === Iteration 3 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:44:41,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:41,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1429234382, now seen corresponding path program 1 times [2019-11-15 19:44:41,687 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:41,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181112960] [2019-11-15 19:44:41,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:41,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:41,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:41,699 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:44:41,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2115578390] [2019-11-15 19:44:41,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:41,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:44:41,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:44:41,919 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-11-15 19:44:41,919 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:41,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:41,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:44:41,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:44:41,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:44:41,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181112960] [2019-11-15 19:44:41,958 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:44:41,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2115578390] [2019-11-15 19:44:41,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:44:41,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:44:41,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216560839] [2019-11-15 19:44:41,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 19:44:41,959 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 19:44:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 19:44:41,960 INFO L87 Difference]: Start difference. First operand 262 states and 291 transitions. Second operand 6 states. [2019-11-15 19:44:42,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:42,196 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2019-11-15 19:44:42,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:44:42,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-15 19:44:42,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:42,199 INFO L225 Difference]: With dead ends: 261 [2019-11-15 19:44:42,199 INFO L226 Difference]: Without dead ends: 261 [2019-11-15 19:44:42,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 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-15 19:44:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2019-11-15 19:44:42,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2019-11-15 19:44:42,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-11-15 19:44:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 290 transitions. [2019-11-15 19:44:42,212 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 290 transitions. Word has length 12 [2019-11-15 19:44:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:42,213 INFO L462 AbstractCegarLoop]: Abstraction has 261 states and 290 transitions. [2019-11-15 19:44:42,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 19:44:42,213 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 290 transitions. [2019-11-15 19:44:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 19:44:42,218 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:42,218 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:42,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:42,423 INFO L410 AbstractCegarLoop]: === Iteration 4 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:44:42,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:42,423 INFO L82 PathProgramCache]: Analyzing trace with hash -869643303, now seen corresponding path program 1 times [2019-11-15 19:44:42,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:42,424 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101037759] [2019-11-15 19:44:42,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:42,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:42,465 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:44:42,465 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826383978] [2019-11-15 19:44:42,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:42,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-15 19:44:42,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:44:42,843 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:44:42,844 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:42,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:42,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:44:42,851 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-15 19:44:42,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:42,941 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:44:42,942 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:42,955 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 19:44:42,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:44:42,956 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-15 19:44:43,023 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 113 proven. 11 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-11-15 19:44:43,023 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101037759] [2019-11-15 19:44:43,023 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:44:43,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826383978] [2019-11-15 19:44:43,024 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:44:43,024 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-11-15 19:44:43,024 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009715752] [2019-11-15 19:44:43,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 19:44:43,025 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:43,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 19:44:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-11-15 19:44:43,030 INFO L87 Difference]: Start difference. First operand 261 states and 290 transitions. Second operand 14 states. [2019-11-15 19:44:44,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:44:44,639 INFO L93 Difference]: Finished difference Result 452 states and 531 transitions. [2019-11-15 19:44:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 19:44:44,639 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 123 [2019-11-15 19:44:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:44:44,644 INFO L225 Difference]: With dead ends: 452 [2019-11-15 19:44:44,644 INFO L226 Difference]: Without dead ends: 452 [2019-11-15 19:44:44,645 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2019-11-15 19:44:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-11-15 19:44:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 259. [2019-11-15 19:44:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-11-15 19:44:44,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 288 transitions. [2019-11-15 19:44:44,660 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 288 transitions. Word has length 123 [2019-11-15 19:44:44,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:44:44,661 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 288 transitions. [2019-11-15 19:44:44,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 19:44:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 288 transitions. [2019-11-15 19:44:44,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-15 19:44:44,663 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:44:44,663 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:44:44,867 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:44,869 INFO L410 AbstractCegarLoop]: === Iteration 5 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:44:44,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:44:44,870 INFO L82 PathProgramCache]: Analyzing trace with hash -869643302, now seen corresponding path program 1 times [2019-11-15 19:44:44,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:44:44,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080965730] [2019-11-15 19:44:44,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:44,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:44:44,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:44:44,893 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:44:44,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160671481] [2019-11-15 19:44:44,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:44:45,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:44:45,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 56 conjunts are in the unsatisfiable core [2019-11-15 19:44:45,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:44:45,177 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 8 treesize of output 7 [2019-11-15 19:44:45,177 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:45,184 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:45,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:44:45,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:44:45,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:44:47,372 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 19:44:48,287 WARN L191 SmtUtils]: Spent 888.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 19:44:48,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:44:48,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:44:48,527 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select |c_#valid| |c_l4_insert_#t~ret5.base|))) (.cse3 (= |c_l4_insert_#t~ret5.offset| 0))) (or (and .cse0 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse2 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse1 (mod .cse2 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse1 0) (= .cse2 (select |c_#length| |c_l4_insert_#t~ret5.base|)) (<= .cse1 2147483647))))) .cse3) (and .cse0 (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse4 (* v_prenex_3 v_prenex_2))) (let ((.cse5 (mod .cse4 4294967296))) (and (= (select |c_#length| |c_l4_insert_#t~ret5.base|) .cse4) (<= 1 v_prenex_3) (<= .cse5 4294967296) (< 2147483647 .cse5) (<= 8 v_prenex_2))))) .cse3))) is different from false [2019-11-15 19:44:48,565 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= 1 (select |c_#valid| c_l4_insert_~item~0.base))) (.cse3 (= 0 c_l4_insert_~item~0.offset))) (or (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse1 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse0 (mod .cse1 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse0 0) (<= .cse0 2147483647) (= .cse1 (select |c_#length| c_l4_insert_~item~0.base)))))) .cse2 .cse3) (and (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse5 (* v_prenex_3 v_prenex_2))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= 1 v_prenex_3) (<= .cse4 4294967296) (< 2147483647 .cse4) (= (select |c_#length| c_l4_insert_~item~0.base) .cse5) (<= 8 v_prenex_2))))) .cse2 .cse3))) is different from false [2019-11-15 19:44:48,732 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 8 treesize of output 7 [2019-11-15 19:44:48,733 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:48,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:48,743 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-15 19:44:48,744 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:48,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:48,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:44:48,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:44:48,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:44:48,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:44:48,808 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 49 treesize of output 51 [2019-11-15 19:44:48,808 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:48,969 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base |calloc_model_#t~malloc2.base|) [2019-11-15 19:44:48,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:44:49,021 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l4_insert_~item~0.base) (* v_prenex_4 v_prenex_5)) [2019-11-15 19:44:49,069 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l4_insert_~item~0.base) (* v_prenex_4 v_prenex_5)) [2019-11-15 19:44:49,115 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| |calloc_model_#t~malloc2.base|) (* v_prenex_4 v_prenex_5)) [2019-11-15 19:44:49,163 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| |calloc_model_#t~malloc2.base|) (* v_prenex_4 v_prenex_5)) [2019-11-15 19:44:49,164 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 49 treesize of output 51 [2019-11-15 19:44:49,165 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:50,414 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 42 DAG size of output: 40 [2019-11-15 19:44:50,414 INFO L567 ElimStorePlain]: treesize reduction 14, result has 85.6 percent of original size [2019-11-15 19:44:50,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:50,427 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 41 treesize of output 45 [2019-11-15 19:44:50,428 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:50,542 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base |calloc_model_#t~malloc2.base|) [2019-11-15 19:44:50,595 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l4_insert_~item~0.base |calloc_model_#t~malloc2.base|) [2019-11-15 19:44:50,595 INFO L235 Elim1Store]: Index analysis took 103 ms [2019-11-15 19:44:50,599 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:50,599 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 41 treesize of output 45 [2019-11-15 19:44:50,600 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:44:51,346 WARN L191 SmtUtils]: Spent 746.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 19:44:51,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:44:51,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-11-15 19:44:51,348 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:99, output treesize:71 [2019-11-15 19:44:51,382 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 c_l4_insert_~item~0.offset))) (or (and .cse0 (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse1 (* v_prenex_3 v_prenex_2))) (and (<= 1 v_prenex_3) (< 2147483647 (mod .cse1 4294967296)) (= (select |c_#length| c_l4_insert_~item~0.base) .cse1) (<= 8 v_prenex_2)))) (exists ((v_prenex_6 Int) (v_prenex_7 Int) (v_prenex_8 Int)) (and (not (= c_l4_insert_~item~0.base v_prenex_6)) (= (select |c_#length| v_prenex_6) (* v_prenex_7 v_prenex_8))))) (and .cse0 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse2 (* calloc_model_~nmemb calloc_model_~size))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= (mod .cse2 4294967296) 0) (= .cse2 (select |c_#length| c_l4_insert_~item~0.base))))) (exists ((|calloc_model_#t~malloc2.base| Int) (v_prenex_4 Int) (v_prenex_5 Int)) (and (not (= c_l4_insert_~item~0.base |calloc_model_#t~malloc2.base|)) (= (select |c_#length| |calloc_model_#t~malloc2.base|) (* v_prenex_4 v_prenex_5))))))) is different from false [2019-11-15 19:44:51,423 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 98 proven. 13 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-15 19:44:51,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080965730] [2019-11-15 19:44:51,423 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:44:51,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160671481] [2019-11-15 19:44:51,424 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:44:51,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-11-15 19:44:51,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757869283] [2019-11-15 19:44:51,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-15 19:44:51,425 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:44:51,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-15 19:44:51,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=158, Unknown=3, NotChecked=78, Total=272 [2019-11-15 19:44:51,426 INFO L87 Difference]: Start difference. First operand 259 states and 288 transitions. Second operand 17 states. [2019-11-15 19:45:08,443 WARN L191 SmtUtils]: Spent 16.59 s on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-11-15 19:45:08,680 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-15 19:45:08,969 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 19:45:09,243 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-15 19:45:11,860 WARN L191 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 66 [2019-11-15 19:45:13,699 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-15 19:45:13,747 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|calloc_model_#t~malloc2.base| Int) (calloc_model_~size Int) (calloc_model_~nmemb Int)) (and (= (store |c_old(#length)| |calloc_model_#t~malloc2.base| (* calloc_model_~size calloc_model_~nmemb)) |c_#length|) (= (select |c_old(#valid)| |calloc_model_#t~malloc2.base|) 0))) (let ((.cse2 (= 1 (select |c_#valid| c_l4_insert_~item~0.base))) (.cse3 (= 0 c_l4_insert_~item~0.offset))) (or (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse1 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse0 (mod .cse1 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse0 0) (<= .cse0 2147483647) (= .cse1 (select |c_#length| c_l4_insert_~item~0.base)))))) .cse2 .cse3) (and (exists ((v_prenex_2 Int) (v_prenex_3 Int)) (let ((.cse5 (* v_prenex_3 v_prenex_2))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= 1 v_prenex_3) (<= .cse4 4294967296) (< 2147483647 .cse4) (= (select |c_#length| c_l4_insert_~item~0.base) .cse5) (<= 8 v_prenex_2))))) .cse2 .cse3)))) is different from false [2019-11-15 19:45:15,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:15,977 INFO L93 Difference]: Finished difference Result 385 states and 453 transitions. [2019-11-15 19:45:15,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 19:45:15,978 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 123 [2019-11-15 19:45:15,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:15,981 INFO L225 Difference]: With dead ends: 385 [2019-11-15 19:45:15,981 INFO L226 Difference]: Without dead ends: 385 [2019-11-15 19:45:15,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 23.8s TimeCoverageRelationStatistics Valid=98, Invalid=550, Unknown=18, NotChecked=204, Total=870 [2019-11-15 19:45:15,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-11-15 19:45:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 272. [2019-11-15 19:45:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-15 19:45:15,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 309 transitions. [2019-11-15 19:45:15,995 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 309 transitions. Word has length 123 [2019-11-15 19:45:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:15,995 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 309 transitions. [2019-11-15 19:45:15,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-15 19:45:15,996 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 309 transitions. [2019-11-15 19:45:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-15 19:45:15,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:15,998 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:16,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:16,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:45:16,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:16,203 INFO L82 PathProgramCache]: Analyzing trace with hash -97286873, now seen corresponding path program 1 times [2019-11-15 19:45:16,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:16,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400845294] [2019-11-15 19:45:16,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:16,203 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:16,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:16,218 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:45:16,219 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713277769] [2019-11-15 19:45:16,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:16,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:45:16,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 60 conjunts are in the unsatisfiable core [2019-11-15 19:45:16,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:16,469 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 8 treesize of output 7 [2019-11-15 19:45:16,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:16,478 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:16,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:45:16,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:45:16,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:16,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:16,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:45:16,935 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-15 19:45:16,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:16,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:16,938 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 8 treesize of output 7 [2019-11-15 19:45:16,938 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:16,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:16,940 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:16,941 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:45:16,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:16,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:45:16,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:17,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:17,010 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:17,010 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:45:17,011 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:17,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:17,040 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:17,040 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:49, output treesize:42 [2019-11-15 19:45:21,089 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-11-15 19:45:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 102 proven. 15 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-11-15 19:45:21,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400845294] [2019-11-15 19:45:21,109 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:45:21,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713277769] [2019-11-15 19:45:21,109 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:45:21,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-11-15 19:45:21,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260883608] [2019-11-15 19:45:21,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 19:45:21,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:45:21,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 19:45:21,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=269, Unknown=1, NotChecked=0, Total=306 [2019-11-15 19:45:21,111 INFO L87 Difference]: Start difference. First operand 272 states and 309 transitions. Second operand 18 states. [2019-11-15 19:45:22,519 WARN L191 SmtUtils]: Spent 943.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 19:45:38,972 WARN L191 SmtUtils]: Spent 13.22 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 19:45:54,699 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 24 [2019-11-15 19:45:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:45:57,116 INFO L93 Difference]: Finished difference Result 410 states and 490 transitions. [2019-11-15 19:45:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 19:45:57,117 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 124 [2019-11-15 19:45:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:45:57,120 INFO L225 Difference]: With dead ends: 410 [2019-11-15 19:45:57,120 INFO L226 Difference]: Without dead ends: 410 [2019-11-15 19:45:57,121 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=118, Invalid=935, Unknown=3, NotChecked=0, Total=1056 [2019-11-15 19:45:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2019-11-15 19:45:57,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 288. [2019-11-15 19:45:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-15 19:45:57,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2019-11-15 19:45:57,134 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 124 [2019-11-15 19:45:57,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:45:57,135 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2019-11-15 19:45:57,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 19:45:57,135 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2019-11-15 19:45:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-11-15 19:45:57,138 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:45:57,138 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:45:57,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:57,342 INFO L410 AbstractCegarLoop]: === Iteration 7 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:45:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:45:57,343 INFO L82 PathProgramCache]: Analyzing trace with hash 440068254, now seen corresponding path program 2 times [2019-11-15 19:45:57,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:45:57,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688452285] [2019-11-15 19:45:57,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:57,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:45:57,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:45:57,361 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:45:57,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2092121190] [2019-11-15 19:45:57,368 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:45:57,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:45:57,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:45:57,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-15 19:45:57,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:45:57,634 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 8 treesize of output 7 [2019-11-15 19:45:57,634 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,658 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:45:57,658 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:22 [2019-11-15 19:45:57,876 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 8 treesize of output 7 [2019-11-15 19:45:57,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,882 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-15 19:45:57,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:45:57,908 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:45:57,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:45:57,909 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-15 19:45:57,931 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:45:57,941 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:45:57,942 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:45:57,942 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:35, output treesize:28 [2019-11-15 19:45:59,982 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2019-11-15 19:46:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 119 proven. 19 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-11-15 19:46:00,005 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688452285] [2019-11-15 19:46:00,006 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:46:00,006 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092121190] [2019-11-15 19:46:00,006 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:46:00,006 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-11-15 19:46:00,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802655242] [2019-11-15 19:46:00,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 19:46:00,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:00,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 19:46:00,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-15 19:46:00,007 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand 14 states. [2019-11-15 19:46:04,253 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-15 19:46:06,367 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 19:46:08,417 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-15 19:46:12,679 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-15 19:46:18,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:18,833 INFO L93 Difference]: Finished difference Result 490 states and 589 transitions. [2019-11-15 19:46:18,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 19:46:18,833 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 129 [2019-11-15 19:46:18,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:18,837 INFO L225 Difference]: With dead ends: 490 [2019-11-15 19:46:18,837 INFO L226 Difference]: Without dead ends: 490 [2019-11-15 19:46:18,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=103, Invalid=497, Unknown=0, NotChecked=0, Total=600 [2019-11-15 19:46:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-11-15 19:46:18,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 257. [2019-11-15 19:46:18,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-11-15 19:46:18,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 286 transitions. [2019-11-15 19:46:18,875 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 286 transitions. Word has length 129 [2019-11-15 19:46:18,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:18,876 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 286 transitions. [2019-11-15 19:46:18,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 19:46:18,876 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 286 transitions. [2019-11-15 19:46:18,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 19:46:18,878 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:18,878 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:19,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:19,079 INFO L410 AbstractCegarLoop]: === Iteration 8 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:46:19,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:19,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1791420762, now seen corresponding path program 1 times [2019-11-15 19:46:19,079 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:19,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329204436] [2019-11-15 19:46:19,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:19,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:19,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:19,094 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:46:19,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1020919361] [2019-11-15 19:46:19,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:19,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-15 19:46:19,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:19,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:46:19,407 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,409 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:19,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2019-11-15 19:46:19,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2019-11-15 19:46:19,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,512 INFO L567 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-15 19:46:19,513 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-11-15 19:46:19,576 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:46:19,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:19,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2019-11-15 19:46:19,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:19,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 58 [2019-11-15 19:46:19,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:19,659 INFO L567 ElimStorePlain]: treesize reduction 28, result has 36.4 percent of original size [2019-11-15 19:46:19,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:19,660 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:16 [2019-11-15 19:46:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-15 19:46:19,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329204436] [2019-11-15 19:46:19,704 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:46:19,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020919361] [2019-11-15 19:46:19,704 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:46:19,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-15 19:46:19,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451720264] [2019-11-15 19:46:19,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 19:46:19,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:19,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 19:46:19,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:46:19,706 INFO L87 Difference]: Start difference. First operand 257 states and 286 transitions. Second operand 22 states. [2019-11-15 19:46:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:46:21,295 INFO L93 Difference]: Finished difference Result 447 states and 526 transitions. [2019-11-15 19:46:21,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 19:46:21,296 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 125 [2019-11-15 19:46:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:46:21,298 INFO L225 Difference]: With dead ends: 447 [2019-11-15 19:46:21,299 INFO L226 Difference]: Without dead ends: 447 [2019-11-15 19:46:21,299 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2019-11-15 19:46:21,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-11-15 19:46:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 254. [2019-11-15 19:46:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-11-15 19:46:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 283 transitions. [2019-11-15 19:46:21,318 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 283 transitions. Word has length 125 [2019-11-15 19:46:21,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:46:21,319 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 283 transitions. [2019-11-15 19:46:21,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 19:46:21,319 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 283 transitions. [2019-11-15 19:46:21,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 19:46:21,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:46:21,321 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:46:21,530 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:21,530 INFO L410 AbstractCegarLoop]: === Iteration 9 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:46:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:46:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1791420763, now seen corresponding path program 1 times [2019-11-15 19:46:21,531 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:46:21,531 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96105464] [2019-11-15 19:46:21,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:21,531 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:46:21,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:46:21,544 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:46:21,544 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1843873179] [2019-11-15 19:46:21,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:46:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:46:21,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 86 conjunts are in the unsatisfiable core [2019-11-15 19:46:21,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:46:21,803 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 8 treesize of output 7 [2019-11-15 19:46:21,803 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,813 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:21,813 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:46:21,813 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:46:21,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:26,131 WARN L191 SmtUtils]: Spent 4.25 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 19:46:29,269 WARN L191 SmtUtils]: Spent 3.12 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 19:46:29,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,534 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 19:46:29,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:29,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_l3_insert_#t~ret8.base|) 1)) (.cse1 (= |c_l3_insert_#t~ret8.offset| 0))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse2 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse3 (mod .cse2 4294967296))) (and (<= 8 calloc_model_~size) (= .cse2 (select |c_#length| |c_l3_insert_#t~ret8.base|)) (<= 1 calloc_model_~nmemb) (<= .cse3 0) (<= .cse3 2147483647)))))) (and .cse0 (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse5 (* v_prenex_16 v_prenex_15))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (<= .cse4 4294967296) (< 2147483647 .cse4) (= (select |c_#length| |c_l3_insert_#t~ret8.base|) .cse5))))) .cse1))) is different from false [2019-11-15 19:46:29,678 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 c_l3_insert_~item~1.offset)) (.cse3 (= 1 (select |c_#valid| c_l3_insert_~item~1.base)))) (or (and .cse0 (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse2 (* v_prenex_16 v_prenex_15))) (let ((.cse1 (mod .cse2 4294967296))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (<= .cse1 4294967296) (< 2147483647 .cse1) (= (select |c_#length| c_l3_insert_~item~1.base) .cse2))))) .cse3) (and .cse0 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse5 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse4 0) (= .cse5 (select |c_#length| c_l3_insert_~item~1.base)) (<= .cse4 2147483647))))) .cse3))) is different from false [2019-11-15 19:46:29,706 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 1 (select |c_#valid| |c_l4_insert_#in~list.base|))) (.cse3 (= 0 |c_l4_insert_#in~list.offset|))) (or (and .cse0 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse1 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse2 (mod .cse1 4294967296))) (and (<= 8 calloc_model_~size) (= .cse1 (select |c_#length| |c_l4_insert_#in~list.base|)) (<= 1 calloc_model_~nmemb) (<= .cse2 0) (<= .cse2 2147483647))))) .cse3) (and .cse0 .cse3 (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse5 (* v_prenex_16 v_prenex_15))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (<= .cse4 4294967296) (< 2147483647 .cse4) (= (select |c_#length| |c_l4_insert_#in~list.base|) .cse5)))))))) is different from false [2019-11-15 19:46:30,070 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 19:46:30,210 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_8|], 1=[|v_old(#valid)_BEFORE_CALL_14|]} [2019-11-15 19:46:30,212 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 8 treesize of output 7 [2019-11-15 19:46:30,212 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:30,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:30,224 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:46:30,224 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:30,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:30,229 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:30,229 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:46:30,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:30,363 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_78|], 3=[|v_old(#valid)_AFTER_CALL_78|]} [2019-11-15 19:46:30,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:30,388 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 60 treesize of output 62 [2019-11-15 19:46:30,388 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:30,546 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~list.base calloc_model_~ptr~0.base) [2019-11-15 19:46:30,547 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:30,596 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l4_insert_~list.base)) [2019-11-15 19:46:30,644 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l4_insert_~list.base)) [2019-11-15 19:46:30,689 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:46:30,737 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:46:30,737 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 60 treesize of output 62 [2019-11-15 19:46:30,738 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:31,944 WARN L191 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-15 19:46:31,944 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.8 percent of original size [2019-11-15 19:46:31,975 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:31,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 19:46:31,976 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:32,030 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l4_insert_~list.base calloc_model_~ptr~0.base) [2019-11-15 19:46:32,081 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#valid| l4_insert_~list.base) 1) [2019-11-15 19:46:32,135 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#valid| l4_insert_~list.base) 1) [2019-11-15 19:46:32,185 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |#valid| calloc_model_~ptr~0.base)) [2019-11-15 19:46:32,243 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |#valid| calloc_model_~ptr~0.base)) [2019-11-15 19:46:32,254 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:32,255 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 19:46:32,255 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:33,479 WARN L191 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-15 19:46:33,480 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.5 percent of original size [2019-11-15 19:46:33,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-11-15 19:46:33,481 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:121, output treesize:91 [2019-11-15 19:46:33,507 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| c_l4_insert_~list.base) 1)) (.cse2 (= c_l4_insert_~list.offset 0))) (or (and (exists ((v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (and (= 1 (select |c_#valid| v_prenex_21)) (= (* v_prenex_19 v_prenex_20) (select |c_#length| v_prenex_21)) (not (= c_l4_insert_~list.base v_prenex_21)))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse0 (* v_prenex_18 v_prenex_17))) (and (<= (mod .cse0 4294967296) 0) (<= 8 v_prenex_17) (= .cse0 (select |c_#length| c_l4_insert_~list.base)) (<= 1 v_prenex_18)))) .cse1 .cse2) (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse3 (* v_prenex_16 v_prenex_15))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (< 2147483647 (mod .cse3 4294967296)) (= .cse3 (select |c_#length| c_l4_insert_~list.base))))) (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| calloc_model_~ptr~0.base)) (= 1 (select |c_#valid| calloc_model_~ptr~0.base)) (not (= c_l4_insert_~list.base calloc_model_~ptr~0.base)))) .cse1 .cse2))) is different from false [2019-11-15 19:46:33,631 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 8 treesize of output 7 [2019-11-15 19:46:33,631 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:33,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:33,641 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-15 19:46:33,641 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:33,644 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:33,644 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:46:33,645 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:46:33,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:46:33,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:33,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:33,699 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 63 [2019-11-15 19:46:33,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:33,949 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~list.base |calloc_model_#t~malloc2.base|) [2019-11-15 19:46:33,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:34,032 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |calloc_model_#t~malloc2.base| v_prenex_21) [2019-11-15 19:46:34,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:46:34,034 INFO L235 Elim1Store]: Index analysis took 165 ms [2019-11-15 19:46:34,115 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l4_insert_~list.base) (* v_prenex_22 v_prenex_23)) [2019-11-15 19:46:34,185 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l4_insert_~list.base) (* v_prenex_22 v_prenex_23)) [2019-11-15 19:46:34,237 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| v_prenex_21) (* v_prenex_22 v_prenex_23)) [2019-11-15 19:46:34,291 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| v_prenex_21) (* v_prenex_22 v_prenex_23)) [2019-11-15 19:46:34,340 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| |calloc_model_#t~malloc2.base|) (* v_prenex_22 v_prenex_23)) [2019-11-15 19:46:34,391 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| |calloc_model_#t~malloc2.base|) (* v_prenex_22 v_prenex_23)) [2019-11-15 19:46:34,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 63 [2019-11-15 19:46:34,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,361 WARN L191 SmtUtils]: Spent 967.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 19:46:35,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,384 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,384 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 67 [2019-11-15 19:46:35,384 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:35,552 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~list.base |calloc_model_#t~malloc2.base|) [2019-11-15 19:46:35,606 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l4_insert_~list.base |calloc_model_#t~malloc2.base|) [2019-11-15 19:46:35,660 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |calloc_model_#t~malloc2.base| v_prenex_21) [2019-11-15 19:46:35,713 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= |calloc_model_#t~malloc2.base| v_prenex_21) [2019-11-15 19:46:35,713 INFO L235 Elim1Store]: Index analysis took 218 ms [2019-11-15 19:46:35,731 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:35,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 67 [2019-11-15 19:46:35,731 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:46:36,881 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 57 [2019-11-15 19:46:36,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:46:36,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 2 dim-1 vars, End of recursive call: 16 dim-0 vars, and 2 xjuncts. [2019-11-15 19:46:36,882 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 15 variables, input treesize:117, output treesize:101 [2019-11-15 19:46:39,370 WARN L191 SmtUtils]: Spent 2.32 s on a formula simplification that was a NOOP. DAG size: 73 [2019-11-15 19:46:39,463 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 125 proven. 38 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 19:46:39,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96105464] [2019-11-15 19:46:39,464 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:46:39,464 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843873179] [2019-11-15 19:46:39,464 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:46:39,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-11-15 19:46:39,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337168982] [2019-11-15 19:46:39,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 19:46:39,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:46:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 19:46:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=277, Unknown=22, NotChecked=148, Total=506 [2019-11-15 19:46:39,466 INFO L87 Difference]: Start difference. First operand 254 states and 283 transitions. Second operand 23 states. [2019-11-15 19:46:40,633 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 0 c_calloc_model_~ptr~0.offset))) (and .cse0 (= (store |c_old(#valid)| c_calloc_model_~ptr~0.base 1) |c_#valid|) (<= |c_calloc_model_#in~nmemb| c_calloc_model_~nmemb) (= 0 (select |c_old(#valid)| c_calloc_model_~ptr~0.base)) (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (= (store |c_old(#length)| c_calloc_model_~ptr~0.base (* calloc_model_~size calloc_model_~nmemb)) |c_#length|)) (<= |c_calloc_model_#in~size| c_calloc_model_~size) (let ((.cse1 (= 1 (select |c_#valid| c_calloc_model_~ptr~0.base)))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse3 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse2 (mod .cse3 4294967296))) (and (<= |c_calloc_model_#in~nmemb| calloc_model_~nmemb) (<= .cse2 0) (<= |c_calloc_model_#in~size| calloc_model_~size) (<= .cse2 2147483647) (= .cse3 (select |c_#length| c_calloc_model_~ptr~0.base))))))) (and .cse0 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse5 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= |c_calloc_model_#in~nmemb| calloc_model_~nmemb) (<= |c_calloc_model_#in~size| calloc_model_~size) (<= .cse4 4294967296) (< 2147483647 .cse4) (= .cse5 (select |c_#length| c_calloc_model_~ptr~0.base)))))) .cse1))) (= (* c_calloc_model_~nmemb c_calloc_model_~size) (select |c_#length| c_calloc_model_~ptr~0.base)))) is different from false [2019-11-15 19:46:41,477 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 19:46:43,853 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-15 19:46:44,130 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 19:46:45,159 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-15 19:46:46,960 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 19:46:47,526 WARN L191 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-15 19:46:47,568 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (= (select |c_#valid| c_l4_insert_~list.base) 1)) (.cse3 (= c_l4_insert_~list.offset 0))) (or (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse1 (* v_prenex_16 v_prenex_15))) (let ((.cse0 (mod .cse1 4294967296))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (<= .cse0 4294967296) (< 2147483647 .cse0) (= .cse1 (select |c_#length| c_l4_insert_~list.base)))))) .cse2 .cse3) (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse4 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse5 (mod .cse4 4294967296))) (and (<= 8 calloc_model_~size) (= .cse4 (select |c_#length| c_l4_insert_~list.base)) (<= 1 calloc_model_~nmemb) (<= .cse5 0) (<= .cse5 2147483647))))) .cse2 .cse3))) (= |c_#valid| |c_old(#valid)|) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-15 19:46:49,953 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_l4_insert_~list.offset 0))) (and (let ((.cse2 (= (select |c_#valid| c_l4_insert_~list.base) 1))) (or (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse1 (* v_prenex_16 v_prenex_15))) (let ((.cse0 (mod .cse1 4294967296))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (<= .cse0 4294967296) (< 2147483647 .cse0) (= .cse1 (select |c_#length| c_l4_insert_~list.base)))))) .cse2 .cse3) (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse4 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse5 (mod .cse4 4294967296))) (and (<= 8 calloc_model_~size) (= .cse4 (select |c_#length| c_l4_insert_~list.base)) (<= 1 calloc_model_~nmemb) (<= .cse5 0) (<= .cse5 2147483647))))) .cse2 .cse3))) (or (and (exists ((v_prenex_26 Int) (v_prenex_25 Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_prenex_20 Int) (v_prenex_19 Int)) (and (not (= c_l4_insert_~list.base v_prenex_24)) (= (select |c_#length| v_prenex_24) (* v_prenex_26 v_prenex_25)) (= (* v_prenex_19 v_prenex_20) (select |c_#length| v_prenex_21)) (not (= v_prenex_24 v_prenex_21)) (not (= c_l4_insert_~list.base v_prenex_21)))) (exists ((v_prenex_18 Int) (v_prenex_17 Int)) (let ((.cse6 (* v_prenex_18 v_prenex_17))) (and (<= (mod .cse6 4294967296) 0) (<= 8 v_prenex_17) (= .cse6 (select |c_#length| c_l4_insert_~list.base)) (<= 1 v_prenex_18)))) .cse3) (and (exists ((v_prenex_16 Int) (v_prenex_15 Int)) (let ((.cse7 (* v_prenex_16 v_prenex_15))) (and (<= 1 v_prenex_16) (<= 8 v_prenex_15) (< 2147483647 (mod .cse7 4294967296)) (= .cse7 (select |c_#length| c_l4_insert_~list.base))))) (exists ((|calloc_model_#t~malloc2.base| Int) (calloc_model_~size Int) (v_prenex_23 Int) (v_prenex_22 Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (not (= |calloc_model_#t~malloc2.base| calloc_model_~ptr~0.base)) (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| calloc_model_~ptr~0.base)) (= (select |c_#length| |calloc_model_#t~malloc2.base|) (* v_prenex_22 v_prenex_23)) (not (= c_l4_insert_~list.base |calloc_model_#t~malloc2.base|)) (not (= c_l4_insert_~list.base calloc_model_~ptr~0.base)))) .cse3)))) is different from false [2019-11-15 19:47:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:47:01,618 INFO L93 Difference]: Finished difference Result 515 states and 623 transitions. [2019-11-15 19:47:01,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 19:47:01,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 125 [2019-11-15 19:47:01,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:47:01,622 INFO L225 Difference]: With dead ends: 515 [2019-11-15 19:47:01,622 INFO L226 Difference]: Without dead ends: 515 [2019-11-15 19:47:01,623 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=174, Invalid=996, Unknown=48, NotChecked=504, Total=1722 [2019-11-15 19:47:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-15 19:47:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 273. [2019-11-15 19:47:01,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-15 19:47:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 313 transitions. [2019-11-15 19:47:01,637 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 313 transitions. Word has length 125 [2019-11-15 19:47:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:47:01,638 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 313 transitions. [2019-11-15 19:47:01,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 19:47:01,638 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 313 transitions. [2019-11-15 19:47:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-11-15 19:47:01,640 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:47:01,640 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:47:01,853 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:01,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:47:01,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:47:01,854 INFO L82 PathProgramCache]: Analyzing trace with hash 2094503534, now seen corresponding path program 1 times [2019-11-15 19:47:01,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:47:01,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46170636] [2019-11-15 19:47:01,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:01,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:01,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:47:01,868 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:47:01,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [585197246] [2019-11-15 19:47:01,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:47:02,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 106 conjunts are in the unsatisfiable core [2019-11-15 19:47:02,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:47:02,106 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 8 treesize of output 7 [2019-11-15 19:47:02,106 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:02,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:02,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:47:02,113 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:47:02,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:02,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:02,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:47:02,846 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_12|], 1=[|v_old(#valid)_BEFORE_CALL_18|]} [2019-11-15 19:47:02,849 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 8 treesize of output 7 [2019-11-15 19:47:02,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:02,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:02,861 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:47:02,861 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:02,866 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:02,867 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:02,867 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:47:03,263 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_26|], 3=[|v_#valid_BEFORE_CALL_39|]} [2019-11-15 19:47:03,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:03,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:47:03,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:03,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:03,348 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:03,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:47:03,349 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:03,502 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-11-15 19:47:03,502 INFO L567 ElimStorePlain]: treesize reduction 14, result has 78.8 percent of original size [2019-11-15 19:47:03,503 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:03,503 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:55, output treesize:52 [2019-11-15 19:47:03,850 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-15 19:47:03,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:03,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:03,856 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 8 treesize of output 7 [2019-11-15 19:47:03,856 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:03,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:03,908 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:03,908 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:47:03,997 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_93|], 3=[|v_#valid_BEFORE_CALL_43|]} [2019-11-15 19:47:04,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:04,004 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 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:47:04,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:04,119 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-15 19:47:04,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:04,146 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:04,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 19:47:04,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:04,180 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:04,181 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:04,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:58, output treesize:42 [2019-11-15 19:47:04,825 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-11-15 19:47:04,864 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 128 proven. 41 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-15 19:47:04,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46170636] [2019-11-15 19:47:04,864 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:47:04,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585197246] [2019-11-15 19:47:04,865 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:47:04,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-11-15 19:47:04,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350312236] [2019-11-15 19:47:04,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 19:47:04,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:47:04,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 19:47:04,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2019-11-15 19:47:04,866 INFO L87 Difference]: Start difference. First operand 273 states and 313 transitions. Second operand 29 states. [2019-11-15 19:47:05,785 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-15 19:47:17,247 WARN L191 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-15 19:47:20,286 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 19:47:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:47:54,395 INFO L93 Difference]: Finished difference Result 543 states and 664 transitions. [2019-11-15 19:47:54,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-15 19:47:54,396 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 126 [2019-11-15 19:47:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:47:54,405 INFO L225 Difference]: With dead ends: 543 [2019-11-15 19:47:54,405 INFO L226 Difference]: Without dead ends: 543 [2019-11-15 19:47:54,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=301, Invalid=2561, Unknown=0, NotChecked=0, Total=2862 [2019-11-15 19:47:54,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2019-11-15 19:47:54,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 297. [2019-11-15 19:47:54,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-11-15 19:47:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 351 transitions. [2019-11-15 19:47:54,425 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 351 transitions. Word has length 126 [2019-11-15 19:47:54,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:47:54,426 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 351 transitions. [2019-11-15 19:47:54,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 19:47:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 351 transitions. [2019-11-15 19:47:54,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-15 19:47:54,429 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:47:54,429 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:47:54,634 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:54,635 INFO L410 AbstractCegarLoop]: === Iteration 11 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:47:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:47:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1394832453, now seen corresponding path program 2 times [2019-11-15 19:47:54,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:47:54,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961038163] [2019-11-15 19:47:54,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:54,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:47:54,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:47:54,660 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:47:54,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1854493042] [2019-11-15 19:47:54,670 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:47:54,937 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:47:54,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:47:54,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 74 conjunts are in the unsatisfiable core [2019-11-15 19:47:54,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:47:54,961 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 8 treesize of output 7 [2019-11-15 19:47:54,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:54,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:54,975 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:47:54,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:54,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:54,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:54,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:22 [2019-11-15 19:47:55,295 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_16|], 1=[|v_old(#valid)_BEFORE_CALL_22|]} [2019-11-15 19:47:55,297 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 8 treesize of output 7 [2019-11-15 19:47:55,298 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,308 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:47:55,308 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,313 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,313 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:55,314 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:47:55,372 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_35|], 3=[|v_#valid_BEFORE_CALL_48|]} [2019-11-15 19:47:55,376 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:55,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:47:55,377 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:47:55,417 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,464 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-11-15 19:47:55,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:55,465 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:41, output treesize:38 [2019-11-15 19:47:55,554 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-15 19:47:55,554 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,556 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,560 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 8 treesize of output 7 [2019-11-15 19:47:55,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,562 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:55,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:47:55,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:55,579 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:47:55,579 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2019-11-15 19:47:55,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,639 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,639 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-15 19:47:55,640 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:47:55,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:47:55,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-15 19:47:55,669 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:51, output treesize:43 [2019-11-15 19:48:01,729 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 19:48:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 133 proven. 38 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-11-15 19:48:01,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961038163] [2019-11-15 19:48:01,775 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:48:01,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854493042] [2019-11-15 19:48:01,775 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:48:01,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-11-15 19:48:01,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054227538] [2019-11-15 19:48:01,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 19:48:01,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:48:01,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 19:48:01,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=258, Unknown=2, NotChecked=0, Total=306 [2019-11-15 19:48:01,776 INFO L87 Difference]: Start difference. First operand 297 states and 351 transitions. Second operand 18 states. [2019-11-15 19:48:03,155 WARN L191 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-15 19:48:05,242 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 19:48:09,305 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 43 [2019-11-15 19:48:23,788 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 56 [2019-11-15 19:48:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:29,188 INFO L93 Difference]: Finished difference Result 495 states and 600 transitions. [2019-11-15 19:48:29,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 19:48:29,189 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 127 [2019-11-15 19:48:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:29,192 INFO L225 Difference]: With dead ends: 495 [2019-11-15 19:48:29,192 INFO L226 Difference]: Without dead ends: 495 [2019-11-15 19:48:29,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=147, Invalid=840, Unknown=5, NotChecked=0, Total=992 [2019-11-15 19:48:29,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-11-15 19:48:29,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 251. [2019-11-15 19:48:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-11-15 19:48:29,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 280 transitions. [2019-11-15 19:48:29,205 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 280 transitions. Word has length 127 [2019-11-15 19:48:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:29,207 INFO L462 AbstractCegarLoop]: Abstraction has 251 states and 280 transitions. [2019-11-15 19:48:29,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 19:48:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 280 transitions. [2019-11-15 19:48:29,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 19:48:29,210 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:29,210 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:29,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:48:29,414 INFO L410 AbstractCegarLoop]: === Iteration 12 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:48:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:29,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1628820300, now seen corresponding path program 1 times [2019-11-15 19:48:29,415 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:48:29,415 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917589115] [2019-11-15 19:48:29,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:29,415 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:29,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:48:29,427 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:48:29,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [612107786] [2019-11-15 19:48:29,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:48:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:29,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 64 conjunts are in the unsatisfiable core [2019-11-15 19:48:29,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:29,812 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:48:29,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:29,814 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:29,814 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:29,814 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-15 19:48:29,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:29,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:48:29,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:29,890 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 19:48:29,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:29,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-15 19:48:29,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:48:29,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:29,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:29,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:29,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2019-11-15 19:48:30,121 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:48:30,121 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:30,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:30,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:30,123 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2019-11-15 19:48:30,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:48:30,339 INFO L341 Elim1Store]: treesize reduction 6, result has 91.5 percent of original size [2019-11-15 19:48:30,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 76 [2019-11-15 19:48:30,340 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:30,369 INFO L567 ElimStorePlain]: treesize reduction 54, result has 31.6 percent of original size [2019-11-15 19:48:30,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:30,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:25 [2019-11-15 19:48:30,410 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 140 proven. 50 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 19:48:30,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917589115] [2019-11-15 19:48:30,410 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:48:30,410 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612107786] [2019-11-15 19:48:30,410 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:48:30,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-11-15 19:48:30,411 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15830619] [2019-11-15 19:48:30,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 19:48:30,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:48:30,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 19:48:30,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2019-11-15 19:48:30,412 INFO L87 Difference]: Start difference. First operand 251 states and 280 transitions. Second operand 27 states. [2019-11-15 19:48:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:48:32,670 INFO L93 Difference]: Finished difference Result 441 states and 520 transitions. [2019-11-15 19:48:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 19:48:32,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 133 [2019-11-15 19:48:32,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:48:32,673 INFO L225 Difference]: With dead ends: 441 [2019-11-15 19:48:32,673 INFO L226 Difference]: Without dead ends: 441 [2019-11-15 19:48:32,674 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=1421, Unknown=0, NotChecked=0, Total=1640 [2019-11-15 19:48:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-11-15 19:48:32,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 248. [2019-11-15 19:48:32,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-11-15 19:48:32,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 277 transitions. [2019-11-15 19:48:32,682 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 277 transitions. Word has length 133 [2019-11-15 19:48:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:48:32,683 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 277 transitions. [2019-11-15 19:48:32,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 19:48:32,683 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 277 transitions. [2019-11-15 19:48:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 19:48:32,684 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:48:32,684 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:48:32,885 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:48:32,885 INFO L410 AbstractCegarLoop]: === Iteration 13 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:48:32,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:48:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1628820301, now seen corresponding path program 1 times [2019-11-15 19:48:32,886 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:48:32,886 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027185054] [2019-11-15 19:48:32,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:32,886 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:48:32,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:48:32,895 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:48:32,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431665687] [2019-11-15 19:48:32,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:48:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:48:33,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 112 conjunts are in the unsatisfiable core [2019-11-15 19:48:33,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:48:33,131 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 8 treesize of output 7 [2019-11-15 19:48:33,131 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:33,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:33,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:48:33,138 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:48:33,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:34,179 WARN L191 SmtUtils]: Spent 930.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 19:48:34,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:34,425 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 19:48:34,620 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 19:48:34,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:35,080 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-15 19:48:35,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_l2_insert_~item~2.offset 0)) (.cse3 (= (select |c_#valid| c_l2_insert_~item~2.base) 1))) (or (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse0 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse1 (mod .cse0 4294967296))) (and (<= 8 calloc_model_~size) (= .cse0 (select |c_#length| c_l2_insert_~item~2.base)) (<= 1 calloc_model_~nmemb) (<= .cse1 0) (<= .cse1 2147483647))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse4 (* v_prenex_41 v_prenex_40))) (let ((.cse5 (mod .cse4 4294967296))) (and (= .cse4 (select |c_#length| c_l2_insert_~item~2.base)) (<= 8 v_prenex_40) (< 2147483647 .cse5) (<= 1 v_prenex_41) (<= .cse5 4294967296)))))))) is different from false [2019-11-15 19:48:35,159 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 4 |c_l3_insert_#in~list.offset|)) (.cse1 (= 1 (select |c_#valid| |c_l3_insert_#in~list.base|)))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse3 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse2 (mod .cse3 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse2 0) (<= .cse2 2147483647) (= .cse3 (select |c_#length| |c_l3_insert_#in~list.base|))))))) (and .cse0 .cse1 (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse4 (* v_prenex_41 v_prenex_40))) (let ((.cse5 (mod .cse4 4294967296))) (and (<= 8 v_prenex_40) (= .cse4 (select |c_#length| |c_l3_insert_#in~list.base|)) (< 2147483647 .cse5) (<= 1 v_prenex_41) (<= .cse5 4294967296)))))))) is different from false [2019-11-15 19:48:35,196 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4)) (.cse1 (= 1 (select |c_#valid| c_l3_insert_~list.base)))) (or (and .cse0 .cse1 (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse3 (* v_prenex_41 v_prenex_40))) (let ((.cse2 (mod .cse3 4294967296))) (and (<= 8 v_prenex_40) (< 2147483647 .cse2) (= .cse3 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_41) (<= .cse2 4294967296)))))) (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse4 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse5 (mod .cse4 4294967296))) (and (= .cse4 (select |c_#length| c_l3_insert_~list.base)) (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse5 0) (<= .cse5 2147483647))))) .cse0 .cse1))) is different from false [2019-11-15 19:48:35,347 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_20|], 1=[|v_old(#valid)_BEFORE_CALL_34|]} [2019-11-15 19:48:35,349 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 8 treesize of output 7 [2019-11-15 19:48:35,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,362 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:48:35,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:35,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:35,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:48:35,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:35,517 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_44|], 3=[|v_#valid_BEFORE_CALL_72|]} [2019-11-15 19:48:35,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:35,537 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 60 treesize of output 62 [2019-11-15 19:48:35,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:35,716 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base calloc_model_~ptr~0.base) [2019-11-15 19:48:35,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:35,766 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l3_insert_~list.base)) [2019-11-15 19:48:35,814 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l3_insert_~list.base)) [2019-11-15 19:48:35,861 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:48:35,911 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:48:35,911 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 60 treesize of output 62 [2019-11-15 19:48:35,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:37,280 WARN L191 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-15 19:48:37,280 INFO L567 ElimStorePlain]: treesize reduction 24, result has 79.8 percent of original size [2019-11-15 19:48:37,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:37,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 19:48:37,303 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:37,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:37,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 19:48:37,322 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:38,341 WARN L191 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 19:48:38,342 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.5 percent of original size [2019-11-15 19:48:38,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2019-11-15 19:48:38,342 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:121, output treesize:91 [2019-11-15 19:48:38,367 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4)) (.cse1 (= 1 (select |c_#valid| c_l3_insert_~list.base)))) (or (and .cse0 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| calloc_model_~ptr~0.base)) (= 1 (select |c_#valid| calloc_model_~ptr~0.base)) (not (= c_l3_insert_~list.base calloc_model_~ptr~0.base)))) .cse1 (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse2 (* v_prenex_41 v_prenex_40))) (and (<= 8 v_prenex_40) (< 2147483647 (mod .cse2 4294967296)) (= .cse2 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_41))))) (and .cse0 .cse1 (exists ((v_prenex_45 Int) (v_prenex_44 Int) (v_prenex_46 Int)) (and (= (* v_prenex_44 v_prenex_45) (select |c_#length| v_prenex_46)) (= 1 (select |c_#valid| v_prenex_46)) (not (= c_l3_insert_~list.base v_prenex_46)))) (exists ((v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse3 (* v_prenex_43 v_prenex_42))) (and (= .cse3 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_43) (<= (mod .cse3 4294967296) 0) (<= 8 v_prenex_42))))))) is different from false [2019-11-15 19:48:38,401 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_23|], 1=[|v_old(#valid)_BEFORE_CALL_37|]} [2019-11-15 19:48:38,405 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 8 treesize of output 7 [2019-11-15 19:48:38,405 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:38,410 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:38,413 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:48:38,413 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:38,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:38,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:38,417 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:48:38,511 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-15 19:48:38,512 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:38,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:38,515 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 8 treesize of output 7 [2019-11-15 19:48:38,515 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:38,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:38,517 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:48:38,517 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:48:38,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:48:38,678 INFO L392 ElimStorePlain]: Different costs {9=[|v_old(#length)_AFTER_CALL_134|], 11=[|v_old(#valid)_AFTER_CALL_134|]} [2019-11-15 19:48:38,844 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_46 calloc_model_~ptr~0.base) [2019-11-15 19:48:38,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:38,899 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_49 v_prenex_46) [2019-11-15 19:48:38,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:38,954 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base calloc_model_~ptr~0.base) [2019-11-15 19:48:38,955 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:39,010 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base v_prenex_49) [2019-11-15 19:48:39,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:39,064 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_49 calloc_model_~ptr~0.base) [2019-11-15 19:48:39,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:39,118 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#length)_AFTER_CALL_134| v_prenex_46) (select |v_old(#length)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:39,173 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#length)_AFTER_CALL_134| v_prenex_46) (select |v_old(#length)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:39,228 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#length)_AFTER_CALL_134| v_prenex_46) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:48:39,282 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#length)_AFTER_CALL_134| v_prenex_46) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:48:39,340 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#length)_AFTER_CALL_134| v_prenex_46) (* v_prenex_48 v_prenex_47)) [2019-11-15 19:48:39,394 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#length)_AFTER_CALL_134| v_prenex_46) (* v_prenex_48 v_prenex_47)) [2019-11-15 19:48:39,447 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#length)_AFTER_CALL_134| l3_insert_~list.base) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:48:39,505 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#length)_AFTER_CALL_134| l3_insert_~list.base) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:48:39,558 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_48 v_prenex_47) (select |v_old(#length)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:39,612 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_48 v_prenex_47) (select |v_old(#length)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:39,668 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_48 v_prenex_47) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:48:39,726 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_48 v_prenex_47) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:48:39,727 INFO L235 Elim1Store]: Index analysis took 936 ms [2019-11-15 19:48:39,782 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| v_prenex_46)) [2019-11-15 19:48:39,837 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| v_prenex_46)) [2019-11-15 19:48:39,891 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| v_prenex_46)) [2019-11-15 19:48:39,947 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| v_prenex_46)) [2019-11-15 19:48:40,003 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l3_insert_~list.base)) [2019-11-15 19:48:40,060 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l3_insert_~list.base)) [2019-11-15 19:48:40,117 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| l3_insert_~list.base)) [2019-11-15 19:48:40,173 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| l3_insert_~list.base)) [2019-11-15 19:48:40,228 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| v_prenex_49)) [2019-11-15 19:48:40,284 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| v_prenex_49)) [2019-11-15 19:48:40,339 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:48:40,396 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:48:40,453 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:48:40,509 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_48 v_prenex_47) (select |#length| calloc_model_~ptr~0.base)) [2019-11-15 19:48:40,510 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 78 [2019-11-15 19:48:40,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:40,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:40,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:40,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:40,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:40,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:48:40,534 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 78 [2019-11-15 19:48:40,535 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:41,385 WARN L191 SmtUtils]: Spent 849.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 19:48:41,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:41,461 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base calloc_model_~ptr~0.base) [2019-11-15 19:48:41,527 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~list.base calloc_model_~ptr~0.base) [2019-11-15 19:48:41,588 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_134| v_prenex_49) (select |v_old(#valid)_AFTER_CALL_134| v_prenex_46)) [2019-11-15 19:48:41,648 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_134| v_prenex_49) (select |v_old(#valid)_AFTER_CALL_134| v_prenex_46)) [2019-11-15 19:48:41,712 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_134| calloc_model_~ptr~0.base) (select |v_old(#valid)_AFTER_CALL_134| v_prenex_46)) [2019-11-15 19:48:41,773 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_134| calloc_model_~ptr~0.base) (select |v_old(#valid)_AFTER_CALL_134| v_prenex_46)) [2019-11-15 19:48:41,836 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_134| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_134| v_prenex_46)) [2019-11-15 19:48:41,897 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_134| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_134| v_prenex_46)) [2019-11-15 19:48:41,958 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_134| v_prenex_49) (select |v_old(#valid)_AFTER_CALL_134| calloc_model_~ptr~0.base)) [2019-11-15 19:48:42,018 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_134| v_prenex_49) (select |v_old(#valid)_AFTER_CALL_134| calloc_model_~ptr~0.base)) [2019-11-15 19:48:42,078 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_134| v_prenex_49) (select |v_old(#valid)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:42,139 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_134| v_prenex_49) (select |v_old(#valid)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:42,203 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_134| calloc_model_~ptr~0.base) (select |v_old(#valid)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:42,263 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_134| calloc_model_~ptr~0.base) (select |v_old(#valid)_AFTER_CALL_134| l3_insert_~list.base)) [2019-11-15 19:48:42,263 INFO L235 Elim1Store]: Index analysis took 868 ms [2019-11-15 19:48:42,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:42,280 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 105 [2019-11-15 19:48:42,281 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:42,323 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:42,324 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 73 treesize of output 105 [2019-11-15 19:48:42,324 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:48:43,486 WARN L191 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 19:48:43,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:48:43,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 2 dim-1 vars, End of recursive call: 22 dim-0 vars, and 2 xjuncts. [2019-11-15 19:48:43,488 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 18 variables, input treesize:143, output treesize:139 [2019-11-15 19:48:43,523 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4))) (or (and .cse0 (exists ((v_prenex_49 Int) (v_prenex_48 Int) (calloc_model_~size Int) (v_prenex_47 Int) (v_prenex_52 Int) (v_prenex_51 Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int) (v_prenex_50 Int)) (and (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| calloc_model_~ptr~0.base)) (not (= v_prenex_52 calloc_model_~ptr~0.base)) (= (* v_prenex_48 v_prenex_47) (select |c_#length| v_prenex_49)) (not (= c_l3_insert_~list.base v_prenex_52)) (not (= c_l3_insert_~list.base v_prenex_49)) (not (= v_prenex_49 calloc_model_~ptr~0.base)) (not (= v_prenex_52 v_prenex_49)) (= (* v_prenex_50 v_prenex_51) (select |c_#length| v_prenex_52)) (not (= c_l3_insert_~list.base calloc_model_~ptr~0.base)))) (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse1 (* v_prenex_41 v_prenex_40))) (and (<= 8 v_prenex_40) (< 2147483647 (mod .cse1 4294967296)) (= .cse1 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_41))))) (and .cse0 (exists ((v_prenex_43 Int) (v_prenex_42 Int)) (let ((.cse2 (* v_prenex_43 v_prenex_42))) (and (= .cse2 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_43) (<= (mod .cse2 4294967296) 0) (<= 8 v_prenex_42)))) (exists ((v_prenex_45 Int) (v_prenex_56 Int) (v_prenex_44 Int) (v_prenex_55 Int) (v_prenex_58 Int) (v_prenex_46 Int) (v_prenex_57 Int) (v_prenex_54 Int) (v_prenex_53 Int)) (and (= (* v_prenex_44 v_prenex_45) (select |c_#length| v_prenex_46)) (= (* v_prenex_55 v_prenex_57) (select |c_#length| v_prenex_58)) (not (= v_prenex_53 v_prenex_46)) (not (= v_prenex_46 v_prenex_58)) (= (* v_prenex_54 v_prenex_56) (select |c_#length| v_prenex_53)) (not (= c_l3_insert_~list.base v_prenex_53)) (not (= v_prenex_53 v_prenex_58)) (not (= c_l3_insert_~list.base v_prenex_58)) (not (= c_l3_insert_~list.base v_prenex_46))))))) is different from false [2019-11-15 19:48:43,640 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 120 proven. 63 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 19:48:43,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027185054] [2019-11-15 19:48:43,640 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:48:43,641 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431665687] [2019-11-15 19:48:43,641 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:48:43,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-11-15 19:48:43,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508599550] [2019-11-15 19:48:43,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-15 19:48:43,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:48:43,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-15 19:48:43,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=314, Unknown=21, NotChecked=200, Total=600 [2019-11-15 19:48:43,642 INFO L87 Difference]: Start difference. First operand 248 states and 277 transitions. Second operand 25 states. [2019-11-15 19:48:54,830 WARN L191 SmtUtils]: Spent 7.92 s on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-11-15 19:48:54,913 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (= (select |c_#valid| |c_calloc_model_#res.base|) 1)) (.cse3 (= |c_calloc_model_#res.offset| 0))) (or (and (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse0 (* v_prenex_41 v_prenex_40))) (let ((.cse1 (mod .cse0 4294967296))) (and (= .cse0 (select |c_#length| |c_calloc_model_#res.base|)) (<= |c_calloc_model_#in~nmemb| v_prenex_41) (< 2147483647 .cse1) (<= .cse1 4294967296) (<= |c_calloc_model_#in~size| v_prenex_40))))) .cse2 .cse3) (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse5 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse4 (mod .cse5 4294967296))) (and (<= |c_calloc_model_#in~nmemb| calloc_model_~nmemb) (<= .cse4 0) (= .cse5 (select |c_#length| |c_calloc_model_#res.base|)) (<= |c_calloc_model_#in~size| calloc_model_~size) (<= .cse4 2147483647))))) .cse2 .cse3))) (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (= (store |c_old(#valid)| calloc_model_~ptr~0.base 1) |c_#valid|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base (* calloc_model_~size calloc_model_~nmemb)) |c_#length|) (= 1 (select |c_#valid| calloc_model_~ptr~0.base))))) is different from false [2019-11-15 19:48:54,941 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= 0 |c_zalloc_or_die_#t~ret4.offset|)) (.cse1 (= (select |c_#valid| |c_zalloc_or_die_#t~ret4.base|) 1))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse2 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse3 (mod .cse2 4294967296))) (and (= .cse2 (select |c_#length| |c_zalloc_or_die_#t~ret4.base|)) (<= |c_zalloc_or_die_#in~size| calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse3 0) (<= .cse3 2147483647)))))) (and .cse0 .cse1 (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse4 (* v_prenex_41 v_prenex_40))) (let ((.cse5 (mod .cse4 4294967296))) (and (= .cse4 (select |c_#length| |c_zalloc_or_die_#t~ret4.base|)) (< 2147483647 .cse5) (<= 1 v_prenex_41) (<= .cse5 4294967296) (<= |c_zalloc_or_die_#in~size| v_prenex_40)))))))) (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (= (store |c_old(#valid)| calloc_model_~ptr~0.base 1) |c_#valid|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base (* calloc_model_~size calloc_model_~nmemb)) |c_#length|) (= 1 (select |c_#valid| calloc_model_~ptr~0.base))))) is different from false [2019-11-15 19:48:55,257 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 19:48:55,338 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse2 (= 0 c_zalloc_or_die_~ptr~1.offset)) (.cse3 (= 1 (select |c_#valid| c_zalloc_or_die_~ptr~1.base)))) (or (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse0 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse1 (mod .cse0 4294967296))) (and (= .cse0 (select |c_#length| c_zalloc_or_die_~ptr~1.base)) (<= |c_zalloc_or_die_#in~size| calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse1 0) (<= .cse1 2147483647))))) .cse2 .cse3) (and (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse5 (* v_prenex_41 v_prenex_40))) (let ((.cse4 (mod .cse5 4294967296))) (and (< 2147483647 .cse4) (= .cse5 (select |c_#length| c_zalloc_or_die_~ptr~1.base)) (<= 1 v_prenex_41) (<= .cse4 4294967296) (<= |c_zalloc_or_die_#in~size| v_prenex_40))))) .cse2 .cse3))) (let ((.cse8 (= 0 |c_zalloc_or_die_#res.offset|)) (.cse9 (= 1 (select |c_#valid| |c_zalloc_or_die_#res.base|)))) (or (and (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse7 (* v_prenex_41 v_prenex_40))) (let ((.cse6 (mod .cse7 4294967296))) (and (< 2147483647 .cse6) (= .cse7 (select |c_#length| |c_zalloc_or_die_#res.base|)) (<= 1 v_prenex_41) (<= .cse6 4294967296) (<= |c_zalloc_or_die_#in~size| v_prenex_40))))) .cse8 .cse9) (and .cse8 .cse9 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse11 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse10 (mod .cse11 4294967296))) (and (<= |c_zalloc_or_die_#in~size| calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse10 0) (= .cse11 (select |c_#length| |c_zalloc_or_die_#res.base|)) (<= .cse10 2147483647)))))))) (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (= (store |c_old(#valid)| calloc_model_~ptr~0.base 1) |c_#valid|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base (* calloc_model_~size calloc_model_~nmemb)) |c_#length|) (= 1 (select |c_#valid| calloc_model_~ptr~0.base))))) is different from false [2019-11-15 19:48:55,607 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-15 19:48:55,993 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse0 (= |c_l2_insert_#t~ret11.offset| 0)) (.cse1 (= 1 (select |c_#valid| |c_l2_insert_#t~ret11.base|)))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse3 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse2 (mod .cse3 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse2 0) (= .cse3 (select |c_#length| |c_l2_insert_#t~ret11.base|)) (<= .cse2 2147483647)))))) (and (exists ((v_prenex_41 Int) (v_prenex_40 Int)) (let ((.cse4 (* v_prenex_41 v_prenex_40))) (let ((.cse5 (mod .cse4 4294967296))) (and (<= 8 v_prenex_40) (= .cse4 (select |c_#length| |c_l2_insert_#t~ret11.base|)) (< 2147483647 .cse5) (<= 1 v_prenex_41) (<= .cse5 4294967296))))) .cse0 .cse1))) (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int) (calloc_model_~ptr~0.base Int)) (and (= (store |c_old(#valid)| calloc_model_~ptr~0.base 1) |c_#valid|) (= 0 (select |c_old(#valid)| calloc_model_~ptr~0.base)) (= (store |c_old(#length)| calloc_model_~ptr~0.base (* calloc_model_~size calloc_model_~nmemb)) |c_#length|) (= 1 (select |c_#valid| calloc_model_~ptr~0.base))))) is different from false [2019-11-15 19:49:12,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:49:12,520 INFO L93 Difference]: Finished difference Result 500 states and 602 transitions. [2019-11-15 19:49:12,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 19:49:12,520 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 133 [2019-11-15 19:49:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:49:12,522 INFO L225 Difference]: With dead ends: 500 [2019-11-15 19:49:12,523 INFO L226 Difference]: Without dead ends: 500 [2019-11-15 19:49:12,523 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=163, Invalid=895, Unknown=34, NotChecked=630, Total=1722 [2019-11-15 19:49:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-15 19:49:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 267. [2019-11-15 19:49:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-11-15 19:49:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 307 transitions. [2019-11-15 19:49:12,533 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 307 transitions. Word has length 133 [2019-11-15 19:49:12,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:49:12,534 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 307 transitions. [2019-11-15 19:49:12,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-15 19:49:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 307 transitions. [2019-11-15 19:49:12,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-11-15 19:49:12,535 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:49:12,535 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:49:12,739 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:49:12,739 INFO L410 AbstractCegarLoop]: === Iteration 14 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:49:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:49:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 920055942, now seen corresponding path program 1 times [2019-11-15 19:49:12,740 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:49:12,740 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492958481] [2019-11-15 19:49:12,740 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:49:12,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:49:12,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:49:12,752 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:49:12,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072424304] [2019-11-15 19:49:12,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:49:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:49:12,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 128 conjunts are in the unsatisfiable core [2019-11-15 19:49:13,003 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:49:13,021 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 8 treesize of output 7 [2019-11-15 19:49:13,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:13,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2019-11-15 19:49:13,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:13,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:49:13,241 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2019-11-15 19:49:13,522 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_28|], 1=[|v_old(#valid)_BEFORE_CALL_42|]} [2019-11-15 19:49:13,524 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 8 treesize of output 7 [2019-11-15 19:49:13,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,530 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:13,532 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:49:13,532 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:13,536 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:13,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:49:13,615 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_59|], 3=[|v_#valid_BEFORE_CALL_87|]} [2019-11-15 19:49:13,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:13,626 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:49:13,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,703 INFO L567 ElimStorePlain]: treesize reduction 5, result has 91.5 percent of original size [2019-11-15 19:49:13,719 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:13,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:49:13,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,812 INFO L567 ElimStorePlain]: treesize reduction 14, result has 78.8 percent of original size [2019-11-15 19:49:13,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:13,813 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:60, output treesize:52 [2019-11-15 19:49:13,873 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_31|], 1=[|v_old(#valid)_BEFORE_CALL_45|]} [2019-11-15 19:49:13,876 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 8 treesize of output 7 [2019-11-15 19:49:13,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:13,883 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:49:13,884 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:13,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:13,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:13,888 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:49:14,256 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 8 treesize of output 7 [2019-11-15 19:49:14,256 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,262 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-15 19:49:14,262 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:14,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:49:14,362 INFO L392 ElimStorePlain]: Different costs {5=[|v_#length_BEFORE_CALL_69|], 7=[|v_#valid_BEFORE_CALL_97|]} [2019-11-15 19:49:14,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:14,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:14,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:14,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:14,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:49:14,374 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2019-11-15 19:49:14,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,474 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,474 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 57 [2019-11-15 19:49:14,474 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:49:14,535 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:49:14,535 INFO L496 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-11-15 19:49:14,536 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:78, output treesize:76 [2019-11-15 19:49:20,671 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 54 [2019-11-15 19:49:20,722 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 139 proven. 79 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-11-15 19:49:20,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492958481] [2019-11-15 19:49:20,722 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:49:20,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072424304] [2019-11-15 19:49:20,723 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:49:20,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-11-15 19:49:20,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605040661] [2019-11-15 19:49:20,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-15 19:49:20,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:49:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-15 19:49:20,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=829, Unknown=2, NotChecked=0, Total=930 [2019-11-15 19:49:20,724 INFO L87 Difference]: Start difference. First operand 267 states and 307 transitions. Second operand 31 states. [2019-11-15 19:49:22,431 WARN L191 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-11-15 19:49:37,297 WARN L191 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2019-11-15 19:49:39,835 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-11-15 19:49:49,950 WARN L191 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-15 19:49:58,936 WARN L191 SmtUtils]: Spent 2.10 s on a formula simplification that was a NOOP. DAG size: 62 [2019-11-15 19:50:09,583 WARN L191 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-11-15 19:50:23,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:50:23,385 INFO L93 Difference]: Finished difference Result 474 states and 575 transitions. [2019-11-15 19:50:23,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-15 19:50:23,385 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2019-11-15 19:50:23,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:50:23,388 INFO L225 Difference]: With dead ends: 474 [2019-11-15 19:50:23,388 INFO L226 Difference]: Without dead ends: 474 [2019-11-15 19:50:23,389 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 45.3s TimeCoverageRelationStatistics Valid=308, Invalid=2763, Unknown=9, NotChecked=0, Total=3080 [2019-11-15 19:50:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2019-11-15 19:50:23,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 291. [2019-11-15 19:50:23,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-11-15 19:50:23,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 344 transitions. [2019-11-15 19:50:23,406 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 344 transitions. Word has length 138 [2019-11-15 19:50:23,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:50:23,406 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 344 transitions. [2019-11-15 19:50:23,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-15 19:50:23,407 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 344 transitions. [2019-11-15 19:50:23,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-15 19:50:23,408 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:50:23,408 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:50:23,612 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:50:23,612 INFO L410 AbstractCegarLoop]: === Iteration 15 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:50:23,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:50:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1730003347, now seen corresponding path program 2 times [2019-11-15 19:50:23,613 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:50:23,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934845946] [2019-11-15 19:50:23,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:50:23,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:50:23,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:50:23,622 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:50:23,623 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092602274] [2019-11-15 19:50:23,623 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:50:23,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 19:50:23,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 19:50:23,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 735 conjuncts, 124 conjunts are in the unsatisfiable core [2019-11-15 19:50:23,858 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:50:23,872 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 8 treesize of output 7 [2019-11-15 19:50:23,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:23,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:23,887 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:50:23,887 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:23,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:23,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:23,898 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:22 [2019-11-15 19:50:24,194 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_36|], 1=[|v_old(#valid)_BEFORE_CALL_50|]} [2019-11-15 19:50:24,197 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 8 treesize of output 7 [2019-11-15 19:50:24,197 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,211 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:50:24,211 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:24,217 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:50:24,489 INFO L392 ElimStorePlain]: Different costs {1=[|v_old(#length)_AFTER_CALL_157|], 3=[|v_old(#valid)_AFTER_CALL_157|]} [2019-11-15 19:50:24,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:50:24,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:50:24,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:50:24,536 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,572 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-11-15 19:50:24,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:24,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:38 [2019-11-15 19:50:24,782 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 25 [2019-11-15 19:50:24,824 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_39|], 1=[|v_old(#valid)_BEFORE_CALL_53|]} [2019-11-15 19:50:24,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 8 treesize of output 7 [2019-11-15 19:50:24,827 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,832 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,834 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:50:24,834 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:24,838 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:50:24,971 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 8 treesize of output 7 [2019-11-15 19:50:24,971 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,978 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-15 19:50:24,978 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:24,979 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:24,980 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:24,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:50:25,022 INFO L392 ElimStorePlain]: Different costs {2=[|v_#length_BEFORE_CALL_84|], 7=[|v_old(#valid)_AFTER_CALL_162|]} [2019-11-15 19:50:25,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:50:25,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:50:25,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:50:25,033 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 21 treesize of output 25 [2019-11-15 19:50:25,034 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:25,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:25,087 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:25,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 57 [2019-11-15 19:50:25,088 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:50:25,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:50:25,112 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-15 19:50:25,112 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:57, output treesize:43 [2019-11-15 19:50:33,208 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 37 [2019-11-15 19:50:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 124 proven. 60 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-11-15 19:50:33,254 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934845946] [2019-11-15 19:50:33,255 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:50:33,255 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092602274] [2019-11-15 19:50:33,255 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:50:33,255 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-11-15 19:50:33,255 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697381857] [2019-11-15 19:50:33,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 19:50:33,256 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:50:33,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 19:50:33,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=565, Unknown=3, NotChecked=0, Total=650 [2019-11-15 19:50:33,256 INFO L87 Difference]: Start difference. First operand 291 states and 344 transitions. Second operand 26 states. [2019-11-15 19:50:39,791 WARN L191 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-11-15 19:50:42,074 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-15 19:50:54,910 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-15 19:51:03,297 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-15 19:51:13,413 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-11-15 19:51:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:51:23,054 INFO L93 Difference]: Finished difference Result 534 states and 652 transitions. [2019-11-15 19:51:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 19:51:23,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 135 [2019-11-15 19:51:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:51:23,057 INFO L225 Difference]: With dead ends: 534 [2019-11-15 19:51:23,057 INFO L226 Difference]: Without dead ends: 534 [2019-11-15 19:51:23,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 105 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=212, Invalid=1582, Unknown=12, NotChecked=0, Total=1806 [2019-11-15 19:51:23,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-11-15 19:51:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 295. [2019-11-15 19:51:23,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-11-15 19:51:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 352 transitions. [2019-11-15 19:51:23,069 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 352 transitions. Word has length 135 [2019-11-15 19:51:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:51:23,070 INFO L462 AbstractCegarLoop]: Abstraction has 295 states and 352 transitions. [2019-11-15 19:51:23,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 19:51:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 352 transitions. [2019-11-15 19:51:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 19:51:23,071 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:51:23,071 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:51:23,275 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:51:23,276 INFO L410 AbstractCegarLoop]: === Iteration 16 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:51:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:51:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash -637707001, now seen corresponding path program 1 times [2019-11-15 19:51:23,276 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:51:23,276 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683220397] [2019-11-15 19:51:23,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:51:23,276 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:51:23,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:51:23,285 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:51:23,286 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [856210506] [2019-11-15 19:51:23,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:51:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:51:23,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 69 conjunts are in the unsatisfiable core [2019-11-15 19:51:23,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:51:23,628 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:51:23,628 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:23,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:23,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:23,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-15 19:51:23,691 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:51:23,707 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:23,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 34 [2019-11-15 19:51:23,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:23,723 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-15 19:51:23,724 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:23,724 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:15 [2019-11-15 19:51:23,754 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:51:23,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:23,756 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:23,756 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:23,756 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-15 19:51:23,819 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:51:23,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:23,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:23,821 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:23,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:6, output treesize:5 [2019-11-15 19:51:23,888 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:51:23,888 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 1 [2019-11-15 19:51:23,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:23,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:23,898 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:23,898 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2019-11-15 19:51:24,022 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-15 19:51:24,110 INFO L341 Elim1Store]: treesize reduction 102, result has 43.0 percent of original size [2019-11-15 19:51:24,126 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 7 case distinctions, treesize of input 28 treesize of output 86 [2019-11-15 19:51:24,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:24,164 INFO L567 ElimStorePlain]: treesize reduction 40, result has 48.7 percent of original size [2019-11-15 19:51:24,165 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:24,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:38 [2019-11-15 19:51:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 99 proven. 81 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-11-15 19:51:24,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683220397] [2019-11-15 19:51:24,282 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:51:24,282 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856210506] [2019-11-15 19:51:24,283 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:51:24,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-11-15 19:51:24,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283738214] [2019-11-15 19:51:24,283 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 19:51:24,283 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:51:24,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 19:51:24,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2019-11-15 19:51:24,284 INFO L87 Difference]: Start difference. First operand 295 states and 352 transitions. Second operand 22 states. [2019-11-15 19:51:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:51:35,932 INFO L93 Difference]: Finished difference Result 520 states and 642 transitions. [2019-11-15 19:51:35,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 19:51:35,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 141 [2019-11-15 19:51:35,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:51:35,935 INFO L225 Difference]: With dead ends: 520 [2019-11-15 19:51:35,935 INFO L226 Difference]: Without dead ends: 520 [2019-11-15 19:51:35,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 114 SyntacticMatches, 8 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=999, Unknown=0, NotChecked=0, Total=1190 [2019-11-15 19:51:35,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2019-11-15 19:51:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 321. [2019-11-15 19:51:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-11-15 19:51:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 396 transitions. [2019-11-15 19:51:35,947 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 396 transitions. Word has length 141 [2019-11-15 19:51:35,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:51:35,947 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 396 transitions. [2019-11-15 19:51:35,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 19:51:35,948 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 396 transitions. [2019-11-15 19:51:35,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-15 19:51:35,949 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:51:35,949 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:51:36,153 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:51:36,153 INFO L410 AbstractCegarLoop]: === Iteration 17 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:51:36,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:51:36,154 INFO L82 PathProgramCache]: Analyzing trace with hash -637707000, now seen corresponding path program 1 times [2019-11-15 19:51:36,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:51:36,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425736813] [2019-11-15 19:51:36,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:51:36,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:51:36,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:51:36,163 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:51:36,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1007523338] [2019-11-15 19:51:36,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:51:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:51:36,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 152 conjunts are in the unsatisfiable core [2019-11-15 19:51:36,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:51:36,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:51:36,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,458 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 8 treesize of output 7 [2019-11-15 19:51:36,459 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,469 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:36,469 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:24, output treesize:22 [2019-11-15 19:51:36,725 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_44|], 1=[|v_old(#valid)_BEFORE_CALL_70|]} [2019-11-15 19:51:36,731 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 8 treesize of output 7 [2019-11-15 19:51:36,731 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,738 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,741 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:51:36,742 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:36,747 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:51:36,829 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_89|], 3=[|v_#valid_BEFORE_CALL_138|]} [2019-11-15 19:51:36,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:36,834 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2019-11-15 19:51:36,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,873 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-15 19:51:36,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,920 INFO L567 ElimStorePlain]: treesize reduction 14, result has 73.1 percent of original size [2019-11-15 19:51:36,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:36,921 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:41, output treesize:38 [2019-11-15 19:51:36,970 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_47|], 1=[|v_old(#valid)_BEFORE_CALL_73|]} [2019-11-15 19:51:36,975 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 8 treesize of output 7 [2019-11-15 19:51:36,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,986 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:51:36,986 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:36,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:36,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:36,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:51:37,221 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_51|], 1=[|v_old(#valid)_BEFORE_CALL_77|]} [2019-11-15 19:51:37,223 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 8 treesize of output 7 [2019-11-15 19:51:37,223 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:37,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,230 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:51:37,231 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:37,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,235 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:37,235 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:51:37,370 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-15 19:51:37,370 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:37,372 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,373 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 8 treesize of output 7 [2019-11-15 19:51:37,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:37,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:37,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:51:37,482 INFO L392 ElimStorePlain]: Different costs {7=[|v_#length_BEFORE_CALL_105|], 13=[|v_old(#valid)_AFTER_CALL_192|]} [2019-11-15 19:51:37,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:51:37,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 42 [2019-11-15 19:51:37,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:37,545 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 38 treesize of output 100 [2019-11-15 19:51:37,598 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:51:37,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:51:37,640 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 2 dim-1 vars, End of recursive call: 14 dim-0 vars, and 1 xjuncts. [2019-11-15 19:51:37,640 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 16 variables, input treesize:80, output treesize:85 [2019-11-15 19:51:44,739 WARN L191 SmtUtils]: Spent 2.36 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 19:51:44,823 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 99 proven. 92 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 19:51:44,823 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425736813] [2019-11-15 19:51:44,824 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:51:44,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007523338] [2019-11-15 19:51:44,824 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:51:44,824 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-11-15 19:51:44,824 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130985105] [2019-11-15 19:51:44,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-15 19:51:44,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:51:44,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-15 19:51:44,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=718, Unknown=2, NotChecked=0, Total=812 [2019-11-15 19:51:44,825 INFO L87 Difference]: Start difference. First operand 321 states and 396 transitions. Second operand 29 states. [2019-11-15 19:51:47,406 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 47 DAG size of output: 34 [2019-11-15 19:51:48,586 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-11-15 19:51:53,286 WARN L191 SmtUtils]: Spent 4.55 s on a formula simplification. DAG size of input: 48 DAG size of output: 35 [2019-11-15 19:52:14,100 WARN L191 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 19:52:23,834 WARN L191 SmtUtils]: Spent 4.71 s on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-15 19:52:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:52:39,404 INFO L93 Difference]: Finished difference Result 522 states and 655 transitions. [2019-11-15 19:52:39,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 19:52:39,404 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 141 [2019-11-15 19:52:39,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:52:39,406 INFO L225 Difference]: With dead ends: 522 [2019-11-15 19:52:39,407 INFO L226 Difference]: Without dead ends: 522 [2019-11-15 19:52:39,407 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 107 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=226, Invalid=1928, Unknown=8, NotChecked=0, Total=2162 [2019-11-15 19:52:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-15 19:52:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 334. [2019-11-15 19:52:39,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-11-15 19:52:39,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 416 transitions. [2019-11-15 19:52:39,419 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 416 transitions. Word has length 141 [2019-11-15 19:52:39,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:52:39,419 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 416 transitions. [2019-11-15 19:52:39,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-15 19:52:39,420 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 416 transitions. [2019-11-15 19:52:39,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-15 19:52:39,420 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:52:39,421 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:52:39,625 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:52:39,625 INFO L410 AbstractCegarLoop]: === Iteration 18 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:52:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:52:39,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1705919599, now seen corresponding path program 1 times [2019-11-15 19:52:39,627 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:52:39,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037454576] [2019-11-15 19:52:39,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:52:39,628 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:52:39,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:52:39,647 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:52:39,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [963522655] [2019-11-15 19:52:39,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:52:39,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:52:39,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-15 19:52:39,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:52:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 16 proven. 24 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-15 19:52:40,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037454576] [2019-11-15 19:52:40,012 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-15 19:52:40,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963522655] [2019-11-15 19:52:40,012 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:52:40,012 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-11-15 19:52:40,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132638057] [2019-11-15 19:52:40,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 19:52:40,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:52:40,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 19:52:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-15 19:52:40,013 INFO L87 Difference]: Start difference. First operand 334 states and 416 transitions. Second operand 12 states. [2019-11-15 19:52:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:52:40,217 INFO L93 Difference]: Finished difference Result 333 states and 413 transitions. [2019-11-15 19:52:40,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 19:52:40,218 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 142 [2019-11-15 19:52:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:52:40,220 INFO L225 Difference]: With dead ends: 333 [2019-11-15 19:52:40,220 INFO L226 Difference]: Without dead ends: 333 [2019-11-15 19:52:40,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-15 19:52:40,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-15 19:52:40,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-11-15 19:52:40,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-11-15 19:52:40,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 413 transitions. [2019-11-15 19:52:40,229 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 413 transitions. Word has length 142 [2019-11-15 19:52:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:52:40,229 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 413 transitions. [2019-11-15 19:52:40,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 19:52:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 413 transitions. [2019-11-15 19:52:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-11-15 19:52:40,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:52:40,230 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:52:40,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:52:40,435 INFO L410 AbstractCegarLoop]: === Iteration 19 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr1REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr4REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION]=== [2019-11-15 19:52:40,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:52:40,435 INFO L82 PathProgramCache]: Analyzing trace with hash -537067509, now seen corresponding path program 1 times [2019-11-15 19:52:40,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:52:40,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568157153] [2019-11-15 19:52:40,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:52:40,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:52:40,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:52:40,444 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-11-15 19:52:40,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355501983] [2019-11-15 19:52:40,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:52:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:52:40,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 222 conjunts are in the unsatisfiable core [2019-11-15 19:52:40,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:52:40,867 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 8 treesize of output 7 [2019-11-15 19:52:40,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:40,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:40,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:52:40,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:40,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:40,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 19:52:40,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:22 [2019-11-15 19:52:40,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:52:41,366 WARN L191 SmtUtils]: Spent 332.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 19:52:43,442 WARN L191 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-15 19:52:43,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:52:43,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:52:43,689 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_l2_insert_#t~ret11.offset| 0)) (.cse1 (= 1 (select |c_#valid| |c_l2_insert_#t~ret11.base|)))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse3 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse2 (mod .cse3 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse2 0) (= .cse3 (select |c_#length| |c_l2_insert_#t~ret11.base|)) (<= .cse2 2147483647)))))) (and (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse5 (* v_prenex_96 v_prenex_95))) (let ((.cse4 (mod .cse5 4294967296))) (and (< 2147483647 .cse4) (= .cse5 (select |c_#length| |c_l2_insert_#t~ret11.base|)) (<= .cse4 4294967296) (<= 1 v_prenex_96) (<= 8 v_prenex_95))))) .cse0 .cse1))) is different from false [2019-11-15 19:52:43,711 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_l2_insert_~item~2.offset 0)) (.cse3 (= (select |c_#valid| c_l2_insert_~item~2.base) 1))) (or (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse0 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse1 (mod .cse0 4294967296))) (and (<= 8 calloc_model_~size) (= .cse0 (select |c_#length| c_l2_insert_~item~2.base)) (<= 1 calloc_model_~nmemb) (<= .cse1 0) (<= .cse1 2147483647))))) .cse2 .cse3) (and .cse2 .cse3 (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse5 (* v_prenex_96 v_prenex_95))) (let ((.cse4 (mod .cse5 4294967296))) (and (< 2147483647 .cse4) (<= .cse4 4294967296) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse5 (select |c_#length| c_l2_insert_~item~2.base))))))))) is different from false [2019-11-15 19:52:43,733 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= 4 |c_l3_insert_#in~list.offset|)) (.cse1 (= 1 (select |c_#valid| |c_l3_insert_#in~list.base|)))) (or (and .cse0 .cse1 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse3 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse2 (mod .cse3 4294967296))) (and (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse2 0) (<= .cse2 2147483647) (= .cse3 (select |c_#length| |c_l3_insert_#in~list.base|))))))) (and .cse0 (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse5 (* v_prenex_96 v_prenex_95))) (let ((.cse4 (mod .cse5 4294967296))) (and (< 2147483647 .cse4) (<= .cse4 4294967296) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse5 (select |c_#length| |c_l3_insert_#in~list.base|)))))) .cse1))) is different from false [2019-11-15 19:52:43,755 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_l3_insert_~list.offset 4)) (.cse3 (= 1 (select |c_#valid| c_l3_insert_~list.base)))) (or (and (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse0 (* calloc_model_~nmemb calloc_model_~size))) (let ((.cse1 (mod .cse0 4294967296))) (and (= .cse0 (select |c_#length| c_l3_insert_~list.base)) (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= .cse1 0) (<= .cse1 2147483647))))) .cse2 .cse3) (and (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse5 (* v_prenex_96 v_prenex_95))) (let ((.cse4 (mod .cse5 4294967296))) (and (< 2147483647 .cse4) (<= .cse4 4294967296) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse5 (select |c_#length| c_l3_insert_~list.base)))))) .cse2 .cse3))) is different from false [2019-11-15 19:52:43,814 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_56|], 1=[|v_old(#valid)_BEFORE_CALL_82|]} [2019-11-15 19:52:43,815 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 8 treesize of output 7 [2019-11-15 19:52:43,816 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:43,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:43,823 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:52:43,823 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:43,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:43,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:52:43,827 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:52:43,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:52:43,986 INFO L392 ElimStorePlain]: Different costs {1=[|v_#length_BEFORE_CALL_110|], 3=[|v_old(#valid)_AFTER_CALL_216|]} [2019-11-15 19:52:44,137 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base |l3_insert_#t~ret8.base|) [2019-11-15 19:52:44,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:44,186 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_97 v_prenex_98) (select |v_#length_BEFORE_CALL_110| l3_insert_~list.base)) [2019-11-15 19:52:44,234 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_97 v_prenex_98) (select |v_#length_BEFORE_CALL_110| l3_insert_~list.base)) [2019-11-15 19:52:44,234 INFO L235 Elim1Store]: Index analysis took 145 ms [2019-11-15 19:52:44,283 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_97 v_prenex_98) (select |#length| l3_insert_~list.base)) [2019-11-15 19:52:44,332 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_97 v_prenex_98) (select |#length| l3_insert_~list.base)) [2019-11-15 19:52:44,382 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_97 v_prenex_98) (select |#length| |l3_insert_#t~ret8.base|)) [2019-11-15 19:52:44,432 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_97 v_prenex_98) (select |#length| |l3_insert_#t~ret8.base|)) [2019-11-15 19:52:44,433 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 55 treesize of output 57 [2019-11-15 19:52:44,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:44,439 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:44,442 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 55 treesize of output 57 [2019-11-15 19:52:44,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:45,156 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-11-15 19:52:45,156 INFO L567 ElimStorePlain]: treesize reduction 14, result has 87.2 percent of original size [2019-11-15 19:52:45,186 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:45,186 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 19:52:45,187 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:45,345 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base |l3_insert_#t~ret8.base|) [2019-11-15 19:52:45,394 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~list.base |l3_insert_#t~ret8.base|) [2019-11-15 19:52:45,441 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |#valid| l3_insert_~list.base)) [2019-11-15 19:52:45,493 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |#valid| l3_insert_~list.base)) [2019-11-15 19:52:45,539 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#valid| |l3_insert_#t~ret8.base|) 1) [2019-11-15 19:52:45,590 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#valid| |l3_insert_#t~ret8.base|) 1) [2019-11-15 19:52:45,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:45,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 69 [2019-11-15 19:52:45,607 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:46,173 WARN L191 SmtUtils]: Spent 565.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 43 [2019-11-15 19:52:46,173 INFO L567 ElimStorePlain]: treesize reduction 28, result has 76.5 percent of original size [2019-11-15 19:52:46,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-11-15 19:52:46,174 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:111, output treesize:91 [2019-11-15 19:52:46,757 WARN L191 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 48 [2019-11-15 19:52:46,781 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4)) (.cse1 (= 1 (select |c_#valid| c_l3_insert_~list.base))) (.cse3 (not (= c_l3_insert_~item~1.base c_l3_insert_~list.base))) (.cse4 (= 1 (select |c_#valid| c_l3_insert_~item~1.base)))) (or (and .cse0 .cse1 (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse2 (* v_prenex_96 v_prenex_95))) (and (< 2147483647 (mod .cse2 4294967296)) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse2 (select |c_#length| c_l3_insert_~list.base))))) .cse3 .cse4) (and .cse0 .cse1 .cse3 (exists ((calloc_model_~size Int) (calloc_model_~nmemb Int)) (let ((.cse5 (* calloc_model_~nmemb calloc_model_~size))) (and (= .cse5 (select |c_#length| c_l3_insert_~list.base)) (<= 8 calloc_model_~size) (<= 1 calloc_model_~nmemb) (<= (mod .cse5 4294967296) 0)))) .cse4 (exists ((v_prenex_98 Int) (v_prenex_97 Int)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| c_l3_insert_~item~1.base)))))) is different from false [2019-11-15 19:52:46,787 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_59|], 1=[|v_old(#valid)_BEFORE_CALL_85|]} [2019-11-15 19:52:46,789 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 8 treesize of output 7 [2019-11-15 19:52:46,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:46,795 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:46,797 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:52:46,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:46,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:46,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:52:46,801 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:52:46,949 INFO L392 ElimStorePlain]: Different costs {0=[|v_old(#length)_BEFORE_CALL_62|], 1=[|v_old(#valid)_BEFORE_CALL_88|]} [2019-11-15 19:52:46,951 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 8 treesize of output 7 [2019-11-15 19:52:46,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:46,956 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:46,958 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 0 case distinctions, treesize of input 12 treesize of output 9 [2019-11-15 19:52:46,958 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:46,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:46,962 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:52:46,962 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:20, output treesize:13 [2019-11-15 19:52:47,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:52:47,134 INFO L392 ElimStorePlain]: Different costs {5=[|v_old(#length)_AFTER_CALL_221|], 15=[|v_old(#valid)_AFTER_CALL_221|]} [2019-11-15 19:52:47,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 73 treesize of output 77 [2019-11-15 19:52:47,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:47,398 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base l3_insert_~list.base) [2019-11-15 19:52:47,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,450 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:47,450 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,501 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~item~1.base l4_insert_~item~0.base) [2019-11-15 19:52:47,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,553 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~item~1.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:47,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,606 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:47,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 19:52:47,659 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (* v_prenex_102 v_prenex_101)) [2019-11-15 19:52:47,713 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (* v_prenex_102 v_prenex_101)) [2019-11-15 19:52:47,713 INFO L235 Elim1Store]: Index analysis took 367 ms [2019-11-15 19:52:47,767 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_102 v_prenex_101) (select |#length| l3_insert_~list.base)) [2019-11-15 19:52:47,818 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_102 v_prenex_101) (select |#length| l3_insert_~list.base)) [2019-11-15 19:52:47,872 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l3_insert_~list.base)) [2019-11-15 19:52:47,924 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| l3_insert_~list.base)) [2019-11-15 19:52:47,976 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l3_insert_~item~1.base) (* v_prenex_102 v_prenex_101)) [2019-11-15 19:52:48,030 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l3_insert_~item~1.base) (* v_prenex_102 v_prenex_101)) [2019-11-15 19:52:48,082 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l3_insert_~item~1.base) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:52:48,133 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l3_insert_~item~1.base) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:52:48,183 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:48,233 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* calloc_model_~size calloc_model_~nmemb) (select |#length| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:48,283 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)) [2019-11-15 19:52:48,334 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)) [2019-11-15 19:52:48,387 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l4_insert_~item~0.base) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:52:48,438 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l4_insert_~item~0.base) (* calloc_model_~size calloc_model_~nmemb)) [2019-11-15 19:52:48,439 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 87 [2019-11-15 19:52:48,439 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:49,701 WARN L191 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-15 19:52:49,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:49,761 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:49,811 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:49,930 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:49,980 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:50,036 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:50,099 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~list.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:50,163 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~item~1.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:50,218 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~item~1.base |l4_insert_#t~ret6.base|) [2019-11-15 19:52:50,282 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l4_insert_~item~0.base l3_insert_~list.base) [2019-11-15 19:52:50,345 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l4_insert_~item~0.base l3_insert_~list.base) [2019-11-15 19:52:50,407 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~item~1.base l4_insert_~item~0.base) [2019-11-15 19:52:50,465 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~item~1.base l4_insert_~item~0.base) [2019-11-15 19:52:50,527 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|) (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:50,586 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|) (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:50,646 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:50,705 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:50,766 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base) (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:50,828 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base) (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:50,886 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:50,941 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |v_old(#valid)_AFTER_CALL_221| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:51,001 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:51,062 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:51,121 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base) (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:51,180 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base) (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:51,239 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:51,291 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |v_old(#valid)_AFTER_CALL_221| l4_insert_~item~0.base)) [2019-11-15 19:52:51,350 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base)) [2019-11-15 19:52:51,410 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base)) [2019-11-15 19:52:51,462 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) 1) [2019-11-15 19:52:51,520 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~list.base) 1) [2019-11-15 19:52:51,572 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base) 1) [2019-11-15 19:52:51,631 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |v_old(#valid)_AFTER_CALL_221| l3_insert_~item~1.base) 1) [2019-11-15 19:52:51,631 INFO L235 Elim1Store]: Index analysis took 1760 ms [2019-11-15 19:52:51,690 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |#valid| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:51,749 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |#valid| |l4_insert_#t~ret6.base|)) [2019-11-15 19:52:51,807 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |#valid| l4_insert_~item~0.base)) [2019-11-15 19:52:51,867 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |#valid| l4_insert_~item~0.base)) [2019-11-15 19:52:51,926 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |#valid| l3_insert_~list.base)) [2019-11-15 19:52:51,984 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |#valid| l3_insert_~list.base)) [2019-11-15 19:52:52,043 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= 1 (select |#valid| l3_insert_~item~1.base)) [2019-11-15 19:52:52,102 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= 1 (select |#valid| l3_insert_~item~1.base)) [2019-11-15 19:52:52,189 INFO L341 Elim1Store]: treesize reduction 40, result has 69.2 percent of original size [2019-11-15 19:52:52,189 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 82 treesize of output 159 [2019-11-15 19:52:52,190 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:52,294 INFO L341 Elim1Store]: treesize reduction 40, result has 69.2 percent of original size [2019-11-15 19:52:52,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 75 treesize of output 152 [2019-11-15 19:52:52,295 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:55,235 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 73 DAG size of output: 70 [2019-11-15 19:52:55,235 INFO L567 ElimStorePlain]: treesize reduction 54, result has 77.5 percent of original size [2019-11-15 19:52:55,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:52:55,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 2 dim-1 vars, End of recursive call: 18 dim-0 vars, and 2 xjuncts. [2019-11-15 19:52:55,237 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:154, output treesize:186 [2019-11-15 19:52:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:52:55,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:52:55,275 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4)) (.cse4 (not (= c_l3_insert_~item~1.base c_l3_insert_~list.base))) (.cse5 (= 1 (select |c_#valid| c_l3_insert_~item~1.base)))) (or (and .cse0 (exists ((v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse1 (* v_prenex_104 v_prenex_103))) (and (= .cse1 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_104) (<= 8 v_prenex_103) (<= (mod .cse1 4294967296) 0)))) (exists ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_110 Int) (v_prenex_109 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (let ((.cse2 (= v_prenex_110 c_l3_insert_~list.base)) (.cse3 (= c_l3_insert_~list.base v_prenex_108))) (and (= (select |c_#length| v_prenex_110) (* v_prenex_107 v_prenex_106)) (= (* v_prenex_105 v_prenex_109) (select |c_#length| v_prenex_108)) (not .cse2) (or .cse3 (= 1 (select |c_#valid| c_l3_insert_~list.base)) .cse2) (= 1 (select |c_#valid| v_prenex_110)) (not (= c_l3_insert_~item~1.base v_prenex_108)) (= 1 (select |c_#valid| v_prenex_108)) (not .cse3) (not (= v_prenex_110 v_prenex_108)) (not (= c_l3_insert_~item~1.base v_prenex_110))))) .cse4 .cse5 (exists ((v_prenex_98 Int) (v_prenex_97 Int)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| c_l3_insert_~item~1.base)))) (and .cse0 (exists ((calloc_model_~size Int) (v_prenex_101 Int) (v_prenex_102 Int) (|l4_insert_#t~ret6.base| Int) (calloc_model_~nmemb Int) (l4_insert_~item~0.base Int)) (let ((.cse7 (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (.cse6 (= l4_insert_~item~0.base c_l3_insert_~list.base))) (and (not (= c_l3_insert_~item~1.base |l4_insert_#t~ret6.base|)) (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| |l4_insert_#t~ret6.base|)) (not (= c_l3_insert_~item~1.base l4_insert_~item~0.base)) (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (= 1 (select |c_#valid| l4_insert_~item~0.base)) (not .cse6) (not .cse7) (= 1 (select |c_#valid| |l4_insert_#t~ret6.base|)) (= (select |c_#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)) (or (= 1 (select |c_#valid| c_l3_insert_~list.base)) .cse7 .cse6)))) (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse8 (* v_prenex_96 v_prenex_95))) (and (< 2147483647 (mod .cse8 4294967296)) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse8 (select |c_#length| c_l3_insert_~list.base))))) .cse4 .cse5))) is different from false [2019-11-15 19:52:55,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:52:55,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 19:52:55,312 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4)) (.cse2 (= 1 (select |c_#valid| c_l3_insert_~list.base))) (.cse3 (not (= c_l3_insert_~item~1.base c_l3_insert_~list.base))) (.cse4 (= 1 (select |c_#valid| c_l3_insert_~item~1.base)))) (or (and .cse0 (exists ((v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse1 (* v_prenex_104 v_prenex_103))) (and (= .cse1 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_104) (<= 8 v_prenex_103) (<= (mod .cse1 4294967296) 0)))) .cse2 .cse3 .cse4 (exists ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_110 Int) (v_prenex_109 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (and (= (select |c_#length| v_prenex_110) (* v_prenex_107 v_prenex_106)) (= (* v_prenex_105 v_prenex_109) (select |c_#length| v_prenex_108)) (not (= v_prenex_110 c_l3_insert_~list.base)) (= 1 (select |c_#valid| v_prenex_110)) (not (= c_l3_insert_~item~1.base v_prenex_108)) (= 1 (select |c_#valid| v_prenex_108)) (not (= c_l3_insert_~list.base v_prenex_108)) (not (= v_prenex_110 v_prenex_108)) (not (= c_l3_insert_~item~1.base v_prenex_110)))) (exists ((v_prenex_98 Int) (v_prenex_97 Int)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| c_l3_insert_~item~1.base)))) (and .cse0 .cse2 (exists ((calloc_model_~size Int) (v_prenex_101 Int) (v_prenex_102 Int) (|l4_insert_#t~ret6.base| Int) (calloc_model_~nmemb Int) (l4_insert_~item~0.base Int)) (and (not (= c_l3_insert_~item~1.base |l4_insert_#t~ret6.base|)) (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| |l4_insert_#t~ret6.base|)) (not (= c_l3_insert_~item~1.base l4_insert_~item~0.base)) (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (= 1 (select |c_#valid| l4_insert_~item~0.base)) (not (= l4_insert_~item~0.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (= 1 (select |c_#valid| |l4_insert_#t~ret6.base|)) (= (select |c_#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)))) (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse5 (* v_prenex_96 v_prenex_95))) (and (< 2147483647 (mod .cse5 4294967296)) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse5 (select |c_#length| c_l3_insert_~list.base))))) .cse3 .cse4))) is different from false [2019-11-15 19:52:55,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-15 19:52:55,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:55,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:55,393 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 8 treesize of output 7 [2019-11-15 19:52:55,393 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:55,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:55,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:52:55,397 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:15, output treesize:13 [2019-11-15 19:52:55,997 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-15 19:52:55,997 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:55,999 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:56,000 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 8 treesize of output 7 [2019-11-15 19:52:56,000 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:56,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:56,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-15 19:52:56,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:14, output treesize:7 [2019-11-15 19:52:56,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:52:56,338 INFO L392 ElimStorePlain]: Different costs {22=[|v_#valid_BEFORE_CALL_179|], 27=[|v_old(#length)_AFTER_CALL_226|]} [2019-11-15 19:52:56,517 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= v_prenex_115 v_prenex_114) [2019-11-15 19:52:58,140 INFO L235 Elim1Store]: Index analysis took 1568 ms [2019-11-15 19:52:58,154 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:58,154 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 116 treesize of output 138 [2019-11-15 19:52:58,155 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 19:52:58,213 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:52:58,214 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 131 [2019-11-15 19:52:58,214 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 19:53:01,070 WARN L191 SmtUtils]: Spent 2.86 s on a formula simplification that was a NOOP. DAG size: 110 [2019-11-15 19:53:01,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:53:01,139 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:53:01,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 158 [2019-11-15 19:53:01,140 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 19:53:01,336 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_115 v_prenex_110) [2019-11-15 19:53:01,399 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= v_prenex_115 v_prenex_110) [2019-11-15 19:53:01,465 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~list.base v_prenex_115) [2019-11-15 19:53:01,527 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~list.base v_prenex_115) [2019-11-15 19:53:01,591 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_108 v_prenex_115) [2019-11-15 19:53:01,654 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= v_prenex_108 v_prenex_115) [2019-11-15 19:53:01,720 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= l3_insert_~item~1.base v_prenex_115) [2019-11-15 19:53:01,783 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= l3_insert_~item~1.base v_prenex_115) [2019-11-15 19:53:01,853 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_113 v_prenex_116) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:01,917 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_113 v_prenex_116) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:01,917 INFO L235 Elim1Store]: Index analysis took 644 ms [2019-11-15 19:53:01,983 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| v_prenex_110)) [2019-11-15 19:53:02,049 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| v_prenex_110)) [2019-11-15 19:53:02,114 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| v_prenex_110) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:02,179 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| v_prenex_110) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:02,243 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| l3_insert_~list.base)) [2019-11-15 19:53:02,306 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| l3_insert_~list.base)) [2019-11-15 19:53:02,372 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_112 v_prenex_111) (select |#length| l3_insert_~list.base)) [2019-11-15 19:53:02,440 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_112 v_prenex_111) (select |#length| l3_insert_~list.base)) [2019-11-15 19:53:02,506 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| v_prenex_108) (* v_prenex_113 v_prenex_116)) [2019-11-15 19:53:02,574 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| v_prenex_108) (* v_prenex_113 v_prenex_116)) [2019-11-15 19:53:02,640 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| v_prenex_108) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:02,706 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| v_prenex_108) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:02,771 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| l3_insert_~item~1.base)) [2019-11-15 19:53:02,835 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| l3_insert_~item~1.base)) [2019-11-15 19:53:02,900 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| l3_insert_~item~1.base) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:02,967 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| l3_insert_~item~1.base) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:03,025 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select |#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:03,088 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (select |#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) [2019-11-15 19:53:03,146 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| v_prenex_115)) [2019-11-15 19:53:03,210 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_113 v_prenex_116) (select |#length| v_prenex_115)) [2019-11-15 19:53:03,276 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (* v_prenex_112 v_prenex_111) (select |#length| v_prenex_115)) [2019-11-15 19:53:03,343 WARN L176 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= (* v_prenex_112 v_prenex_111) (select |#length| v_prenex_115)) [2019-11-15 19:53:03,378 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 19:53:03,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 184 [2019-11-15 19:53:03,379 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 19:53:11,462 WARN L191 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-15 19:53:11,462 INFO L567 ElimStorePlain]: treesize reduction 84, result has 73.9 percent of original size [2019-11-15 19:53:11,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:11,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:13,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:13,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:13,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:13,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,508 INFO L496 ElimStorePlain]: Start of recursive call 1: 25 dim-0 vars, 2 dim-1 vars, End of recursive call: 31 dim-0 vars, and 2 xjuncts. [2019-11-15 19:53:15,508 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 27 variables, input treesize:224, output treesize:222 [2019-11-15 19:53:15,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,561 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_l3_insert_~list.offset 4))) (or (and .cse0 (exists ((v_prenex_98 Int) (v_prenex_97 Int) (v_prenex_109 Int) (v_prenex_118 Int) (v_prenex_107 Int) (v_prenex_108 Int) (v_prenex_119 Int) (v_prenex_105 Int) (v_prenex_117 Int) (v_prenex_106 Int) (v_prenex_103 Int) (v_prenex_104 Int) (v_prenex_110 Int) (v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int) (l3_insert_~item~1.base Int)) (let ((.cse2 (select |c_#length| v_prenex_119)) (.cse1 (* v_prenex_104 v_prenex_103))) (and (not (= l3_insert_~item~1.base v_prenex_118)) (= (select |c_#length| v_prenex_118) (* v_prenex_120 v_prenex_122)) (or (= v_prenex_108 v_prenex_119) (= (select |c_#length| v_prenex_108) (* v_prenex_105 v_prenex_109))) (or (= .cse1 (select |c_#length| c_l3_insert_~list.base)) (= c_l3_insert_~list.base v_prenex_119)) (not (= v_prenex_108 v_prenex_118)) (not (= l3_insert_~item~1.base v_prenex_108)) (not (= v_prenex_118 v_prenex_110)) (= (* v_prenex_121 v_prenex_117) .cse2) (not (= v_prenex_110 v_prenex_108)) (<= 8 .cse2) (not (= v_prenex_119 v_prenex_118)) (or (= (* v_prenex_97 v_prenex_98) (select |c_#length| l3_insert_~item~1.base)) (= l3_insert_~item~1.base v_prenex_119)) (not (= v_prenex_110 c_l3_insert_~list.base)) (or (= v_prenex_119 v_prenex_110) (= (* v_prenex_107 v_prenex_106) (select |c_#length| v_prenex_110))) (<= 1 v_prenex_104) (not (= c_l3_insert_~list.base v_prenex_108)) (<= 8 v_prenex_103) (<= (mod .cse1 4294967296) 0) (not (= l3_insert_~item~1.base c_l3_insert_~list.base)) (not (= l3_insert_~item~1.base v_prenex_110)) (not (= c_l3_insert_~list.base v_prenex_118)))))) (and .cse0 (exists ((calloc_model_~size Int) (v_prenex_96 Int) (v_prenex_95 Int) (v_prenex_116 Int) (v_prenex_114 Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_113 Int) (v_prenex_111 Int) (|l4_insert_#t~ret6.base| Int) (calloc_model_~nmemb Int) (l4_insert_~item~0.base Int)) (let ((.cse3 (* v_prenex_96 v_prenex_95)) (.cse4 (select |c_#length| v_prenex_115))) (and (< 2147483647 (mod .cse3 4294967296)) (not (= v_prenex_115 v_prenex_114)) (or (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| |l4_insert_#t~ret6.base|)) (= v_prenex_115 |l4_insert_#t~ret6.base|)) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (not (= l4_insert_~item~0.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (or (= c_l3_insert_~list.base v_prenex_115) (= .cse3 (select |c_#length| c_l3_insert_~list.base))) (= (select |c_#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) (or (= l4_insert_~item~0.base v_prenex_115) (= (select |c_#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101))) (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (not (= c_l3_insert_~list.base v_prenex_114)) (<= 8 .cse4) (not (= l4_insert_~item~0.base v_prenex_114)) (not (= v_prenex_114 |l4_insert_#t~ret6.base|)) (= (* v_prenex_113 v_prenex_116) .cse4))))))) is different from false [2019-11-15 19:53:15,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:15,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:17,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:53:19,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (<= 8 (select |c_#length| c_l3_insert_~list.base))) (.cse6 (exists ((v_prenex_96 Int) (v_prenex_95 Int)) (let ((.cse12 (* v_prenex_96 v_prenex_95))) (and (< 2147483647 (mod .cse12 4294967296)) (<= 1 v_prenex_96) (<= 8 v_prenex_95) (= .cse12 (select |c_#length| c_l3_insert_~list.base)))))) (.cse0 (= c_l3_insert_~list.offset 4)) (.cse1 (exists ((v_prenex_103 Int) (v_prenex_104 Int)) (let ((.cse11 (* v_prenex_104 v_prenex_103))) (and (= .cse11 (select |c_#length| c_l3_insert_~list.base)) (<= 1 v_prenex_104) (<= 8 v_prenex_103) (<= (mod .cse11 4294967296) 0)))))) (or (and .cse0 .cse1 (exists ((v_prenex_117 Int) (v_prenex_106 Int) (v_prenex_110 Int) (v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int) (v_prenex_98 Int) (v_prenex_97 Int) (l3_insert_~item~1.base Int) (v_prenex_118 Int) (v_prenex_107 Int) (v_prenex_119 Int)) (let ((.cse2 (select |c_#length| v_prenex_119))) (and (not (= l3_insert_~item~1.base v_prenex_118)) (= (select |c_#length| v_prenex_118) (* v_prenex_120 v_prenex_122)) (not (= v_prenex_110 v_prenex_119)) (not (= v_prenex_118 v_prenex_110)) (= (* v_prenex_121 v_prenex_117) .cse2) (not (= l3_insert_~item~1.base v_prenex_119)) (= (* v_prenex_107 v_prenex_106) (select |c_#length| v_prenex_110)) (<= 8 .cse2) (not (= v_prenex_119 v_prenex_118)) (not (= v_prenex_110 c_l3_insert_~list.base)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| l3_insert_~item~1.base)) (not (= l3_insert_~item~1.base c_l3_insert_~list.base)) (not (= l3_insert_~item~1.base v_prenex_110)) (not (= c_l3_insert_~list.base v_prenex_119)) (not (= c_l3_insert_~list.base v_prenex_118)))))) (and .cse0 .cse1 (exists ((v_prenex_98 Int) (v_prenex_97 Int) (v_prenex_109 Int) (v_prenex_118 Int) (v_prenex_107 Int) (v_prenex_108 Int) (v_prenex_119 Int) (v_prenex_105 Int) (v_prenex_117 Int) (v_prenex_106 Int) (v_prenex_110 Int) (v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int) (l3_insert_~item~1.base Int)) (let ((.cse3 (select |c_#length| v_prenex_119))) (and (not (= l3_insert_~item~1.base v_prenex_118)) (= (select |c_#length| v_prenex_118) (* v_prenex_120 v_prenex_122)) (not (= v_prenex_108 v_prenex_118)) (not (= l3_insert_~item~1.base v_prenex_108)) (not (= v_prenex_118 v_prenex_110)) (= (* v_prenex_121 v_prenex_117) .cse3) (= (* v_prenex_107 v_prenex_106) (select |c_#length| v_prenex_110)) (not (= v_prenex_110 v_prenex_108)) (= (select |c_#length| v_prenex_108) (* v_prenex_105 v_prenex_109)) (<= 8 .cse3) (not (= v_prenex_119 v_prenex_118)) (not (= v_prenex_110 c_l3_insert_~list.base)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| l3_insert_~item~1.base)) (not (= c_l3_insert_~list.base v_prenex_108)) (not (= l3_insert_~item~1.base c_l3_insert_~list.base)) (not (= l3_insert_~item~1.base v_prenex_110)) (not (= c_l3_insert_~list.base v_prenex_118)))))) (and .cse0 (exists ((v_prenex_116 Int) (v_prenex_113 Int)) (= (* v_prenex_113 v_prenex_116) (select |c_#length| c_l3_insert_~list.base))) (exists ((v_prenex_114 Int) (calloc_model_~size Int) (v_prenex_112 Int) (v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_111 Int) (|l4_insert_#t~ret6.base| Int) (calloc_model_~nmemb Int) (l4_insert_~item~0.base Int)) (and (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| |l4_insert_#t~ret6.base|)) (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (not (= c_l3_insert_~list.base v_prenex_114)) (not (= l4_insert_~item~0.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (not (= l4_insert_~item~0.base v_prenex_114)) (not (= v_prenex_114 |l4_insert_#t~ret6.base|)) (= (select |c_#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) (= (select |c_#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)))) .cse4) (and .cse0 (exists ((v_prenex_103 Int) (v_prenex_104 Int)) (and (<= 1 v_prenex_104) (<= 8 v_prenex_103) (<= (mod (* v_prenex_104 v_prenex_103) 4294967296) 0))) .cse4 (exists ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_110 Int) (v_prenex_122 Int) (v_prenex_120 Int) (v_prenex_98 Int) (v_prenex_97 Int) (l3_insert_~item~1.base Int) (v_prenex_109 Int) (v_prenex_118 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (and (not (= l3_insert_~item~1.base v_prenex_118)) (= (select |c_#length| v_prenex_118) (* v_prenex_120 v_prenex_122)) (not (= v_prenex_108 v_prenex_118)) (not (= l3_insert_~item~1.base v_prenex_108)) (not (= v_prenex_118 v_prenex_110)) (= (* v_prenex_107 v_prenex_106) (select |c_#length| v_prenex_110)) (not (= v_prenex_110 v_prenex_108)) (= (select |c_#length| v_prenex_108) (* v_prenex_105 v_prenex_109)) (not (= v_prenex_110 c_l3_insert_~list.base)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| l3_insert_~item~1.base)) (not (= c_l3_insert_~list.base v_prenex_108)) (not (= l3_insert_~item~1.base c_l3_insert_~list.base)) (not (= l3_insert_~item~1.base v_prenex_110)) (not (= c_l3_insert_~list.base v_prenex_118)))) (exists ((v_prenex_117 Int) (v_prenex_121 Int)) (= (* v_prenex_121 v_prenex_117) (select |c_#length| c_l3_insert_~list.base)))) (and .cse0 (exists ((v_prenex_116 Int) (v_prenex_114 Int) (calloc_model_~size Int) (v_prenex_115 Int) (v_prenex_112 Int) (v_prenex_101 Int) (v_prenex_102 Int) (v_prenex_113 Int) (v_prenex_111 Int) (|l4_insert_#t~ret6.base| Int) (calloc_model_~nmemb Int) (l4_insert_~item~0.base Int)) (let ((.cse5 (select |c_#length| v_prenex_115))) (and (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| |l4_insert_#t~ret6.base|)) (not (= v_prenex_115 v_prenex_114)) (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (not (= c_l3_insert_~list.base v_prenex_114)) (not (= l4_insert_~item~0.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (<= 8 .cse5) (not (= l4_insert_~item~0.base v_prenex_114)) (not (= v_prenex_114 |l4_insert_#t~ret6.base|)) (= (select |c_#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) (= (select |c_#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)) (= (* v_prenex_113 v_prenex_116) .cse5)))) .cse6) (and (exists ((v_prenex_105 Int) (v_prenex_117 Int) (v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int) (v_prenex_98 Int) (v_prenex_97 Int) (l3_insert_~item~1.base Int) (v_prenex_109 Int) (v_prenex_118 Int) (v_prenex_108 Int) (v_prenex_119 Int)) (let ((.cse7 (select |c_#length| v_prenex_119))) (and (not (= l3_insert_~item~1.base v_prenex_118)) (= (select |c_#length| v_prenex_118) (* v_prenex_120 v_prenex_122)) (not (= v_prenex_108 v_prenex_119)) (not (= v_prenex_108 v_prenex_118)) (not (= l3_insert_~item~1.base v_prenex_108)) (= (* v_prenex_121 v_prenex_117) .cse7) (not (= l3_insert_~item~1.base v_prenex_119)) (= (select |c_#length| v_prenex_108) (* v_prenex_105 v_prenex_109)) (<= 8 .cse7) (not (= v_prenex_119 v_prenex_118)) (= (* v_prenex_97 v_prenex_98) (select |c_#length| l3_insert_~item~1.base)) (not (= c_l3_insert_~list.base v_prenex_108)) (not (= l3_insert_~item~1.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base v_prenex_119)) (not (= c_l3_insert_~list.base v_prenex_118))))) .cse0 .cse1) (and .cse0 .cse6 (exists ((v_prenex_116 Int) (v_prenex_114 Int) (v_prenex_112 Int) (v_prenex_101 Int) (v_prenex_113 Int) (v_prenex_102 Int) (v_prenex_111 Int) (|l4_insert_#t~ret6.base| Int) (l4_insert_~item~0.base Int)) (let ((.cse8 (select |c_#length| |l4_insert_#t~ret6.base|))) (and (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (= (* v_prenex_113 v_prenex_116) .cse8) (not (= c_l3_insert_~list.base v_prenex_114)) (not (= l4_insert_~item~0.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (not (= l4_insert_~item~0.base v_prenex_114)) (<= 8 .cse8) (not (= v_prenex_114 |l4_insert_#t~ret6.base|)) (= (select |c_#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) (= (select |c_#length| l4_insert_~item~0.base) (* v_prenex_102 v_prenex_101)))))) (and .cse0 .cse6 (exists ((v_prenex_116 Int) (v_prenex_114 Int) (calloc_model_~size Int) (v_prenex_112 Int) (v_prenex_113 Int) (v_prenex_111 Int) (|l4_insert_#t~ret6.base| Int) (calloc_model_~nmemb Int) (l4_insert_~item~0.base Int)) (let ((.cse9 (select |c_#length| l4_insert_~item~0.base))) (and (= (* calloc_model_~size calloc_model_~nmemb) (select |c_#length| |l4_insert_#t~ret6.base|)) (not (= l4_insert_~item~0.base |l4_insert_#t~ret6.base|)) (not (= c_l3_insert_~list.base v_prenex_114)) (not (= l4_insert_~item~0.base c_l3_insert_~list.base)) (not (= c_l3_insert_~list.base |l4_insert_#t~ret6.base|)) (not (= l4_insert_~item~0.base v_prenex_114)) (not (= v_prenex_114 |l4_insert_#t~ret6.base|)) (= (select |c_#length| v_prenex_114) (* v_prenex_112 v_prenex_111)) (= .cse9 (* v_prenex_113 v_prenex_116)) (<= 8 .cse9))))) (and .cse0 .cse1 (exists ((v_prenex_105 Int) (v_prenex_106 Int) (v_prenex_117 Int) (v_prenex_110 Int) (v_prenex_121 Int) (v_prenex_122 Int) (v_prenex_120 Int) (l3_insert_~item~1.base Int) (v_prenex_109 Int) (v_prenex_118 Int) (v_prenex_107 Int) (v_prenex_108 Int)) (let ((.cse10 (select |c_#length| l3_insert_~item~1.base))) (and (not (= l3_insert_~item~1.base v_prenex_118)) (= (select |c_#length| v_prenex_118) (* v_prenex_120 v_prenex_122)) (not (= v_prenex_108 v_prenex_118)) (not (= l3_insert_~item~1.base v_prenex_108)) (not (= v_prenex_118 v_prenex_110)) (= (* v_prenex_107 v_prenex_106) (select |c_#length| v_prenex_110)) (not (= v_prenex_110 v_prenex_108)) (<= 8 .cse10) (= (select |c_#length| v_prenex_108) (* v_prenex_105 v_prenex_109)) (not (= v_prenex_110 c_l3_insert_~list.base)) (= (* v_prenex_121 v_prenex_117) .cse10) (not (= c_l3_insert_~list.base v_prenex_108)) (not (= l3_insert_~item~1.base c_l3_insert_~list.base)) (not (= l3_insert_~item~1.base v_prenex_110)) (not (= c_l3_insert_~list.base v_prenex_118)))))))) is different from false [2019-11-15 19:53:33,488 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-15 19:53:33,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:53:33,690 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:626) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:118) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) 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.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:178) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:162) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:132) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:305) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:580) 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.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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 48 more [2019-11-15 19:53:33,693 INFO L168 Benchmark]: Toolchain (without parser) took 535749.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 939.3 MB in the beginning and 920.0 MB in the end (delta: 19.3 MB). Peak memory consumption was 187.1 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:33,693 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:53:33,694 INFO L168 Benchmark]: CACSL2BoogieTranslator took 694.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:33,694 INFO L168 Benchmark]: Boogie Preprocessor took 94.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:33,694 INFO L168 Benchmark]: RCFGBuilder took 1095.21 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: 98.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:33,694 INFO L168 Benchmark]: TraceAbstraction took 533861.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.8 MB). Free memory was 995.9 MB in the beginning and 920.0 MB in the end (delta: 75.8 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:33,696 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 694.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -165.8 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 94.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1095.21 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: 98.6 MB). Peak memory consumption was 98.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 533861.24 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 28.8 MB). Free memory was 995.9 MB in the beginning and 920.0 MB in the end (delta: 75.8 MB). Peak memory consumption was 104.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-15 19:53:35,514 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:53:35,515 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:53:35,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:53:35,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:53:35,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:53:35,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:53:35,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:53:35,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:53:35,544 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:53:35,545 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:53:35,546 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:53:35,547 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:53:35,550 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:53:35,550 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:53:35,551 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:53:35,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:53:35,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:53:35,558 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:53:35,561 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:53:35,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:53:35,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:53:35,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:53:35,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:53:35,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:53:35,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:53:35,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:53:35,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:53:35,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:53:35,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:53:35,576 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:53:35,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:53:35,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:53:35,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:53:35,582 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:53:35,582 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:53:35,583 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:53:35,583 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:53:35,584 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:53:35,584 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:53:35,585 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:53:35,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-15 19:53:35,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:53:35,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:53:35,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:53:35,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:53:35,602 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:53:35,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:53:35,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:53:35,602 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 19:53:35,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:53:35,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:53:35,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:53:35,603 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 19:53:35,603 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 19:53:35,603 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 19:53:35,604 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:53:35,604 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 19:53:35,604 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 19:53:35,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:53:35,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:53:35,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:53:35,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:53:35,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:53:35,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:53:35,608 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:53:35,608 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:53:35,609 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:53:35,609 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 19:53:35,609 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 19:53:35,610 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 19:53:35,610 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_2f31c9e9-e1de-4751-a74c-b8c998980760/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 -> b34bc11a33e7949c7dab475214181d5ea8e454c9 [2019-11-15 19:53:35,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:53:35,668 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:53:35,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:53:35,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:53:35,680 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:53:35,680 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0235-1.i [2019-11-15 19:53:35,741 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/3ef64773b/e53cee62027f422bbafc13a5974b0f72/FLAG8df17b8b4 [2019-11-15 19:53:36,193 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:53:36,194 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/sv-benchmarks/c/memsafety/test-0235-1.i [2019-11-15 19:53:36,216 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/3ef64773b/e53cee62027f422bbafc13a5974b0f72/FLAG8df17b8b4 [2019-11-15 19:53:36,573 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/data/3ef64773b/e53cee62027f422bbafc13a5974b0f72 [2019-11-15 19:53:36,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:53:36,577 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 19:53:36,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:53:36,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:53:36,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:53:36,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:53:36" (1/1) ... [2019-11-15 19:53:36,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0caeff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:36, skipping insertion in model container [2019-11-15 19:53:36,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:53:36" (1/1) ... [2019-11-15 19:53:36,592 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:53:36,645 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:53:37,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:53:37,113 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:53:37,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:53:37,283 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:53:37,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37 WrapperNode [2019-11-15 19:53:37,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:53:37,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:53:37,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:53:37,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:53:37,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,297 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,361 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,377 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... [2019-11-15 19:53:37,388 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:53:37,389 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:53:37,389 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:53:37,389 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:53:37,390 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:53:37,442 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 19:53:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:53:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 19:53:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 19:53:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 19:53:37,443 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 19:53:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 19:53:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2019-11-15 19:53:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure zalloc_or_die [2019-11-15 19:53:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure l4_insert [2019-11-15 19:53:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure l3_insert [2019-11-15 19:53:37,444 INFO L138 BoogieDeclarations]: Found implementation of procedure l2_insert [2019-11-15 19:53:37,445 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_insert [2019-11-15 19:53:37,445 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_insert [2019-11-15 19:53:37,445 INFO L138 BoogieDeclarations]: Found implementation of procedure l4_destroy [2019-11-15 19:53:37,445 INFO L138 BoogieDeclarations]: Found implementation of procedure l3_destroy [2019-11-15 19:53:37,445 INFO L138 BoogieDeclarations]: Found implementation of procedure l2_destroy [2019-11-15 19:53:37,446 INFO L138 BoogieDeclarations]: Found implementation of procedure l1_destroy [2019-11-15 19:53:37,446 INFO L138 BoogieDeclarations]: Found implementation of procedure l0_destroy [2019-11-15 19:53:37,446 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 19:53:37,446 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-15 19:53:37,446 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 19:53:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 19:53:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 19:53:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 19:53:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 19:53:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 19:53:37,447 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 19:53:37,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 19:53:37,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 19:53:37,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 19:53:37,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 19:53:37,448 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 19:53:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 19:53:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 19:53:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 19:53:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 19:53:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 19:53:37,449 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 19:53:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 19:53:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 19:53:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 19:53:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 19:53:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 19:53:37,450 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 19:53:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 19:53:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 19:53:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 19:53:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 19:53:37,451 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 19:53:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 19:53:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 19:53:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 19:53:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 19:53:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 19:53:37,452 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 19:53:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 19:53:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 19:53:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 19:53:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 19:53:37,453 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 19:53:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 19:53:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 19:53:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 19:53:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 19:53:37,454 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 19:53:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 19:53:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 19:53:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 19:53:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 19:53:37,455 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 19:53:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 19:53:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 19:53:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 19:53:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 19:53:37,456 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 19:53:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 19:53:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 19:53:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 19:53:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 19:53:37,457 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 19:53:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 19:53:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 19:53:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 19:53:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 19:53:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 19:53:37,458 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 19:53:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 19:53:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 19:53:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 19:53:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 19:53:37,459 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 19:53:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 19:53:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 19:53:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 19:53:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 19:53:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 19:53:37,460 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 19:53:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 19:53:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 19:53:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 19:53:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 19:53:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 19:53:37,461 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 19:53:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 19:53:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 19:53:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 19:53:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 19:53:37,462 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 19:53:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 19:53:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 19:53:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 19:53:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 19:53:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 19:53:37,463 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 19:53:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 19:53:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 19:53:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 19:53:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 19:53:37,464 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 19:53:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 19:53:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 19:53:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 19:53:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 19:53:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 19:53:37,465 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 19:53:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 19:53:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 19:53:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 19:53:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-15 19:53:37,466 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-11-15 19:53:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure memccpy [2019-11-15 19:53:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-15 19:53:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-11-15 19:53:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure memchr [2019-11-15 19:53:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure strcpy [2019-11-15 19:53:37,467 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-11-15 19:53:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure strcat [2019-11-15 19:53:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure strncat [2019-11-15 19:53:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-11-15 19:53:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure strncmp [2019-11-15 19:53:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll [2019-11-15 19:53:37,468 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm [2019-11-15 19:53:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure strcoll_l [2019-11-15 19:53:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure strxfrm_l [2019-11-15 19:53:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure strdup [2019-11-15 19:53:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure strndup [2019-11-15 19:53:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure strchr [2019-11-15 19:53:37,469 INFO L130 BoogieDeclarations]: Found specification of procedure strrchr [2019-11-15 19:53:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-11-15 19:53:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure strspn [2019-11-15 19:53:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure strpbrk [2019-11-15 19:53:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure strstr [2019-11-15 19:53:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure strtok [2019-11-15 19:53:37,470 INFO L130 BoogieDeclarations]: Found specification of procedure __strtok_r [2019-11-15 19:53:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure strtok_r [2019-11-15 19:53:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-11-15 19:53:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure strnlen [2019-11-15 19:53:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure strerror [2019-11-15 19:53:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_r [2019-11-15 19:53:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure strerror_l [2019-11-15 19:53:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure bcmp [2019-11-15 19:53:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure bcopy [2019-11-15 19:53:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure bzero [2019-11-15 19:53:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure index [2019-11-15 19:53:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure rindex [2019-11-15 19:53:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure ffs [2019-11-15 19:53:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure ffsl [2019-11-15 19:53:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure ffsll [2019-11-15 19:53:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp [2019-11-15 19:53:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-11-15 19:53:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure strcasecmp_l [2019-11-15 19:53:37,473 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp_l [2019-11-15 19:53:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure explicit_bzero [2019-11-15 19:53:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure strsep [2019-11-15 19:53:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure strsignal [2019-11-15 19:53:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure __stpcpy [2019-11-15 19:53:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure stpcpy [2019-11-15 19:53:37,474 INFO L130 BoogieDeclarations]: Found specification of procedure __stpncpy [2019-11-15 19:53:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure stpncpy [2019-11-15 19:53:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2019-11-15 19:53:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 19:53:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-15 19:53:37,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-15 19:53:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure zalloc_or_die [2019-11-15 19:53:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure l4_insert [2019-11-15 19:53:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 19:53:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 19:53:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure l3_insert [2019-11-15 19:53:37,476 INFO L130 BoogieDeclarations]: Found specification of procedure l2_insert [2019-11-15 19:53:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure l1_insert [2019-11-15 19:53:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure l0_insert [2019-11-15 19:53:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure l4_destroy [2019-11-15 19:53:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 19:53:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure l3_destroy [2019-11-15 19:53:37,477 INFO L130 BoogieDeclarations]: Found specification of procedure l2_destroy [2019-11-15 19:53:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure l1_destroy [2019-11-15 19:53:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure l0_destroy [2019-11-15 19:53:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 19:53:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 19:53:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 19:53:37,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 19:53:37,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:53:38,178 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 19:53:38,727 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:53:38,727 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 19:53:38,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:53:38 BoogieIcfgContainer [2019-11-15 19:53:38,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:53:38,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:53:38,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:53:38,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:53:38,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:53:36" (1/3) ... [2019-11-15 19:53:38,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:53:38, skipping insertion in model container [2019-11-15 19:53:38,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:53:37" (2/3) ... [2019-11-15 19:53:38,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@445510 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:53:38, skipping insertion in model container [2019-11-15 19:53:38,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:53:38" (3/3) ... [2019-11-15 19:53:38,737 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0235-1.i [2019-11-15 19:53:38,746 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:53:38,755 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 85 error locations. [2019-11-15 19:53:38,765 INFO L249 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2019-11-15 19:53:38,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:53:38,785 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 19:53:38,785 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:53:38,785 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:53:38,785 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:53:38,786 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:53:38,786 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:53:38,786 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:53:38,816 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states. [2019-11-15 19:53:38,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-11-15 19:53:38,826 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:53:38,827 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:53:38,830 INFO L410 AbstractCegarLoop]: === Iteration 1 === [l3_destroyErr0REQUIRES_VIOLATION, l3_destroyErr1REQUIRES_VIOLATION, l3_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr2REQUIRES_VIOLATION, l3_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l3_destroyErr3REQUIRES_VIOLATION, l0_insertErr2REQUIRES_VIOLATION, l0_insertErr3REQUIRES_VIOLATION, l0_insertErr4REQUIRES_VIOLATION, l0_insertErr5REQUIRES_VIOLATION, l0_insertErr0REQUIRES_VIOLATION, l0_insertErr1REQUIRES_VIOLATION, l4_destroyErr3ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr0REQUIRES_VIOLATION, l4_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr1REQUIRES_VIOLATION, l4_destroyErr6REQUIRES_VIOLATION, l4_destroyErr2ASSERT_VIOLATIONMEMORY_FREE, l4_destroyErr5REQUIRES_VIOLATION, l4_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_insertErr2REQUIRES_VIOLATION, l2_insertErr3REQUIRES_VIOLATION, l2_insertErr5REQUIRES_VIOLATION, l2_insertErr4REQUIRES_VIOLATION, l2_insertErr1REQUIRES_VIOLATION, l2_insertErr0REQUIRES_VIOLATION, l1_destroyErr2REQUIRES_VIOLATION, l1_destroyErr3REQUIRES_VIOLATION, l1_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l1_destroyErr1REQUIRES_VIOLATION, l1_destroyErr0REQUIRES_VIOLATION, l3_insertErr3REQUIRES_VIOLATION, l3_insertErr2REQUIRES_VIOLATION, l3_insertErr0REQUIRES_VIOLATION, l3_insertErr1REQUIRES_VIOLATION, l3_insertErr4REQUIRES_VIOLATION, l3_insertErr5REQUIRES_VIOLATION, l1_insertErr2REQUIRES_VIOLATION, l1_insertErr3REQUIRES_VIOLATION, l1_insertErr5REQUIRES_VIOLATION, l1_insertErr4REQUIRES_VIOLATION, l1_insertErr1REQUIRES_VIOLATION, l1_insertErr0REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr12ENSURES_VIOLATIONMEMORY_LEAK, mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, calloc_modelErr0REQUIRES_VIOLATION, calloc_modelErr1REQUIRES_VIOLATION, l0_destroyErr3REQUIRES_VIOLATION, l0_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr2REQUIRES_VIOLATION, l0_destroyErr1REQUIRES_VIOLATION, l0_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l0_destroyErr0REQUIRES_VIOLATION, l0_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l4_insertErr3REQUIRES_VIOLATION, l4_insertErr2REQUIRES_VIOLATION, l4_insertErr7REQUIRES_VIOLATION, l4_insertErr6REQUIRES_VIOLATION, l4_insertErr1REQUIRES_VIOLATION, l4_insertErr0REQUIRES_VIOLATION, l4_insertErr5REQUIRES_VIOLATION, l4_insertErr4REQUIRES_VIOLATION, l2_destroyErr1REQUIRES_VIOLATION, l2_destroyErr0REQUIRES_VIOLATION, l2_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, l2_destroyErr3REQUIRES_VIOLATION, l2_destroyErr2REQUIRES_VIOLATION]=== [2019-11-15 19:53:38,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:53:38,835 INFO L82 PathProgramCache]: Analyzing trace with hash 43031830, now seen corresponding path program 1 times [2019-11-15 19:53:38,845 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 19:53:38,845 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [749035446] [2019-11-15 19:53:38,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2f31c9e9-e1de-4751-a74c-b8c998980760/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:53:39,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-15 19:53:39,074 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort C_DOUBLE not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableFunctionSymbol.defineOrDeclare(DeclarableFunctionSymbol.java:160) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:143) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:168) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferSymbols(SmtFunctionsAndAxioms.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleTraceCheck.createExternalManagedScript(IpTcStrategyModuleTraceCheck.java:81) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCvc4.constructManagedScript(IpTcStrategyModuleCvc4.java:95) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.checkFeasibility(TraceAbstractionRefinementEngine.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.executeStrategy(TraceAbstractionRefinementEngine.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.RefinementEngineFactory.runRefinementEngine(RefinementEngineFactory.java:124) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-15 19:53:39,079 INFO L168 Benchmark]: Toolchain (without parser) took 2501.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 941.6 MB in the beginning and 1.0 GB in the end (delta: -59.7 MB). Peak memory consumption was 101.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:39,080 INFO L168 Benchmark]: CDTParser took 0.27 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-15 19:53:39,081 INFO L168 Benchmark]: CACSL2BoogieTranslator took 705.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:39,083 INFO L168 Benchmark]: Boogie Preprocessor took 103.85 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:53:39,084 INFO L168 Benchmark]: RCFGBuilder took 1339.87 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: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:39,085 INFO L168 Benchmark]: TraceAbstraction took 347.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-15 19:53:39,087 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 705.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 103.85 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 1339.87 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: 109.7 MB). Peak memory consumption was 109.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 347.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 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...