./Ultimate.py --spec ../../sv-benchmarks/c/Systems_DeviceDriversLinux64_ReachSafety.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c -s /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7fc5757f33cca8abec0d298407c4598828d90b8e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c -s /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7fc5757f33cca8abec0d298407c4598828d90b8e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 17:12:34,767 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:12:34,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:12:34,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:12:34,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:12:34,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:12:34,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:12:34,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:12:34,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:12:34,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:12:34,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:12:34,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:12:34,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:12:34,782 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:12:34,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:12:34,783 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:12:34,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:12:34,785 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:12:34,786 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:12:34,787 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:12:34,788 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:12:34,789 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:12:34,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:12:34,791 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:12:34,791 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:12:34,792 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:12:34,792 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:12:34,793 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:12:34,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:12:34,794 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:12:34,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:12:34,795 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:12:34,795 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:12:34,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:12:34,796 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:12:34,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:12:34,796 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-18 17:12:34,803 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:12:34,803 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:12:34,804 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:12:34,804 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 17:12:34,804 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:12:34,804 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:12:34,805 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:12:34,805 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:12:34,805 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 17:12:34,805 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:12:34,805 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:12:34,805 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:12:34,805 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:12:34,806 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:12:34,806 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:12:34,806 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:12:34,806 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:12:34,806 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:12:34,806 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:12:34,806 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:12:34,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:12:34,807 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:12:34,807 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:12:34,807 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:12:34,807 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 17:12:34,807 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:12:34,807 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 17:12:34,808 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:12:34,808 INFO L133 SettingsManager]: * To the following directory=dump/ 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/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/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 ! call(__VERIFIER_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fc5757f33cca8abec0d298407c4598828d90b8e [2018-11-18 17:12:34,830 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:12:34,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:12:34,838 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:12:34,839 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:12:34,839 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:12:34,840 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-18 17:12:34,882 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/fed5011d9/966ad6a1550f415eab3231fef87c20ec/FLAG71a13b538 [2018-11-18 17:12:35,430 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:12:35,431 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-18 17:12:35,457 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/fed5011d9/966ad6a1550f415eab3231fef87c20ec/FLAG71a13b538 [2018-11-18 17:12:35,858 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/fed5011d9/966ad6a1550f415eab3231fef87c20ec [2018-11-18 17:12:35,861 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:12:35,862 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 17:12:35,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:12:35,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:12:35,864 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:12:35,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:12:35" (1/1) ... [2018-11-18 17:12:35,867 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e34127d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:35, skipping insertion in model container [2018-11-18 17:12:35,867 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:12:35" (1/1) ... [2018-11-18 17:12:35,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:12:35,930 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:12:36,719 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:12:36,738 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:12:36,990 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:12:37,049 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:12:37,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37 WrapperNode [2018-11-18 17:12:37,049 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:12:37,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:12:37,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:12:37,050 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:12:37,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... [2018-11-18 17:12:37,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:12:37,114 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:12:37,114 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:12:37,114 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:12:37,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/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 [2018-11-18 17:12:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:12:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:12:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2018-11-18 17:12:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-18 17:12:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-11-18 17:12:37,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2018-11-18 17:12:37,165 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2018-11-18 17:12:37,166 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2018-11-18 17:12:37,166 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2018-11-18 17:12:37,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 17:12:37,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 17:12:37,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 17:12:37,169 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 17:12:37,170 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2018-11-18 17:12:37,171 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~int~TO~int [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-18 17:12:37,172 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2018-11-18 17:12:37,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 17:12:37,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:12:38,050 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:12:38,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:12:38 BoogieIcfgContainer [2018-11-18 17:12:38,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:12:38,051 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:12:38,051 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:12:38,054 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:12:38,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:12:35" (1/3) ... [2018-11-18 17:12:38,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890a41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:12:38, skipping insertion in model container [2018-11-18 17:12:38,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:12:37" (2/3) ... [2018-11-18 17:12:38,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2890a41c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:12:38, skipping insertion in model container [2018-11-18 17:12:38,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:12:38" (3/3) ... [2018-11-18 17:12:38,057 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-18 17:12:38,065 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:12:38,073 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:12:38,086 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:12:38,112 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:12:38,113 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:12:38,113 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:12:38,113 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:12:38,113 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:12:38,114 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:12:38,114 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:12:38,114 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:12:38,114 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:12:38,131 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-11-18 17:12:38,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 17:12:38,138 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:38,138 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-18 17:12:38,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:38,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:38,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1625761540, now seen corresponding path program 1 times [2018-11-18 17:12:38,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:38,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:38,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:38,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:38,433 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 17:12:38,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:38,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:12:38,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:12:38,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:12:38,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:38,451 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2018-11-18 17:12:38,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:38,839 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2018-11-18 17:12:38,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:12:38,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 17:12:38,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:38,849 INFO L225 Difference]: With dead ends: 288 [2018-11-18 17:12:38,849 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 17:12:38,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 17:12:38,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-11-18 17:12:38,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 17:12:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2018-11-18 17:12:38,888 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 63 [2018-11-18 17:12:38,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:38,889 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2018-11-18 17:12:38,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:12:38,889 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2018-11-18 17:12:38,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 17:12:38,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:38,892 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:38,892 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:38,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:38,892 INFO L82 PathProgramCache]: Analyzing trace with hash -335821981, now seen corresponding path program 1 times [2018-11-18 17:12:38,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:38,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:38,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:38,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:38,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:38,985 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 17:12:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:12:38,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:12:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:12:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:38,988 INFO L87 Difference]: Start difference. First operand 176 states and 216 transitions. Second operand 3 states. [2018-11-18 17:12:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:39,020 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2018-11-18 17:12:39,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:12:39,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 17:12:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:39,022 INFO L225 Difference]: With dead ends: 186 [2018-11-18 17:12:39,023 INFO L226 Difference]: Without dead ends: 181 [2018-11-18 17:12:39,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:39,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-18 17:12:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-11-18 17:12:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 17:12:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2018-11-18 17:12:39,037 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 66 [2018-11-18 17:12:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:39,038 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2018-11-18 17:12:39,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:12:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2018-11-18 17:12:39,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 17:12:39,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:39,039 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:39,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:39,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:39,040 INFO L82 PathProgramCache]: Analyzing trace with hash -278563679, now seen corresponding path program 1 times [2018-11-18 17:12:39,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:39,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:39,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 17:12:39,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:39,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:12:39,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:12:39,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:12:39,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:39,128 INFO L87 Difference]: Start difference. First operand 176 states and 215 transitions. Second operand 3 states. [2018-11-18 17:12:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:39,168 INFO L93 Difference]: Finished difference Result 463 states and 586 transitions. [2018-11-18 17:12:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:12:39,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 17:12:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:39,172 INFO L225 Difference]: With dead ends: 463 [2018-11-18 17:12:39,172 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 17:12:39,173 INFO L604 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 [2018-11-18 17:12:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 17:12:39,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2018-11-18 17:12:39,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 17:12:39,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 385 transitions. [2018-11-18 17:12:39,191 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 385 transitions. Word has length 66 [2018-11-18 17:12:39,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:39,192 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 385 transitions. [2018-11-18 17:12:39,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:12:39,192 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 385 transitions. [2018-11-18 17:12:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 17:12:39,193 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:39,193 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:39,194 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:39,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:39,194 INFO L82 PathProgramCache]: Analyzing trace with hash -3425416, now seen corresponding path program 1 times [2018-11-18 17:12:39,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:39,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:39,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:39,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:39,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 17:12:39,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:39,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:12:39,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:12:39,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:12:39,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:39,273 INFO L87 Difference]: Start difference. First operand 307 states and 385 transitions. Second operand 3 states. [2018-11-18 17:12:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:39,304 INFO L93 Difference]: Finished difference Result 659 states and 839 transitions. [2018-11-18 17:12:39,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:12:39,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-18 17:12:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:39,307 INFO L225 Difference]: With dead ends: 659 [2018-11-18 17:12:39,307 INFO L226 Difference]: Without dead ends: 383 [2018-11-18 17:12:39,309 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:39,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-18 17:12:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 373. [2018-11-18 17:12:39,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 17:12:39,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 475 transitions. [2018-11-18 17:12:39,327 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 475 transitions. Word has length 85 [2018-11-18 17:12:39,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:39,327 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 475 transitions. [2018-11-18 17:12:39,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:12:39,327 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2018-11-18 17:12:39,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 17:12:39,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:39,329 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:39,329 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:39,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:39,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1059655897, now seen corresponding path program 1 times [2018-11-18 17:12:39,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:39,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:39,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 17:12:39,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:39,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:12:39,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:12:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:12:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:39,438 INFO L87 Difference]: Start difference. First operand 373 states and 475 transitions. Second operand 3 states. [2018-11-18 17:12:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:39,457 INFO L93 Difference]: Finished difference Result 731 states and 944 transitions. [2018-11-18 17:12:39,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:12:39,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-18 17:12:39,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:39,459 INFO L225 Difference]: With dead ends: 731 [2018-11-18 17:12:39,459 INFO L226 Difference]: Without dead ends: 389 [2018-11-18 17:12:39,460 INFO L604 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 [2018-11-18 17:12:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-11-18 17:12:39,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 377. [2018-11-18 17:12:39,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-11-18 17:12:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 479 transitions. [2018-11-18 17:12:39,475 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 479 transitions. Word has length 99 [2018-11-18 17:12:39,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:39,476 INFO L480 AbstractCegarLoop]: Abstraction has 377 states and 479 transitions. [2018-11-18 17:12:39,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:12:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 479 transitions. [2018-11-18 17:12:39,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 17:12:39,477 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:39,477 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:39,478 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:39,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:39,478 INFO L82 PathProgramCache]: Analyzing trace with hash 220207781, now seen corresponding path program 1 times [2018-11-18 17:12:39,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:39,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:39,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:39,636 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 17:12:39,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:39,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:12:39,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:12:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:12:39,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:39,637 INFO L87 Difference]: Start difference. First operand 377 states and 479 transitions. Second operand 7 states. [2018-11-18 17:12:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:39,700 INFO L93 Difference]: Finished difference Result 718 states and 921 transitions. [2018-11-18 17:12:39,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:12:39,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-18 17:12:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:39,703 INFO L225 Difference]: With dead ends: 718 [2018-11-18 17:12:39,703 INFO L226 Difference]: Without dead ends: 372 [2018-11-18 17:12:39,704 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:39,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-11-18 17:12:39,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 366. [2018-11-18 17:12:39,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 17:12:39,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 462 transitions. [2018-11-18 17:12:39,719 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 462 transitions. Word has length 99 [2018-11-18 17:12:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:39,719 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 462 transitions. [2018-11-18 17:12:39,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:12:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 462 transitions. [2018-11-18 17:12:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 17:12:39,720 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:39,720 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:39,721 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:39,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1279701879, now seen corresponding path program 1 times [2018-11-18 17:12:39,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:39,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 17:12:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:39,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:12:39,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:12:39,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:12:39,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:39,889 INFO L87 Difference]: Start difference. First operand 366 states and 462 transitions. Second operand 7 states. [2018-11-18 17:12:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:40,773 INFO L93 Difference]: Finished difference Result 598 states and 749 transitions. [2018-11-18 17:12:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:12:40,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-11-18 17:12:40,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:40,776 INFO L225 Difference]: With dead ends: 598 [2018-11-18 17:12:40,776 INFO L226 Difference]: Without dead ends: 595 [2018-11-18 17:12:40,776 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:12:40,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-11-18 17:12:40,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 563. [2018-11-18 17:12:40,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-18 17:12:40,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 715 transitions. [2018-11-18 17:12:40,796 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 715 transitions. Word has length 105 [2018-11-18 17:12:40,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:40,796 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 715 transitions. [2018-11-18 17:12:40,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:12:40,797 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 715 transitions. [2018-11-18 17:12:40,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 17:12:40,798 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:40,798 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:40,798 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:40,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:40,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1921642484, now seen corresponding path program 1 times [2018-11-18 17:12:40,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:40,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:40,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:40,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 17:12:40,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:40,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:12:40,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:12:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:12:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:40,884 INFO L87 Difference]: Start difference. First operand 563 states and 715 transitions. Second operand 7 states. [2018-11-18 17:12:40,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:40,912 INFO L93 Difference]: Finished difference Result 966 states and 1227 transitions. [2018-11-18 17:12:40,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:12:40,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-18 17:12:40,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:40,914 INFO L225 Difference]: With dead ends: 966 [2018-11-18 17:12:40,914 INFO L226 Difference]: Without dead ends: 567 [2018-11-18 17:12:40,915 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:12:40,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-18 17:12:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 561. [2018-11-18 17:12:40,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-18 17:12:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 709 transitions. [2018-11-18 17:12:40,931 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 709 transitions. Word has length 111 [2018-11-18 17:12:40,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:40,931 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 709 transitions. [2018-11-18 17:12:40,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:12:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 709 transitions. [2018-11-18 17:12:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 17:12:40,933 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:40,933 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:40,933 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:40,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:40,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1498940658, now seen corresponding path program 1 times [2018-11-18 17:12:40,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:40,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:40,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:40,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 17:12:40,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:12:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:12:40,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:12:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:40,982 INFO L87 Difference]: Start difference. First operand 561 states and 709 transitions. Second operand 3 states. [2018-11-18 17:12:41,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:41,000 INFO L93 Difference]: Finished difference Result 964 states and 1217 transitions. [2018-11-18 17:12:41,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:12:41,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-11-18 17:12:41,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:41,003 INFO L225 Difference]: With dead ends: 964 [2018-11-18 17:12:41,003 INFO L226 Difference]: Without dead ends: 567 [2018-11-18 17:12:41,004 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:12:41,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-18 17:12:41,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 561. [2018-11-18 17:12:41,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-18 17:12:41,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 705 transitions. [2018-11-18 17:12:41,021 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 705 transitions. Word has length 111 [2018-11-18 17:12:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:41,022 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 705 transitions. [2018-11-18 17:12:41,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:12:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 705 transitions. [2018-11-18 17:12:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 17:12:41,023 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:41,024 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:41,024 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:41,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1991951255, now seen corresponding path program 1 times [2018-11-18 17:12:41,024 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:41,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:41,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:41,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-18 17:12:41,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:12:41,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:12:41,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:12:41,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:12:41,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:12:41,152 INFO L87 Difference]: Start difference. First operand 561 states and 705 transitions. Second operand 6 states. [2018-11-18 17:12:41,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:12:41,237 INFO L93 Difference]: Finished difference Result 1109 states and 1397 transitions. [2018-11-18 17:12:41,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:12:41,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-11-18 17:12:41,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:12:41,240 INFO L225 Difference]: With dead ends: 1109 [2018-11-18 17:12:41,240 INFO L226 Difference]: Without dead ends: 562 [2018-11-18 17:12:41,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:12:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-18 17:12:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2018-11-18 17:12:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-18 17:12:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 706 transitions. [2018-11-18 17:12:41,261 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 706 transitions. Word has length 126 [2018-11-18 17:12:41,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:12:41,262 INFO L480 AbstractCegarLoop]: Abstraction has 562 states and 706 transitions. [2018-11-18 17:12:41,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:12:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 706 transitions. [2018-11-18 17:12:41,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 17:12:41,263 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:12:41,263 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:12:41,264 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:12:41,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:12:41,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1811970013, now seen corresponding path program 1 times [2018-11-18 17:12:41,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:12:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:12:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:41,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:41,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:12:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 17:12:41,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:12:41,385 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:12:41,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:12:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:12:41,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:12:41,769 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-11-18 17:12:41,784 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-11-18 17:12:41,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:41,824 INFO L477 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 2 case distinctions, treesize of input 59 treesize of output 62 [2018-11-18 17:12:41,839 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:41,861 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:41,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 65 [2018-11-18 17:12:41,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:41,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:41,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-11-18 17:12:41,987 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,026 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,032 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 71 [2018-11-18 17:12:42,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,052 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,068 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 74 [2018-11-18 17:12:42,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-11-18 17:12:42,204 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,209 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,231 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 97 [2018-11-18 17:12:42,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 92 [2018-11-18 17:12:42,272 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:42,305 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:42,340 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:42,456 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,476 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,503 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,528 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,539 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 77 [2018-11-18 17:12:42,675 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-11-18 17:12:42,682 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,706 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 124 [2018-11-18 17:12:42,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 96 [2018-11-18 17:12:42,745 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:42,792 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:42,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,894 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,907 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,912 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,917 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,939 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:42,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 114 [2018-11-18 17:12:42,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 124 [2018-11-18 17:12:42,986 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:43,110 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,114 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,123 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,127 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,132 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,136 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,139 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,141 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,143 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,146 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,148 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,150 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,156 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 112 [2018-11-18 17:12:43,157 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-18 17:12:43,320 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:12:43,473 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:12:43,656 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 17:12:43,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-11-18 17:12:43,949 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2018-11-18 17:12:43,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:43,995 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 93 [2018-11-18 17:12:44,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-11-18 17:12:44,046 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,081 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,108 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,143 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,356 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-18 17:12:44,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2018-11-18 17:12:44,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 57 [2018-11-18 17:12:44,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-11-18 17:12:44,773 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,783 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,800 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,803 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,811 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:44,812 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 89 [2018-11-18 17:12:44,850 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-18 17:12:44,850 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,880 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,906 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,933 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:44,968 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:45,216 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-18 17:12:45,524 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-11-18 17:12:45,533 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-18 17:12:45,594 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-18 17:12:45,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-18 17:12:45,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,702 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,719 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,721 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:45,732 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 85 [2018-11-18 17:12:45,765 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 80 [2018-11-18 17:12:45,765 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:45,793 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:45,818 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:45,845 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:45,872 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:45,902 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,165 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-18 17:12:46,465 INFO L477 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 56 treesize of output 55 [2018-11-18 17:12:46,490 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-18 17:12:46,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-18 17:12:46,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-18 17:12:46,583 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-18 17:12:46,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,617 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,618 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:46,628 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 81 [2018-11-18 17:12:46,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-11-18 17:12:46,658 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,697 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,722 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,746 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,770 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,794 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:46,820 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,091 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-18 17:12:47,355 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-18 17:12:47,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-11-18 17:12:47,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-11-18 17:12:47,665 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-11-18 17:12:47,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,672 INFO L477 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 54 [2018-11-18 17:12:47,677 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,679 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-18 17:12:47,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-18 17:12:47,687 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,697 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,703 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,709 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,717 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,724 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:47,976 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,978 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-11-18 17:12:47,983 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-11-18 17:12:47,988 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-11-18 17:12:47,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,992 INFO L477 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 54 [2018-11-18 17:12:47,996 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,997 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:47,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-18 17:12:48,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:48,006 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:12:48,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-18 17:12:48,009 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 17:12:48,021 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:48,027 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:48,032 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:48,039 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:48,045 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:12:48,250 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 65 dim-0 vars, and 9 xjuncts. [2018-11-18 17:12:48,251 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 11 variables, input treesize:132, output treesize:1026 [2018-11-18 17:12:54,167 WARN L180 SmtUtils]: Spent 5.85 s on a formula simplification. DAG size of input: 456 DAG size of output: 134 [2018-11-18 17:13:13,428 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-11-18 17:13:13,431 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,432 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,434 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,435 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 55 [2018-11-18 17:13:13,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:13,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,524 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,527 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,535 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,536 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,540 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,541 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,545 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,551 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,552 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,553 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 33 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 171 [2018-11-18 17:13:13,555 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:13,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,674 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,679 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,680 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,683 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,687 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,690 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,691 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,692 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,694 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:13,697 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 25 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 135 [2018-11-18 17:13:13,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:13,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-11-18 17:13:13,850 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:276, output treesize:174 [2018-11-18 17:13:14,128 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 41 treesize of output 45 [2018-11-18 17:13:14,140 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-11-18 17:13:14,140 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,182 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,184 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 30 [2018-11-18 17:13:14,193 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-11-18 17:13:14,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,198 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,215 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,216 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,217 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 41 [2018-11-18 17:13:14,223 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-11-18 17:13:14,224 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,230 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-11-18 17:13:14,255 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-11-18 17:13:14,255 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,260 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:14,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:13:14,270 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:79, output treesize:19 [2018-11-18 17:13:15,240 WARN L854 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr91_5| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr91_5|))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |#Ultimate.C_memset_#value| 256)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0)))))) is different from true [2018-11-18 17:13:16,210 WARN L854 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr91_5| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr91_5|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_ldv_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_memset_#in~s.base|) .cse0 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_memset_#in~s.base|) .cse0 (mod |#Ultimate.C_memset_#value| 256))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-11-18 17:13:16,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,244 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 92 [2018-11-18 17:13:16,249 INFO L477 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 10 treesize of output 9 [2018-11-18 17:13:16,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 88 [2018-11-18 17:13:16,325 INFO L477 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 12 treesize of output 11 [2018-11-18 17:13:16,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,343 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,401 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 92 [2018-11-18 17:13:16,404 INFO L477 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 12 treesize of output 11 [2018-11-18 17:13:16,404 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,430 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,474 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,480 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 88 [2018-11-18 17:13:16,482 INFO L477 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 10 treesize of output 9 [2018-11-18 17:13:16,482 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,508 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: 11 dim-0 vars, and 2 xjuncts. [2018-11-18 17:13:16,546 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 15 variables, input treesize:163, output treesize:147 [2018-11-18 17:13:16,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 71 [2018-11-18 17:13:16,633 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:13:16,633 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,652 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:13:16,652 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,696 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 71 [2018-11-18 17:13:16,706 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 18 [2018-11-18 17:13:16,707 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,721 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-18 17:13:16,721 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,730 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,755 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 45 [2018-11-18 17:13:16,758 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:13:16,758 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,768 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:13:16,768 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,774 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,795 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,798 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:16,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 47 [2018-11-18 17:13:16,800 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2018-11-18 17:13:16,800 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,811 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-18 17:13:16,811 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,816 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:16,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 17:13:16,830 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 15 variables, input treesize:135, output treesize:19 [2018-11-18 17:13:17,970 WARN L854 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr91_6| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr91_6|))) (and (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 (mod |#Ultimate.C_memset_#value| 256))) |c_#memory_$Pointer$.offset|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| (store (select |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base|) .cse0 0)))))) is different from true [2018-11-18 17:13:19,512 WARN L854 $PredicateComparison]: unable to prove that (exists ((|#Ultimate.C_memset_#ptr.offset| Int) (|#Ultimate.C_memset_#value| Int) (|v_#Ultimate.C_memset_#t~loopctr91_6| Int)) (let ((.cse0 (+ |#Ultimate.C_memset_#ptr.offset| |v_#Ultimate.C_memset_#t~loopctr91_6|))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_ldv_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.base)| |c_ldv_memset_#in~s.base|) .cse0 0))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_memset_#in~s.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_memset_#in~s.base|) .cse0 (mod |#Ultimate.C_memset_#value| 256))) |c_#memory_$Pointer$.offset|)))) is different from true [2018-11-18 17:13:19,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,526 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 116 [2018-11-18 17:13:19,535 INFO L477 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 10 treesize of output 9 [2018-11-18 17:13:19,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,561 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,628 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 112 [2018-11-18 17:13:19,636 INFO L477 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 12 treesize of output 11 [2018-11-18 17:13:19,636 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,661 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,718 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 112 [2018-11-18 17:13:19,730 INFO L477 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 12 treesize of output 11 [2018-11-18 17:13:19,730 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,756 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,816 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,822 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:13:19,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 108 [2018-11-18 17:13:19,828 INFO L477 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 10 treesize of output 9 [2018-11-18 17:13:19,828 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,852 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:13:19,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 19 dim-0 vars, 4 dim-2 vars, End of recursive call: 19 dim-0 vars, and 2 xjuncts. [2018-11-18 17:13:19,900 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 23 variables, input treesize:203, output treesize:187 [2018-11-18 17:13:20,625 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 10 not checked. [2018-11-18 17:13:20,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:13:20,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17] total 22 [2018-11-18 17:13:20,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-18 17:13:20,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-18 17:13:20,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=262, Unknown=7, NotChecked=140, Total=462 [2018-11-18 17:13:20,642 INFO L87 Difference]: Start difference. First operand 562 states and 706 transitions. Second operand 22 states. [2018-11-18 17:14:01,440 WARN L180 SmtUtils]: Spent 39.81 s on a formula simplification. DAG size of input: 145 DAG size of output: 136 [2018-11-18 17:14:26,861 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 144 [2018-11-18 17:14:50,258 WARN L180 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 38 DAG size of output: 28 [2018-11-18 17:14:52,927 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 39 DAG size of output: 29 [2018-11-18 17:14:55,842 WARN L180 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-18 17:14:56,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:14:56,705 INFO L93 Difference]: Finished difference Result 1115 states and 1405 transitions. [2018-11-18 17:14:56,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 17:14:56,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 128 [2018-11-18 17:14:56,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:14:56,708 INFO L225 Difference]: With dead ends: 1115 [2018-11-18 17:14:56,708 INFO L226 Difference]: Without dead ends: 567 [2018-11-18 17:14:56,709 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 110 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 101.0s TimeCoverageRelationStatistics Valid=120, Invalid=754, Unknown=12, NotChecked=236, Total=1122 [2018-11-18 17:14:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-18 17:14:56,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 563. [2018-11-18 17:14:56,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-18 17:14:56,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 707 transitions. [2018-11-18 17:14:56,732 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 707 transitions. Word has length 128 [2018-11-18 17:14:56,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:14:56,732 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 707 transitions. [2018-11-18 17:14:56,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-18 17:14:56,732 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 707 transitions. [2018-11-18 17:14:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-18 17:14:56,733 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:14:56,734 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:14:56,734 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:14:56,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:14:56,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1208273321, now seen corresponding path program 2 times [2018-11-18 17:14:56,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 17:14:56,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 17:14:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:14:56,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:14:56,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 17:14:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:14:56,848 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 17:14:56,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:14:56,849 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:14:56,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:14:57,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:14:57,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:14:57,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:14:57,394 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 55 [2018-11-18 17:14:57,399 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 59 [2018-11-18 17:14:57,411 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,431 INFO L477 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 2 case distinctions, treesize of input 59 treesize of output 62 [2018-11-18 17:14:57,440 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,461 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 65 [2018-11-18 17:14:57,483 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 68 [2018-11-18 17:14:57,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,558 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,573 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 71 [2018-11-18 17:14:57,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 76 [2018-11-18 17:14:57,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2018-11-18 17:14:57,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,684 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,688 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,707 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,709 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 11 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 93 [2018-11-18 17:14:57,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 11 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 88 [2018-11-18 17:14:57,759 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 17:14:57,790 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:14:57,820 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:14:57,857 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:14:57,940 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,960 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:57,999 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 74 [2018-11-18 17:14:58,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 83 [2018-11-18 17:14:58,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,078 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,087 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,097 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,098 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,121 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 97 [2018-11-18 17:14:58,153 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 92 [2018-11-18 17:14:58,154 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 17:14:58,187 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:14:58,242 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:14:58,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,324 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,328 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,332 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,336 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 77 [2018-11-18 17:14:58,481 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-11-18 17:14:58,487 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,509 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,510 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,523 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 124 [2018-11-18 17:14:58,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 13 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 96 [2018-11-18 17:14:58,555 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-18 17:14:58,609 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:14:58,693 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,700 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,712 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,715 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,722 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,725 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,735 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,740 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,744 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,749 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 114 [2018-11-18 17:14:58,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 106 [2018-11-18 17:14:58,794 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 2 xjuncts. [2018-11-18 17:14:58,949 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,963 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,971 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,972 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,973 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:14:58,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 14 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 126 [2018-11-18 17:14:58,979 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-18 17:14:59,111 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 17:14:59,272 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-18 17:14:59,465 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-11-18 17:14:59,711 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-18 17:14:59,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 69 [2018-11-18 17:15:00,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 57 [2018-11-18 17:15:00,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 56 [2018-11-18 17:15:00,065 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,077 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,085 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,091 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 10 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 89 [2018-11-18 17:15:00,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-18 17:15:00,118 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-18 17:15:00,148 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:00,177 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:00,206 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:00,240 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:00,488 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-18 17:15:00,764 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 62 [2018-11-18 17:15:00,794 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2018-11-18 17:15:00,844 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-11-18 17:15:00,864 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 52 [2018-11-18 17:15:00,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,900 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,911 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:00,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 9 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 85 [2018-11-18 17:15:00,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 80 [2018-11-18 17:15:00,981 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,010 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,037 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,064 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,091 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,122 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,389 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-11-18 17:15:01,690 INFO L477 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 56 treesize of output 55 [2018-11-18 17:15:01,709 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-18 17:15:01,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 50 [2018-11-18 17:15:01,798 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2018-11-18 17:15:01,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2018-11-18 17:15:01,891 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,901 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,910 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,922 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:01,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 81 [2018-11-18 17:15:01,964 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 76 [2018-11-18 17:15:01,965 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-11-18 17:15:01,992 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:02,018 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:02,043 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:02,069 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:02,095 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:02,122 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:02,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-18 17:15:02,683 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-11-18 17:15:02,970 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:02,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-11-18 17:15:02,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:02,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-11-18 17:15:02,987 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-11-18 17:15:02,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:02,992 INFO L477 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 54 [2018-11-18 17:15:03,000 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,003 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,003 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-18 17:15:03,008 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-18 17:15:03,015 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,028 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,036 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,043 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,053 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,064 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,386 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 39 [2018-11-18 17:15:03,393 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 62 [2018-11-18 17:15:03,398 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2018-11-18 17:15:03,401 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,401 INFO L477 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 54 [2018-11-18 17:15:03,405 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,406 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2018-11-18 17:15:03,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 17:15:03,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 45 [2018-11-18 17:15:03,413 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,421 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,427 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,432 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,438 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,444 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 17:15:03,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 65 dim-0 vars, and 9 xjuncts. [2018-11-18 17:15:03,667 INFO L202 ElimStorePlain]: Needed 50 recursive calls to eliminate 11 variables, input treesize:132, output treesize:1026 [2018-11-18 17:15:07,080 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 17:15:07,280 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:15:07,281 FATAL L265 ToolchainWalker]: 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:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) 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.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) 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:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) 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:286) 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.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-11-18 17:15:07,284 INFO L168 Benchmark]: Toolchain (without parser) took 151422.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.9 MB). Free memory was 951.0 MB in the beginning and 1.3 GB in the end (delta: -324.6 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:07,284 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:15:07,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1187.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 247.5 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:07,284 INFO L168 Benchmark]: Boogie Preprocessor took 63.68 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.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:07,285 INFO L168 Benchmark]: RCFGBuilder took 936.58 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: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:07,285 INFO L168 Benchmark]: TraceAbstraction took 149232.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -255.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:15:07,286 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1187.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -166.6 MB). Peak memory consumption was 247.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.68 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.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 936.58 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: 92.4 MB). Peak memory consumption was 92.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 149232.22 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 239.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -255.6 MB). There was no memory consumed. 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.23-5842f4b [2018-11-18 17:15:08,518 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 17:15:08,519 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 17:15:08,528 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 17:15:08,528 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 17:15:08,529 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 17:15:08,530 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 17:15:08,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 17:15:08,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 17:15:08,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 17:15:08,533 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 17:15:08,533 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 17:15:08,534 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 17:15:08,535 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 17:15:08,536 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 17:15:08,536 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 17:15:08,537 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 17:15:08,539 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 17:15:08,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 17:15:08,541 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 17:15:08,542 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 17:15:08,543 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 17:15:08,544 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 17:15:08,544 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 17:15:08,545 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 17:15:08,545 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 17:15:08,546 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 17:15:08,546 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 17:15:08,547 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 17:15:08,548 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 17:15:08,548 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 17:15:08,548 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 17:15:08,548 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 17:15:08,549 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 17:15:08,549 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 17:15:08,551 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 17:15:08,551 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2018-11-18 17:15:08,561 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 17:15:08,561 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 17:15:08,562 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 17:15:08,562 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 17:15:08,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 17:15:08,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 17:15:08,563 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 17:15:08,563 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 17:15:08,563 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 17:15:08,563 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 17:15:08,564 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 17:15:08,565 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 17:15:08,565 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 17:15:08,565 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 17:15:08,565 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 17:15:08,565 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 17:15:08,565 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 17:15:08,565 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 17:15:08,566 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 17:15:08,566 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 17:15:08,566 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 17:15:08,566 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 17:15:08,568 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 17:15:08,568 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 17:15:08,568 INFO L133 SettingsManager]: * To the following directory=dump/ 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/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/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 ! call(__VERIFIER_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7fc5757f33cca8abec0d298407c4598828d90b8e [2018-11-18 17:15:08,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 17:15:08,609 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 17:15:08,612 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 17:15:08,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 17:15:08,614 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 17:15:08,614 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-18 17:15:08,659 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/96b090e8a/0d1d29d1b1e443e19f254d23bd3093a5/FLAG0e792afd8 [2018-11-18 17:15:09,122 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 17:15:09,123 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-18 17:15:09,144 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/96b090e8a/0d1d29d1b1e443e19f254d23bd3093a5/FLAG0e792afd8 [2018-11-18 17:15:09,633 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/data/96b090e8a/0d1d29d1b1e443e19f254d23bd3093a5 [2018-11-18 17:15:09,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 17:15:09,636 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 17:15:09,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 17:15:09,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 17:15:09,640 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 17:15:09,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:15:09" (1/1) ... [2018-11-18 17:15:09,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f60b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:09, skipping insertion in model container [2018-11-18 17:15:09,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:15:09" (1/1) ... [2018-11-18 17:15:09,651 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 17:15:09,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 17:15:10,514 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:15:10,641 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 17:15:10,971 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 17:15:11,010 INFO L195 MainTranslator]: Completed translation [2018-11-18 17:15:11,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11 WrapperNode [2018-11-18 17:15:11,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 17:15:11,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 17:15:11,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 17:15:11,011 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 17:15:11,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,070 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,076 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... [2018-11-18 17:15:11,082 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 17:15:11,083 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 17:15:11,083 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 17:15:11,083 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 17:15:11,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/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 [2018-11-18 17:15:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 17:15:11,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2018-11-18 17:15:11,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_sock [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_sk [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure register_pppox_proto [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_pppox_proto [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_unbind_sock [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_ioctl [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-18 17:15:11,127 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_get [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-18 17:15:11,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-18 17:15:11,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_and_exit [2018-11-18 17:15:11,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_refcount [2018-11-18 17:15:11,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 17:15:11,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 17:15:11,129 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 17:15:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 17:15:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2018-11-18 17:15:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2018-11-18 17:15:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure __request_module [2018-11-18 17:15:11,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-11-18 17:15:11,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-18 17:15:11,131 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_unregister_channel [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure ppp_channel_index [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock_nested [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure lock_sock [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure release_sock [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_sk [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure register_pppox_proto [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_pppox_proto [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_unbind_sock [2018-11-18 17:15:11,132 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_ioctl [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-18 17:15:11,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_get [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_and_exit [2018-11-18 17:15:11,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_refcount [2018-11-18 17:15:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 17:15:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 17:15:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 17:15:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 17:15:11,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 17:15:13,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 17:15:13,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:15:13 BoogieIcfgContainer [2018-11-18 17:15:13,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 17:15:13,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 17:15:13,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 17:15:13,880 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 17:15:13,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:15:09" (1/3) ... [2018-11-18 17:15:13,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c6f228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:15:13, skipping insertion in model container [2018-11-18 17:15:13,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:15:11" (2/3) ... [2018-11-18 17:15:13,881 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13c6f228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:15:13, skipping insertion in model container [2018-11-18 17:15:13,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:15:13" (3/3) ... [2018-11-18 17:15:13,883 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--ppp--pppox.ko-entry_point_true-unreach-call.cil.out.c [2018-11-18 17:15:13,889 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 17:15:13,895 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 17:15:13,905 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 17:15:13,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 17:15:13,927 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 17:15:13,927 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 17:15:13,927 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 17:15:13,927 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 17:15:13,927 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 17:15:13,928 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 17:15:13,928 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 17:15:13,928 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 17:15:13,942 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states. [2018-11-18 17:15:13,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 17:15:13,949 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:13,950 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2018-11-18 17:15:13,951 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:13,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1306517306, now seen corresponding path program 1 times [2018-11-18 17:15:13,959 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:13,960 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:14,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 17:15:14,166 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:14,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:14,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:15:14,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:15:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:15:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:14,182 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 3 states. [2018-11-18 17:15:14,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:14,263 INFO L93 Difference]: Finished difference Result 300 states and 389 transitions. [2018-11-18 17:15:14,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:15:14,265 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 17:15:14,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:14,275 INFO L225 Difference]: With dead ends: 300 [2018-11-18 17:15:14,275 INFO L226 Difference]: Without dead ends: 184 [2018-11-18 17:15:14,279 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-18 17:15:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-11-18 17:15:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 17:15:14,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2018-11-18 17:15:14,351 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 63 [2018-11-18 17:15:14,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:14,353 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2018-11-18 17:15:14,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:15:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2018-11-18 17:15:14,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 17:15:14,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:14,356 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:14,356 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:14,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:14,357 INFO L82 PathProgramCache]: Analyzing trace with hash 394059572, now seen corresponding path program 1 times [2018-11-18 17:15:14,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:14,357 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:14,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:14,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:14,569 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-18 17:15:14,570 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:14,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:14,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:15:14,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:15:14,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:15:14,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:14,575 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand 3 states. [2018-11-18 17:15:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:14,639 INFO L93 Difference]: Finished difference Result 381 states and 483 transitions. [2018-11-18 17:15:14,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:15:14,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-18 17:15:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:14,642 INFO L225 Difference]: With dead ends: 381 [2018-11-18 17:15:14,643 INFO L226 Difference]: Without dead ends: 231 [2018-11-18 17:15:14,644 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:14,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-18 17:15:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-11-18 17:15:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 17:15:14,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 281 transitions. [2018-11-18 17:15:14,661 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 281 transitions. Word has length 85 [2018-11-18 17:15:14,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:14,662 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 281 transitions. [2018-11-18 17:15:14,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:15:14,662 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 281 transitions. [2018-11-18 17:15:14,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 17:15:14,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:14,664 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:14,664 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:14,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:14,664 INFO L82 PathProgramCache]: Analyzing trace with hash -245142109, now seen corresponding path program 1 times [2018-11-18 17:15:14,665 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:14,665 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:14,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:14,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:15,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 17:15:15,119 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 17:15:15,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:15,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:15:15,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:15:15,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:15:15,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:15:15,124 INFO L87 Difference]: Start difference. First operand 221 states and 281 transitions. Second operand 6 states. [2018-11-18 17:15:15,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:15,228 INFO L93 Difference]: Finished difference Result 429 states and 549 transitions. [2018-11-18 17:15:15,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 17:15:15,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-18 17:15:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:15,232 INFO L225 Difference]: With dead ends: 429 [2018-11-18 17:15:15,232 INFO L226 Difference]: Without dead ends: 222 [2018-11-18 17:15:15,234 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-18 17:15:15,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-18 17:15:15,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-18 17:15:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-18 17:15:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 282 transitions. [2018-11-18 17:15:15,248 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 282 transitions. Word has length 99 [2018-11-18 17:15:15,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:15,248 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 282 transitions. [2018-11-18 17:15:15,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:15:15,248 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 282 transitions. [2018-11-18 17:15:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 17:15:15,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:15,250 INFO L375 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:15,250 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:15,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1501490223, now seen corresponding path program 1 times [2018-11-18 17:15:15,251 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:15,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:15,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:15,637 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 17:15:15,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:15:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 17:15:15,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:15:15,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-11-18 17:15:15,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 17:15:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 17:15:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-18 17:15:15,796 INFO L87 Difference]: Start difference. First operand 222 states and 282 transitions. Second operand 11 states. [2018-11-18 17:15:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:15,933 INFO L93 Difference]: Finished difference Result 431 states and 551 transitions. [2018-11-18 17:15:15,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:15:15,933 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 101 [2018-11-18 17:15:15,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:15,935 INFO L225 Difference]: With dead ends: 431 [2018-11-18 17:15:15,935 INFO L226 Difference]: Without dead ends: 223 [2018-11-18 17:15:15,935 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:15:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-18 17:15:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-11-18 17:15:15,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-18 17:15:15,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 283 transitions. [2018-11-18 17:15:15,949 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 283 transitions. Word has length 101 [2018-11-18 17:15:15,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:15,949 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 283 transitions. [2018-11-18 17:15:15,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 17:15:15,949 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 283 transitions. [2018-11-18 17:15:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 17:15:15,951 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:15,951 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:15,951 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:15,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:15,952 INFO L82 PathProgramCache]: Analyzing trace with hash -487341213, now seen corresponding path program 2 times [2018-11-18 17:15:15,952 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:15,952 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:15,988 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:15:16,191 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 17:15:16,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:15:16,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:16,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 17:15:16,296 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:16,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:16,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:15:16,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:15:16,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:15:16,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:15:16,299 INFO L87 Difference]: Start difference. First operand 223 states and 283 transitions. Second operand 7 states. [2018-11-18 17:15:16,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:16,331 INFO L93 Difference]: Finished difference Result 431 states and 555 transitions. [2018-11-18 17:15:16,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:15:16,331 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-11-18 17:15:16,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:16,333 INFO L225 Difference]: With dead ends: 431 [2018-11-18 17:15:16,333 INFO L226 Difference]: Without dead ends: 241 [2018-11-18 17:15:16,334 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:15:16,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-18 17:15:16,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2018-11-18 17:15:16,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-18 17:15:16,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 289 transitions. [2018-11-18 17:15:16,344 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 289 transitions. Word has length 103 [2018-11-18 17:15:16,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:16,345 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 289 transitions. [2018-11-18 17:15:16,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:15:16,345 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 289 transitions. [2018-11-18 17:15:16,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 17:15:16,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:16,346 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:16,346 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:16,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:16,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1767204891, now seen corresponding path program 1 times [2018-11-18 17:15:16,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:16,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:16,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:15:16,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:16,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:16,464 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-18 17:15:16,465 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:15:16,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:15:16,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:15:16,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:16,467 INFO L87 Difference]: Start difference. First operand 230 states and 289 transitions. Second operand 3 states. [2018-11-18 17:15:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:16,485 INFO L93 Difference]: Finished difference Result 418 states and 537 transitions. [2018-11-18 17:15:16,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:15:16,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-18 17:15:16,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:16,487 INFO L225 Difference]: With dead ends: 418 [2018-11-18 17:15:16,488 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 17:15:16,488 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 17:15:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2018-11-18 17:15:16,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-18 17:15:16,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 272 transitions. [2018-11-18 17:15:16,500 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 272 transitions. Word has length 103 [2018-11-18 17:15:16,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:16,500 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 272 transitions. [2018-11-18 17:15:16,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:15:16,500 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 272 transitions. [2018-11-18 17:15:16,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 17:15:16,501 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:16,502 INFO L375 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:16,502 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:16,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:16,503 INFO L82 PathProgramCache]: Analyzing trace with hash -54107577, now seen corresponding path program 1 times [2018-11-18 17:15:16,504 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:16,504 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:16,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:16,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:16,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:16,905 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 17:15:16,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:15:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 17:15:17,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:15:17,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-18 17:15:17,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 17:15:17,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:15:17,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:15:17,148 INFO L87 Difference]: Start difference. First operand 215 states and 272 transitions. Second operand 13 states. [2018-11-18 17:15:17,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:17,317 INFO L93 Difference]: Finished difference Result 417 states and 531 transitions. [2018-11-18 17:15:17,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:15:17,318 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-11-18 17:15:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:17,319 INFO L225 Difference]: With dead ends: 417 [2018-11-18 17:15:17,319 INFO L226 Difference]: Without dead ends: 216 [2018-11-18 17:15:17,320 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:15:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-18 17:15:17,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-11-18 17:15:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-11-18 17:15:17,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 273 transitions. [2018-11-18 17:15:17,327 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 273 transitions. Word has length 109 [2018-11-18 17:15:17,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:17,327 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 273 transitions. [2018-11-18 17:15:17,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 17:15:17,328 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 273 transitions. [2018-11-18 17:15:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 17:15:17,329 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:17,329 INFO L375 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:17,329 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:17,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:17,329 INFO L82 PathProgramCache]: Analyzing trace with hash 129436883, now seen corresponding path program 2 times [2018-11-18 17:15:17,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:17,330 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:17,359 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:15:17,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-18 17:15:17,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:15:17,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:17,670 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 17:15:17,670 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:17,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:17,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 17:15:17,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 17:15:17,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 17:15:17,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:15:17,674 INFO L87 Difference]: Start difference. First operand 216 states and 273 transitions. Second operand 6 states. [2018-11-18 17:15:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:24,113 INFO L93 Difference]: Finished difference Result 429 states and 545 transitions. [2018-11-18 17:15:24,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 17:15:24,114 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-11-18 17:15:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:24,116 INFO L225 Difference]: With dead ends: 429 [2018-11-18 17:15:24,116 INFO L226 Difference]: Without dead ends: 418 [2018-11-18 17:15:24,116 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 17:15:24,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-18 17:15:24,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 250. [2018-11-18 17:15:24,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 17:15:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2018-11-18 17:15:24,130 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 111 [2018-11-18 17:15:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:24,130 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2018-11-18 17:15:24,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 17:15:24,130 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2018-11-18 17:15:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 17:15:24,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:24,131 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:24,131 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:24,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1564813056, now seen corresponding path program 1 times [2018-11-18 17:15:24,132 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:24,132 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:24,150 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:15:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:24,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-18 17:15:24,249 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:24,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:24,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 17:15:24,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 17:15:24,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 17:15:24,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:24,251 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand 3 states. [2018-11-18 17:15:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:24,279 INFO L93 Difference]: Finished difference Result 371 states and 458 transitions. [2018-11-18 17:15:24,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 17:15:24,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-18 17:15:24,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:24,282 INFO L225 Difference]: With dead ends: 371 [2018-11-18 17:15:24,282 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 17:15:24,282 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 17:15:24,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 17:15:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2018-11-18 17:15:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 17:15:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2018-11-18 17:15:24,293 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 117 [2018-11-18 17:15:24,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:24,295 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2018-11-18 17:15:24,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 17:15:24,295 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2018-11-18 17:15:24,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 17:15:24,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:24,296 INFO L375 BasicCegarLoop]: trace histogram [6, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:24,296 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:24,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:24,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1142111230, now seen corresponding path program 1 times [2018-11-18 17:15:24,297 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:24,297 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:24,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:24,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 17:15:24,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:15:25,083 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-11-18 17:15:25,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:15:25,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-18 17:15:25,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-18 17:15:25,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-18 17:15:25,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-11-18 17:15:25,086 INFO L87 Difference]: Start difference. First operand 250 states and 305 transitions. Second operand 15 states. [2018-11-18 17:15:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:25,406 INFO L93 Difference]: Finished difference Result 487 states and 597 transitions. [2018-11-18 17:15:25,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 17:15:25,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 117 [2018-11-18 17:15:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:25,408 INFO L225 Difference]: With dead ends: 487 [2018-11-18 17:15:25,408 INFO L226 Difference]: Without dead ends: 251 [2018-11-18 17:15:25,409 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 219 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-18 17:15:25,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-11-18 17:15:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-11-18 17:15:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-11-18 17:15:25,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 306 transitions. [2018-11-18 17:15:25,419 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 306 transitions. Word has length 117 [2018-11-18 17:15:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:25,419 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 306 transitions. [2018-11-18 17:15:25,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-18 17:15:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 306 transitions. [2018-11-18 17:15:25,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-18 17:15:25,420 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:25,420 INFO L375 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:25,421 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:25,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1224566838, now seen corresponding path program 2 times [2018-11-18 17:15:25,421 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:25,421 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:25,454 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:15:26,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:15:26,128 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:15:26,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 17:15:26,297 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:26,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:26,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 17:15:26,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 17:15:26,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 17:15:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:15:26,301 INFO L87 Difference]: Start difference. First operand 251 states and 306 transitions. Second operand 7 states. [2018-11-18 17:15:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:26,323 INFO L93 Difference]: Finished difference Result 369 states and 453 transitions. [2018-11-18 17:15:26,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 17:15:26,324 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-11-18 17:15:26,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:26,325 INFO L225 Difference]: With dead ends: 369 [2018-11-18 17:15:26,325 INFO L226 Difference]: Without dead ends: 256 [2018-11-18 17:15:26,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 17:15:26,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-18 17:15:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2018-11-18 17:15:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 17:15:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 303 transitions. [2018-11-18 17:15:26,334 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 303 transitions. Word has length 119 [2018-11-18 17:15:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:26,334 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 303 transitions. [2018-11-18 17:15:26,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 17:15:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 303 transitions. [2018-11-18 17:15:26,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 17:15:26,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:26,336 INFO L375 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:26,337 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:26,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:26,337 INFO L82 PathProgramCache]: Analyzing trace with hash 888362983, now seen corresponding path program 1 times [2018-11-18 17:15:26,338 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:26,338 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:26,375 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 17:15:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:26,979 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:27,066 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 17:15:27,067 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:27,070 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:27,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 17:15:27,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 17:15:27,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 17:15:27,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 17:15:27,071 INFO L87 Difference]: Start difference. First operand 250 states and 303 transitions. Second operand 5 states. [2018-11-18 17:15:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:31,343 INFO L93 Difference]: Finished difference Result 475 states and 583 transitions. [2018-11-18 17:15:31,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 17:15:31,345 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-11-18 17:15:31,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:31,346 INFO L225 Difference]: With dead ends: 475 [2018-11-18 17:15:31,346 INFO L226 Difference]: Without dead ends: 260 [2018-11-18 17:15:31,347 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-18 17:15:31,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-11-18 17:15:31,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 254. [2018-11-18 17:15:31,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-18 17:15:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 307 transitions. [2018-11-18 17:15:31,359 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 307 transitions. Word has length 134 [2018-11-18 17:15:31,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:31,359 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 307 transitions. [2018-11-18 17:15:31,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 17:15:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 307 transitions. [2018-11-18 17:15:31,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 17:15:31,360 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:15:31,361 INFO L375 BasicCegarLoop]: trace histogram [8, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:15:31,361 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:15:31,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:15:31,361 INFO L82 PathProgramCache]: Analyzing trace with hash 929037733, now seen corresponding path program 1 times [2018-11-18 17:15:31,362 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 17:15:31,362 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 17:15:31,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:15:31,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 17:15:31,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:15:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-11-18 17:15:33,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 17:15:33,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 17:15:33,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 17:15:33,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 17:15:33,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 17:15:33,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 17:15:33,032 INFO L87 Difference]: Start difference. First operand 254 states and 307 transitions. Second operand 14 states. [2018-11-18 17:15:52,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:15:52,301 INFO L93 Difference]: Finished difference Result 350 states and 427 transitions. [2018-11-18 17:15:52,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 17:15:52,303 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2018-11-18 17:15:52,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:15:52,303 INFO L225 Difference]: With dead ends: 350 [2018-11-18 17:15:52,303 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 17:15:52,304 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-11-18 17:15:52,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 17:15:52,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 17:15:52,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 17:15:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 17:15:52,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2018-11-18 17:15:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:15:52,305 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 17:15:52,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 17:15:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 17:15:52,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 17:15:52,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 17:15:52,430 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:15:52,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:15:52,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:15:52,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 17:15:52,777 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2018-11-18 17:15:53,342 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 14 [2018-11-18 17:15:53,457 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2018-11-18 17:15:53,799 INFO L425 ceAbstractionStarter]: For program point ldv_module_getEXIT(lines 6356 6368) no Hoare annotation was computed. [2018-11-18 17:15:53,799 INFO L425 ceAbstractionStarter]: For program point ldv_module_getENTRY(lines 6356 6368) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6361-2(lines 6356 6368) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6361(lines 6361 6365) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point ldv_err_ptrEXIT(lines 6320 6327) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point ldv_err_ptrENTRY(lines 6320 6327) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point ldv_err_ptrFINAL(lines 6320 6327) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point ldv_is_err_or_nullENTRY(lines 6336 6354) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6346(lines 6346 6350) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point ldv_is_err_or_nullEXIT(lines 6336 6354) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6342(lines 6342 6351) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6345-1(line 6345) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6346-2(lines 6342 6351) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6345(line 6345) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point ldv_is_err_or_nullFINAL(lines 6336 6354) no Hoare annotation was computed. [2018-11-18 17:15:53,800 INFO L425 ceAbstractionStarter]: For program point L6080(line 6080) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6109(line 6109) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6109-1(line 6109) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6105(line 6105) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6089(line 6089) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6106(lines 6106 6113) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point pppox_ioctlFINAL(lines 6050 6119) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6069(lines 6069 6073) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6065(line 6065) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6065-1(line 6065) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6086(line 6086) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6115(lines 6061 6118) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6066(lines 6066 6114) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point pppox_ioctlEXIT(lines 6050 6119) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point L6083(line 6083) no Hoare annotation was computed. [2018-11-18 17:15:53,801 INFO L425 ceAbstractionStarter]: For program point pppox_ioctlENTRY(lines 6050 6119) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point L6079(lines 6079 6095) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point L6067(line 6067) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point L6063(line 6063) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point L6063-1(line 6063) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point L6096(lines 6066 6114) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point L6092(line 6092) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point lock_sockENTRY(lines 5954 5962) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point lock_sockFINAL(lines 5954 5962) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point lock_sockEXIT(lines 5954 5962) no Hoare annotation was computed. [2018-11-18 17:15:53,802 INFO L428 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5909 5917) the Hoare annotation is: true [2018-11-18 17:15:53,802 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5909 5917) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5909 5917) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6237(lines 6237 6268) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 6188 6283) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6213(lines 6213 6276) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6238(line 6238) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6247(line 6247) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6214(line 6214) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6280(line 6280) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6239(lines 6239 6245) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L421 ceAbstractionStarter]: At program point L6206(line 6206) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6206-1(line 6206) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 6188 6283) no Hoare annotation was computed. [2018-11-18 17:15:53,803 INFO L425 ceAbstractionStarter]: For program point L6215(lines 6215 6232) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6248(lines 6248 6264) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L421 ceAbstractionStarter]: At program point L6207(line 6207) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6240-1(line 6240) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6207-1(line 6207) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L421 ceAbstractionStarter]: At program point L6240(line 6240) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,804 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 6188 6283) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,804 INFO L421 ceAbstractionStarter]: At program point L6249(line 6249) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6249-1(line 6249) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6274(line 6274) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6266(line 6266) no Hoare annotation was computed. [2018-11-18 17:15:53,804 INFO L421 ceAbstractionStarter]: At program point L6258(lines 6200 6282) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,804 INFO L425 ceAbstractionStarter]: For program point L6250(lines 6250 6255) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6217(lines 6217 6228) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6250-2(lines 6248 6262) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L428 ceAbstractionStarter]: At program point L6275(line 6275) the Hoare annotation is: true [2018-11-18 17:15:53,805 INFO L428 ceAbstractionStarter]: At program point L6267(line 6267) the Hoare annotation is: true [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6234(line 6234) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L421 ceAbstractionStarter]: At program point L6201(line 6201) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6201-1(line 6201) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6226(line 6226) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6218(line 6218) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6235(lines 6235 6272) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L428 ceAbstractionStarter]: At program point L6227(line 6227) the Hoare annotation is: true [2018-11-18 17:15:53,805 INFO L425 ceAbstractionStarter]: For program point L6219(lines 6219 6224) no Hoare annotation was computed. [2018-11-18 17:15:53,805 INFO L421 ceAbstractionStarter]: At program point L6277(lines 6200 6282) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,805 INFO L421 ceAbstractionStarter]: At program point L6203(line 6203) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point L6203-1(line 6203) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point L6220-1(line 6220) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L421 ceAbstractionStarter]: At program point L6220(line 6220) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,806 INFO L421 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 6369 6387) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point L6374(lines 6374 6384) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point L6375-1(line 6375) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L421 ceAbstractionStarter]: At program point L6375(line 6375) the Hoare annotation is: (or (and (= |ldv_try_module_get_#in~module.offset| ldv_try_module_get_~module.offset) (= (_ bv1 32) ~ldv_module_refcounter~0) (= |ldv_try_module_get_#in~module.base| ldv_try_module_get_~module.base) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (bvadd |ldv_try_module_get_#in~module.offset| |ldv_try_module_get_#in~module.base|))))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point L6376(lines 6376 6381) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6369 6387) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6369 6387) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point ldv_undef_ptrFINAL(lines 5918 5926) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point ldv_undef_ptrEXIT(lines 5918 5926) no Hoare annotation was computed. [2018-11-18 17:15:53,806 INFO L425 ceAbstractionStarter]: For program point ldv_undef_ptrENTRY(lines 5918 5926) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point pppox_skEXIT(lines 5964 5971) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point pppox_skENTRY(lines 5964 5971) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point pppox_skFINAL(lines 5964 5971) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6309) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6303 6311) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L428 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6303 6311) the Hoare annotation is: true [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6303 6311) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point L6140-2(lines 6140 6144) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point L6140(lines 6140 6144) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L425 ceAbstractionStarter]: For program point L6134(lines 6134 6138) no Hoare annotation was computed. [2018-11-18 17:15:53,807 INFO L421 ceAbstractionStarter]: At program point L6161(line 6161) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (and (= (bvadd |old(~ldv_module_refcounter~0)| (_ bv1 32)) ~ldv_module_refcounter~0) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (let ((.cse2 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))))) (= (_ bv1 8) pppox_create_~tmp~9) (= (_ bv0 32) pppox_create_~tmp___0~3) (exists ((pppox_create_~protocol (_ BitVec 32))) (let ((.cse7 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse5 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse7)) (.cse6 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse7) (_ bv16 32)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| .cse5) .cse6)) (.cse4 (select (select |#memory_$Pointer$.offset| .cse5) .cse6))) (and (= |pppox_create_#t~mem67.base| .cse3) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (bvadd .cse4 .cse3)))) (= |pppox_create_#t~mem67.offset| .cse4)))))))) [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point L6161-1(line 6161) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6126 6165) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point L6149-2(lines 6147 6159) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point L6149(lines 6149 6153) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point L6145(lines 6145 6159) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L421 ceAbstractionStarter]: At program point pppox_createENTRY(lines 6126 6165) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,808 INFO L421 ceAbstractionStarter]: At program point L6162(lines 6132 6164) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point L6160-1(line 6160) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L421 ceAbstractionStarter]: At program point L6160(line 6160) the Hoare annotation is: (or (and (= (bvadd |old(~ldv_module_refcounter~0)| (_ bv1 32)) ~ldv_module_refcounter~0) (not (= ((_ sign_extend 32) (_ bv0 32)) ((_ sign_extend 32) (let ((.cse2 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))))) (= (_ bv1 8) pppox_create_~tmp~9) (= (_ bv0 32) pppox_create_~tmp___0~3)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6126 6165) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L425 ceAbstractionStarter]: For program point L6148-1(line 6148) no Hoare annotation was computed. [2018-11-18 17:15:53,808 INFO L421 ceAbstractionStarter]: At program point L6148(line 6148) the Hoare annotation is: (or (let ((.cse2 (bvadd (bvmul (_ bv8 32) pppox_create_~protocol) |~#pppox_protos~0.offset|))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (and (= |pppox_create_#t~mem56.offset| (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= |pppox_create_#t~mem56.base| (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5936 5944) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5936 5944) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L428 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5936 5944) the Hoare annotation is: true [2018-11-18 17:15:53,809 INFO L428 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point ldv_undef_ulongENTRY(lines 5927 5935) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point ldv_undef_ulongEXIT(lines 5927 5935) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point ldv_undef_ulongFINAL(lines 5927 5935) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point L6001-2(lines 5996 6008) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point unregister_pppox_protoEXIT(lines 5996 6008) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point L6001(lines 6001 6005) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point unregister_pppox_protoENTRY(lines 5996 6008) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_and_exitEXIT(lines 6406 6415) no Hoare annotation was computed. [2018-11-18 17:15:53,809 INFO L425 ceAbstractionStarter]: For program point L6411(lines 6410 6414) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_and_exitENTRY(lines 6406 6415) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_and_exitFINAL(lines 6406 6415) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6176 6184) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L428 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6176 6184) the Hoare annotation is: true [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6176 6184) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point L6015(line 6015) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point pppox_unbind_sockEXIT(lines 6009 6023) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point L6014(lines 6014 6020) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point L6015-1(line 6015) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point pppox_unbind_sockENTRY(lines 6009 6023) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point L6014-2(lines 6009 6023) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point ldv_module_refcountFINAL(lines 6416 6423) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point ldv_module_refcountENTRY(lines 6416 6423) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point ldv_module_refcountEXIT(lines 6416 6423) no Hoare annotation was computed. [2018-11-18 17:15:53,810 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 17:15:53,811 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5888 5899) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5888 5899) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L428 ceAbstractionStarter]: At program point L5894(line 5894) the Hoare annotation is: true [2018-11-18 17:15:53,811 INFO L428 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5888 5899) the Hoare annotation is: true [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point L5894-1(line 5894) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6167 6175) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L428 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6167 6175) the Hoare annotation is: true [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6167 6175) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point L5982(lines 5982 5986) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point register_pppox_protoEXIT(lines 5977 5995) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point register_pppox_protoENTRY(lines 5977 5995) no Hoare annotation was computed. [2018-11-18 17:15:53,811 INFO L425 ceAbstractionStarter]: For program point L5987(lines 5987 5991) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point register_pppox_protoFINAL(lines 5977 5995) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_is_errEXIT(lines 6312 6319) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_is_errENTRY(lines 6312 6319) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_is_errFINAL(lines 6312 6319) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L428 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_mallocENTRY(lines 5852 5869) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 5852 5869) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point L5860(lines 5860 5867) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 5852 5869) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,812 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6284 6292) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L421 ceAbstractionStarter]: At program point L6289(line 6289) the Hoare annotation is: (or (and (= |ldv_try_module_get_5_#in~ldv_func_arg1.offset| ldv_try_module_get_5_~ldv_func_arg1.offset) (= ldv_try_module_get_5_~ldv_func_arg1.base |ldv_try_module_get_5_#in~ldv_func_arg1.base|) (= (_ bv1 32) ~ldv_module_refcounter~0)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point L6289-1(line 6289) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L421 ceAbstractionStarter]: At program point ldv_try_module_get_5ENTRY(lines 6284 6292) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6284 6292) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6424 6436) the Hoare annotation is: true [2018-11-18 17:15:53,813 INFO L421 ceAbstractionStarter]: At program point L6430(line 6430) the Hoare annotation is: (not (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point L6429(lines 6424 6436) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6424 6436) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INTENTRY(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point L-1-1(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INTEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INTFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ldv_ptr_errENTRY(lines 6328 6335) no Hoare annotation was computed. [2018-11-18 17:15:53,813 INFO L425 ceAbstractionStarter]: For program point ldv_ptr_errFINAL(lines 6328 6335) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point ldv_ptr_errEXIT(lines 6328 6335) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point L5878(lines 5878 5885) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point ldv_zallocEXIT(lines 5870 5887) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point L5881(line 5881) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point L5881-1(line 5881) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point ldv_zallocENTRY(lines 5870 5887) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point ldv_zallocFINAL(lines 5870 5887) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) [2018-11-18 17:15:53,814 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point L6394(lines 6394 6398) no Hoare annotation was computed. [2018-11-18 17:15:53,814 INFO L421 ceAbstractionStarter]: At program point L6395(line 6395) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32))))) [2018-11-18 17:15:53,814 INFO L425 ceAbstractionStarter]: For program point L6393-2(lines 6388 6405) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L421 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 6388 6405) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32)))) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point L6393(lines 6393 6402) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point L6394-1(lines 6394 6398) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6388 6405) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5900 5908) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L421 ceAbstractionStarter]: At program point L5905(line 5905) the Hoare annotation is: (or (= |ldv_memset_#in~n| ldv_memset_~n) (not (= (_ bv0 32) ~ldv_state_variable_1~0)) (not (= (_ bv1 32) ~ldv_module_refcounter~0))) [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point L5905-1(line 5905) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L428 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5900 5908) the Hoare annotation is: true [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5900 5908) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6293 6301) no Hoare annotation was computed. [2018-11-18 17:15:53,815 INFO L421 ceAbstractionStarter]: At program point L6298(line 6298) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32)))) (and (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) (= ldv_module_put_6_~ldv_func_arg1.offset |ldv_module_put_6_#in~ldv_func_arg1.offset|) (= |ldv_module_put_6_#in~ldv_func_arg1.base| ldv_module_put_6_~ldv_func_arg1.base))) [2018-11-18 17:15:53,815 INFO L421 ceAbstractionStarter]: At program point ldv_module_put_6ENTRY(lines 6293 6301) the Hoare annotation is: (or (not (= (_ bv2 32) |old(~ldv_module_refcounter~0)|)) (forall ((v_pppox_create_~protocol_BEFORE_CALL_2 (_ BitVec 32))) (= ((_ sign_extend 32) (let ((.cse2 (bvadd |~#pppox_protos~0.offset| (bvmul (_ bv8 32) v_pppox_create_~protocol_BEFORE_CALL_2)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |~#pppox_protos~0.base|) .cse2)) (.cse1 (bvadd (select (select |#memory_$Pointer$.offset| |~#pppox_protos~0.base|) .cse2) (_ bv16 32)))) (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) ((_ sign_extend 32) (_ bv0 32)))) (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0)) [2018-11-18 17:15:53,816 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6293 6301) no Hoare annotation was computed. [2018-11-18 17:15:53,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:15:53 BoogieIcfgContainer [2018-11-18 17:15:53,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 17:15:53,826 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 17:15:53,826 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 17:15:53,826 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 17:15:53,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:15:13" (3/4) ... [2018-11-18 17:15:53,830 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_get [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_err_ptr [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err_or_null [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure lock_sock [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_ioctl [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_ptr [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-11-18 17:15:53,835 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_sk [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_ulong [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure unregister_pppox_proto [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_and_exit [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_unbind_sock [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_refcount [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure register_pppox_proto [2018-11-18 17:15:53,836 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~C_UINT~X~C_ULONG~TO~C_INT [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2018-11-18 17:15:53,837 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_ptr_err [2018-11-18 17:15:53,838 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-11-18 17:15:53,838 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-11-18 17:15:53,838 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-11-18 17:15:53,842 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2018-11-18 17:15:53,843 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2018-11-18 17:15:53,843 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-18 17:15:53,843 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 17:15:53,844 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 17:15:53,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || 1bv32 == ldv_module_refcounter [2018-11-18 17:15:53,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || 1bv32 == ldv_module_refcounter) || !(1bv32 == \old(ldv_module_refcounter)) [2018-11-18 17:15:53,864 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter [2018-11-18 17:15:53,893 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_147eb5b7-fbe4-410d-a0e8-34a3310a8383/bin-2019/uautomizer/witness.graphml [2018-11-18 17:15:53,893 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 17:15:53,893 INFO L168 Benchmark]: Toolchain (without parser) took 44258.28 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.7 MB). Free memory was 940.1 MB in the beginning and 957.5 MB in the end (delta: -17.4 MB). Peak memory consumption was 322.3 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:53,894 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:15:53,894 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1374.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 940.1 MB in the beginning and 981.5 MB in the end (delta: -41.4 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:53,894 INFO L168 Benchmark]: Boogie Preprocessor took 71.36 ms. Allocated memory is still 1.2 GB. Free memory was 981.5 MB in the beginning and 975.5 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:53,894 INFO L168 Benchmark]: RCFGBuilder took 2794.34 ms. Allocated memory is still 1.2 GB. Free memory was 975.5 MB in the beginning and 878.0 MB in the end (delta: 97.4 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:53,895 INFO L168 Benchmark]: TraceAbstraction took 39948.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 878.0 MB in the beginning and 975.4 MB in the end (delta: -97.3 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:53,895 INFO L168 Benchmark]: Witness Printer took 66.96 ms. Allocated memory is still 1.4 GB. Free memory was 975.4 MB in the beginning and 957.5 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2018-11-18 17:15:53,896 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1374.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 940.1 MB in the beginning and 981.5 MB in the end (delta: -41.4 MB). Peak memory consumption was 207.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.36 ms. Allocated memory is still 1.2 GB. Free memory was 981.5 MB in the beginning and 975.5 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2794.34 ms. Allocated memory is still 1.2 GB. Free memory was 975.5 MB in the beginning and 878.0 MB in the end (delta: 97.4 MB). Peak memory consumption was 97.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39948.15 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 878.0 MB in the beginning and 975.4 MB in the end (delta: -97.3 MB). Peak memory consumption was 76.2 MB. Max. memory is 11.5 GB. * Witness Printer took 66.96 ms. Allocated memory is still 1.4 GB. Free memory was 975.4 MB in the beginning and 957.5 MB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6309]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6200]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_state_variable_1)) || 1bv32 == ldv_module_refcounter) || !(1bv32 == \old(ldv_module_refcounter)) - InvariantResult [Line: 6200]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || 1bv32 == ldv_module_refcounter - InvariantResult [Line: 6132]: Loop Invariant Derived loop invariant: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 37 procedures, 219 locations, 1 error locations. SAFE Result, 39.8s OverallTime, 13 OverallIterations, 8 TraceHistogramMax, 31.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 1888 SDtfs, 642 SDslu, 7433 SDs, 0 SdLazy, 1008 SolverSat, 134 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 29.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1734 GetRequests, 1636 SyntacticMatches, 5 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=254occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 219 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 481 PreInvPairs, 516 NumberOfFragments, 798 HoareAnnotationTreeSize, 481 FomulaSimplifications, 1934 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 44 FomulaSimplificationsInter, 2219 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 1395 NumberOfCodeBlocks, 1315 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1706 ConstructedInterpolants, 13 QuantifiedInterpolants, 404624 SizeOfPredicates, 38 NumberOfNonLiveVariables, 5785 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 16 InterpolantComputations, 10 PerfectInterpolantSequences, 581/648 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...