./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_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/config/TaipanReach.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_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan --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 Taipan --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_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/config/TaipanReach.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_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan --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 Taipan --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 09:24:19,034 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:24:19,036 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:24:19,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:24:19,041 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:24:19,042 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:24:19,043 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:24:19,044 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:24:19,045 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:24:19,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:24:19,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:24:19,046 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:24:19,047 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:24:19,048 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:24:19,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:24:19,048 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:24:19,049 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:24:19,050 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:24:19,051 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:24:19,052 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:24:19,052 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:24:19,053 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:24:19,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:24:19,054 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:24:19,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:24:19,054 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:24:19,055 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:24:19,055 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:24:19,056 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:24:19,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:24:19,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:24:19,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:24:19,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:24:19,058 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:24:19,058 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:24:19,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:24:19,059 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-18 09:24:19,067 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:24:19,067 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:24:19,067 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:24:19,067 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:24:19,068 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:24:19,068 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:24:19,068 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:24:19,068 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 09:24:19,068 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:24:19,068 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:24:19,068 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-18 09:24:19,069 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 09:24:19,069 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 09:24:19,069 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:24:19,069 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:24:19,069 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:24:19,070 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:24:19,071 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:24:19,071 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:24:19,071 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:24:19,071 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:24:19,071 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:24:19,071 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:24:19,071 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-18 09:24:19,072 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan 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 -> Taipan 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 09:24:19,095 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:24:19,104 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:24:19,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:24:19,108 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:24:19,108 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:24:19,109 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/../../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 09:24:19,152 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/3adf5a9fa/d14a10d32ec641a88da3b42491cb34e9/FLAGd466e7a52 [2018-11-18 09:24:19,598 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:24:19,598 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/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 09:24:19,615 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/3adf5a9fa/d14a10d32ec641a88da3b42491cb34e9/FLAGd466e7a52 [2018-11-18 09:24:19,625 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/3adf5a9fa/d14a10d32ec641a88da3b42491cb34e9 [2018-11-18 09:24:19,627 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:24:19,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:24:19,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:24:19,629 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:24:19,631 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:24:19,632 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:24:19" (1/1) ... [2018-11-18 09:24:19,633 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25a8ae67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:19, skipping insertion in model container [2018-11-18 09:24:19,633 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:24:19" (1/1) ... [2018-11-18 09:24:19,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:24:19,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:24:20,473 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:24:20,499 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:24:20,815 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:24:20,845 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:24:20,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20 WrapperNode [2018-11-18 09:24:20,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:24:20,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:24:20,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:24:20,846 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:24:20,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,870 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:24:20,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:24:20,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:24:20,870 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:24:20,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,905 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,909 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... [2018-11-18 09:24:20,913 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:24:20,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:24:20,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:24:20,914 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:24:20,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:20,948 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-18 09:24:20,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-18 09:24:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:24:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:24:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-18 09:24:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-18 09:24:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 09:24:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:24:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:24:20,949 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-18 09:24:20,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-18 09:24:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 09:24:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:24:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 09:24:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 09:24:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:24:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-18 09:24:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-11-18 09:24:20,950 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-18 09:24:20,950 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-18 09:24:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-18 09:24:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-18 09:24:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-18 09:24:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-18 09:24:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:24:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-18 09:24:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 09:24:20,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 09:24:20,951 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-18 09:24:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-18 09:24:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-18 09:24:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-18 09:24:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 09:24:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 09:24:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-18 09:24:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-18 09:24:20,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:24:20,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:24:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-18 09:24:20,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-18 09:24:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 09:24:20,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 09:24:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-18 09:24:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:24:20,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:24:20,953 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-18 09:24:20,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-18 09:24:21,925 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:24:21,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:21 BoogieIcfgContainer [2018-11-18 09:24:21,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:24:21,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:24:21,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:24:21,929 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:24:21,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:24:19" (1/3) ... [2018-11-18 09:24:21,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f065fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:24:21, skipping insertion in model container [2018-11-18 09:24:21,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:20" (2/3) ... [2018-11-18 09:24:21,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f065fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:24:21, skipping insertion in model container [2018-11-18 09:24:21,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:21" (3/3) ... [2018-11-18 09:24:21,932 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 09:24:21,938 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:24:21,943 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:24:21,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:24:21,973 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:24:21,973 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:24:21,973 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:24:21,973 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:24:21,973 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:24:21,974 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:24:21,974 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:24:21,974 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:24:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-18 09:24:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:24:21,995 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:21,995 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 09:24:21,997 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:22,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:22,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1372440032, now seen corresponding path program 1 times [2018-11-18 09:24:22,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:22,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:22,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:22,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:22,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:22,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:22,276 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 09:24:22,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:22,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:22,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:22,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:22,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:22,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:22,296 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2018-11-18 09:24:22,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:22,669 INFO L93 Difference]: Finished difference Result 288 states and 370 transitions. [2018-11-18 09:24:22,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:22,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 09:24:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:22,679 INFO L225 Difference]: With dead ends: 288 [2018-11-18 09:24:22,680 INFO L226 Difference]: Without dead ends: 179 [2018-11-18 09:24:22,682 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 09:24:22,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-18 09:24:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-11-18 09:24:22,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 09:24:22,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 216 transitions. [2018-11-18 09:24:22,718 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 216 transitions. Word has length 63 [2018-11-18 09:24:22,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:22,719 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 216 transitions. [2018-11-18 09:24:22,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:22,720 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 216 transitions. [2018-11-18 09:24:22,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 09:24:22,722 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:22,722 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 09:24:22,722 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:22,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:22,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1118914089, now seen corresponding path program 1 times [2018-11-18 09:24:22,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:22,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:22,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:22,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:22,728 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:22,809 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 09:24:22,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:22,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:22,810 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:22,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:22,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:22,811 INFO L87 Difference]: Start difference. First operand 176 states and 216 transitions. Second operand 3 states. [2018-11-18 09:24:22,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:22,837 INFO L93 Difference]: Finished difference Result 186 states and 224 transitions. [2018-11-18 09:24:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:22,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 09:24:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:22,839 INFO L225 Difference]: With dead ends: 186 [2018-11-18 09:24:22,839 INFO L226 Difference]: Without dead ends: 181 [2018-11-18 09:24:22,840 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 09:24:22,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-18 09:24:22,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 176. [2018-11-18 09:24:22,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-11-18 09:24:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2018-11-18 09:24:22,851 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 66 [2018-11-18 09:24:22,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:22,851 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2018-11-18 09:24:22,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:22,851 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2018-11-18 09:24:22,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-18 09:24:22,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:22,852 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 09:24:22,853 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:22,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:22,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1176172391, now seen corresponding path program 1 times [2018-11-18 09:24:22,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:22,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:22,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:22,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:22,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:22,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:22,944 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 09:24:22,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:22,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:22,945 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:22,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:22,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:22,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:22,945 INFO L87 Difference]: Start difference. First operand 176 states and 215 transitions. Second operand 3 states. [2018-11-18 09:24:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:22,981 INFO L93 Difference]: Finished difference Result 463 states and 586 transitions. [2018-11-18 09:24:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:22,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2018-11-18 09:24:22,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:22,986 INFO L225 Difference]: With dead ends: 463 [2018-11-18 09:24:22,986 INFO L226 Difference]: Without dead ends: 311 [2018-11-18 09:24:22,987 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 09:24:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-11-18 09:24:23,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 307. [2018-11-18 09:24:23,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-11-18 09:24:23,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 385 transitions. [2018-11-18 09:24:23,006 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 385 transitions. Word has length 66 [2018-11-18 09:24:23,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:23,006 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 385 transitions. [2018-11-18 09:24:23,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 385 transitions. [2018-11-18 09:24:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 09:24:23,008 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:23,008 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 09:24:23,008 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:23,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:23,008 INFO L82 PathProgramCache]: Analyzing trace with hash -375229515, now seen corresponding path program 1 times [2018-11-18 09:24:23,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:23,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:23,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:23,081 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 09:24:23,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:23,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:23,082 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:23,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:23,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:23,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:23,083 INFO L87 Difference]: Start difference. First operand 307 states and 385 transitions. Second operand 3 states. [2018-11-18 09:24:23,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:23,110 INFO L93 Difference]: Finished difference Result 659 states and 839 transitions. [2018-11-18 09:24:23,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:23,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-18 09:24:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:23,112 INFO L225 Difference]: With dead ends: 659 [2018-11-18 09:24:23,112 INFO L226 Difference]: Without dead ends: 383 [2018-11-18 09:24:23,113 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 09:24:23,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-18 09:24:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 373. [2018-11-18 09:24:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-18 09:24:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 475 transitions. [2018-11-18 09:24:23,129 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 475 transitions. Word has length 85 [2018-11-18 09:24:23,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:23,129 INFO L480 AbstractCegarLoop]: Abstraction has 373 states and 475 transitions. [2018-11-18 09:24:23,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2018-11-18 09:24:23,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 09:24:23,131 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:23,131 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 09:24:23,131 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:23,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 975173508, now seen corresponding path program 1 times [2018-11-18 09:24:23,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:23,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,135 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:23,285 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 09:24:23,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:23,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:24:23,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:23,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:24:23,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:24:23,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:24:23,286 INFO L87 Difference]: Start difference. First operand 373 states and 475 transitions. Second operand 7 states. [2018-11-18 09:24:23,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:23,353 INFO L93 Difference]: Finished difference Result 751 states and 964 transitions. [2018-11-18 09:24:23,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:24:23,353 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-11-18 09:24:23,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:23,355 INFO L225 Difference]: With dead ends: 751 [2018-11-18 09:24:23,355 INFO L226 Difference]: Without dead ends: 409 [2018-11-18 09:24:23,356 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 09:24:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-11-18 09:24:23,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2018-11-18 09:24:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-18 09:24:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 509 transitions. [2018-11-18 09:24:23,372 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 509 transitions. Word has length 99 [2018-11-18 09:24:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:23,372 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 509 transitions. [2018-11-18 09:24:23,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:24:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 509 transitions. [2018-11-18 09:24:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 09:24:23,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:23,375 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 09:24:23,375 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:23,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash -304690170, now seen corresponding path program 1 times [2018-11-18 09:24:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:23,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:23,447 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 09:24:23,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:23,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:23,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:23,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:23,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:23,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:23,448 INFO L87 Difference]: Start difference. First operand 403 states and 509 transitions. Second operand 3 states. [2018-11-18 09:24:23,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:23,466 INFO L93 Difference]: Finished difference Result 750 states and 965 transitions. [2018-11-18 09:24:23,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:23,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-11-18 09:24:23,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:23,468 INFO L225 Difference]: With dead ends: 750 [2018-11-18 09:24:23,468 INFO L226 Difference]: Without dead ends: 378 [2018-11-18 09:24:23,469 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 09:24:23,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-11-18 09:24:23,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 366. [2018-11-18 09:24:23,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-11-18 09:24:23,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 462 transitions. [2018-11-18 09:24:23,482 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 462 transitions. Word has length 99 [2018-11-18 09:24:23,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:23,482 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 462 transitions. [2018-11-18 09:24:23,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 462 transitions. [2018-11-18 09:24:23,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-18 09:24:23,483 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:23,484 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 09:24:23,484 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:23,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:23,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1703024600, now seen corresponding path program 1 times [2018-11-18 09:24:23,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:23,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:23,644 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 09:24:23,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:23,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:24:23,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:23,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:24:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:24:23,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:24:23,645 INFO L87 Difference]: Start difference. First operand 366 states and 462 transitions. Second operand 7 states. [2018-11-18 09:24:24,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:24,636 INFO L93 Difference]: Finished difference Result 598 states and 749 transitions. [2018-11-18 09:24:24,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 09:24:24,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 105 [2018-11-18 09:24:24,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:24,639 INFO L225 Difference]: With dead ends: 598 [2018-11-18 09:24:24,640 INFO L226 Difference]: Without dead ends: 595 [2018-11-18 09:24:24,640 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 09:24:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2018-11-18 09:24:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 563. [2018-11-18 09:24:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-18 09:24:24,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 715 transitions. [2018-11-18 09:24:24,662 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 715 transitions. Word has length 105 [2018-11-18 09:24:24,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:24,663 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 715 transitions. [2018-11-18 09:24:24,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:24:24,663 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 715 transitions. [2018-11-18 09:24:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 09:24:24,664 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:24,664 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 09:24:24,664 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:24,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1937969375, now seen corresponding path program 1 times [2018-11-18 09:24:24,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:24,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:24,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:24,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:24,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:24,733 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 09:24:24,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:24,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:24,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:24,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:24,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:24,735 INFO L87 Difference]: Start difference. First operand 563 states and 715 transitions. Second operand 3 states. [2018-11-18 09:24:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:24,757 INFO L93 Difference]: Finished difference Result 974 states and 1237 transitions. [2018-11-18 09:24:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:24,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-11-18 09:24:24,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:24,760 INFO L225 Difference]: With dead ends: 974 [2018-11-18 09:24:24,760 INFO L226 Difference]: Without dead ends: 575 [2018-11-18 09:24:24,761 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 09:24:24,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2018-11-18 09:24:24,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 563. [2018-11-18 09:24:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-11-18 09:24:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 711 transitions. [2018-11-18 09:24:24,781 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 711 transitions. Word has length 111 [2018-11-18 09:24:24,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:24,782 INFO L480 AbstractCegarLoop]: Abstraction has 563 states and 711 transitions. [2018-11-18 09:24:24,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 711 transitions. [2018-11-18 09:24:24,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-18 09:24:24,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:24,783 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 09:24:24,783 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:24,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:24,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1515267549, now seen corresponding path program 1 times [2018-11-18 09:24:24,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:24,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:24,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:24,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:24,787 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:24,899 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 09:24:24,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:24,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-18 09:24:24,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:24,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 09:24:24,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 09:24:24,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-18 09:24:24,900 INFO L87 Difference]: Start difference. First operand 563 states and 711 transitions. Second operand 7 states. [2018-11-18 09:24:24,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:24,942 INFO L93 Difference]: Finished difference Result 966 states and 1219 transitions. [2018-11-18 09:24:24,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:24:24,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-11-18 09:24:24,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:24,945 INFO L225 Difference]: With dead ends: 966 [2018-11-18 09:24:24,945 INFO L226 Difference]: Without dead ends: 567 [2018-11-18 09:24:24,946 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 09:24:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-11-18 09:24:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 561. [2018-11-18 09:24:24,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-11-18 09:24:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 705 transitions. [2018-11-18 09:24:24,966 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 705 transitions. Word has length 111 [2018-11-18 09:24:24,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:24,967 INFO L480 AbstractCegarLoop]: Abstraction has 561 states and 705 transitions. [2018-11-18 09:24:24,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 09:24:24,967 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 705 transitions. [2018-11-18 09:24:24,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-18 09:24:24,968 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:24,968 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 09:24:24,969 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:24,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:24,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1293244994, now seen corresponding path program 1 times [2018-11-18 09:24:24,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:24,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:24,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:24,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:25,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:25,098 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 09:24:25,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:25,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:24:25,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 09:24:25,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:24:25,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:24:25,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:24:25,099 INFO L87 Difference]: Start difference. First operand 561 states and 705 transitions. Second operand 6 states. [2018-11-18 09:24:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:25,213 INFO L93 Difference]: Finished difference Result 1109 states and 1397 transitions. [2018-11-18 09:24:25,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:24:25,214 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2018-11-18 09:24:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:25,216 INFO L225 Difference]: With dead ends: 1109 [2018-11-18 09:24:25,216 INFO L226 Difference]: Without dead ends: 562 [2018-11-18 09:24:25,217 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 09:24:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-11-18 09:24:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2018-11-18 09:24:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2018-11-18 09:24:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 706 transitions. [2018-11-18 09:24:25,237 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 706 transitions. Word has length 126 [2018-11-18 09:24:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:25,237 INFO L480 AbstractCegarLoop]: Abstraction has 562 states and 706 transitions. [2018-11-18 09:24:25,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:24:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 706 transitions. [2018-11-18 09:24:25,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-11-18 09:24:25,239 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:25,239 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 09:24:25,239 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:25,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:25,239 INFO L82 PathProgramCache]: Analyzing trace with hash 568808060, now seen corresponding path program 1 times [2018-11-18 09:24:25,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 09:24:25,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:25,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:25,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:24:25,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 09:24:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-18 09:24:25,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:25,374 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 09:24:25,375 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 129 with the following transitions: [2018-11-18 09:24:25,376 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [8], [10], [12], [15], [18], [21], [24], [26], [45], [48], [51], [54], [57], [59], [63], [66], [69], [71], [74], [82], [115], [118], [120], [123], [126], [127], [130], [135], [138], [142], [147], [149], [152], [160], [162], [164], [166], [167], [170], [171], [172], [173], [174], [178], [180], [181], [182], [183], [184], [186], [187], [188], [189], [190], [191], [192], [194], [195], [198], [207], [220], [222], [223], [225], [226], [227], [229], [230], [231], [232], [233], [234], [235], [236], [237], [238], [239], [242], [243], [244], [245], [250], [252], [253], [254], [255], [256], [257], [258], [259], [260], [261], [262], [263], [264], [266], [267], [268], [272], [273], [274], [275] [2018-11-18 09:24:25,408 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 09:24:25,408 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 09:24:25,495 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) 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: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:288) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 09:24:25,502 INFO L168 Benchmark]: Toolchain (without parser) took 5874.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 211.3 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -154.8 MB). Peak memory consumption was 56.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:25,503 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:24:25,503 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1216.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:25,504 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:25,504 INFO L168 Benchmark]: Boogie Preprocessor took 43.16 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:25,505 INFO L168 Benchmark]: RCFGBuilder took 1012.48 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: 72.9 MB). Peak memory consumption was 72.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:24:25,507 INFO L168 Benchmark]: TraceAbstraction took 3574.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -68.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:24:25,511 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1216.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 950.0 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.16 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1012.48 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: 72.9 MB). Peak memory consumption was 72.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3574.82 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.5 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -68.7 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) 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 09:24:26,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:24:26,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:24:26,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:24:26,915 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:24:26,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:24:26,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:24:26,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:24:26,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:24:26,919 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:24:26,920 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:24:26,920 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:24:26,921 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:24:26,922 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:24:26,922 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:24:26,923 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:24:26,924 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:24:26,925 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:24:26,926 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:24:26,927 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:24:26,928 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:24:26,928 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:24:26,930 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:24:26,930 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:24:26,930 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:24:26,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:24:26,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:24:26,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:24:26,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:24:26,933 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:24:26,933 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:24:26,934 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:24:26,934 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:24:26,934 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:24:26,935 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:24:26,935 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:24:26,935 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-11-18 09:24:26,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:24:26,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:24:26,946 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 09:24:26,946 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 09:24:26,947 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 09:24:26,947 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 09:24:26,947 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 09:24:26,947 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 09:24:26,947 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 09:24:26,947 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 09:24:26,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:24:26,948 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:24:26,948 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 09:24:26,948 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 09:24:26,948 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 09:24:26,948 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 09:24:26,948 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 09:24:26,949 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:24:26,950 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:24:26,950 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 09:24:26,950 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 09:24:26,951 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 09:24:26,951 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 09:24:26,952 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 09:24:26,952 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 09:24:26,952 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 09:24:26,952 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan 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 -> Taipan 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 09:24:26,981 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:24:26,990 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:24:26,993 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:24:26,994 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:24:26,994 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:24:26,995 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/../../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 09:24:27,036 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/a1d77bb88/5d3279a284d94464933ba19eadda46c4/FLAGcd0bcaf9d [2018-11-18 09:24:27,483 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:24:27,483 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/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 09:24:27,502 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/a1d77bb88/5d3279a284d94464933ba19eadda46c4/FLAGcd0bcaf9d [2018-11-18 09:24:27,512 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/data/a1d77bb88/5d3279a284d94464933ba19eadda46c4 [2018-11-18 09:24:27,514 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:24:27,515 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:24:27,516 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:24:27,516 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:24:27,518 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:24:27,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:24:27" (1/1) ... [2018-11-18 09:24:27,520 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21c82c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:27, skipping insertion in model container [2018-11-18 09:24:27,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:24:27" (1/1) ... [2018-11-18 09:24:27,525 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:24:27,582 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:24:28,243 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:24:28,367 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:24:28,577 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:24:28,608 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:24:28,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28 WrapperNode [2018-11-18 09:24:28,608 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:24:28,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:24:28,609 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:24:28,609 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:24:28,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,632 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:24:28,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:24:28,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:24:28,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:24:28,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,668 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... [2018-11-18 09:24:28,681 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:24:28,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:24:28,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:24:28,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:24:28,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-11-18 09:24:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-11-18 09:24:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 09:24:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 09:24:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-11-18 09:24:28,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-11-18 09:24:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 09:24:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:24:28,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 09:24:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-11-18 09:24:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-11-18 09:24:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-11-18 09:24:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-11-18 09:24:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-11-18 09:24:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 09:24:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-11-18 09:24:28,721 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-11-18 09:24:28,721 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-18 09:24:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-18 09:24:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-11-18 09:24:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-11-18 09:24:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-11-18 09:24:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-11-18 09:24:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:24:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-11-18 09:24:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-11-18 09:24:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-11-18 09:24:28,722 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-11-18 09:24:28,722 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-11-18 09:24:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 09:24:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2018-11-18 09:24:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-11-18 09:24:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-11-18 09:24:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-11-18 09:24:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-11-18 09:24:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-11-18 09:24:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-11-18 09:24:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 09:24:28,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 09:24:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-11-18 09:24:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-11-18 09:24:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-11-18 09:24:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-11-18 09:24:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-11-18 09:24:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:24:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:24:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-11-18 09:24:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-11-18 09:24:31,312 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:24:31,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:31 BoogieIcfgContainer [2018-11-18 09:24:31,312 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:24:31,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 09:24:31,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 09:24:31,316 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 09:24:31,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:24:27" (1/3) ... [2018-11-18 09:24:31,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bdb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:24:31, skipping insertion in model container [2018-11-18 09:24:31,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:24:28" (2/3) ... [2018-11-18 09:24:31,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22bdb62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:24:31, skipping insertion in model container [2018-11-18 09:24:31,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:31" (3/3) ... [2018-11-18 09:24:31,318 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 09:24:31,324 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 09:24:31,328 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 09:24:31,337 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 09:24:31,356 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:24:31,357 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 09:24:31,357 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 09:24:31,357 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 09:24:31,357 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:24:31,358 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:24:31,358 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 09:24:31,358 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:24:31,358 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 09:24:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states. [2018-11-18 09:24:31,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 09:24:31,379 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:31,380 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 09:24:31,382 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:31,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1433647772, now seen corresponding path program 1 times [2018-11-18 09:24:31,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:31,389 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:31,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:31,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:31,622 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 09:24:31,622 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:31,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:31,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:31,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:31,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:31,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,645 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 3 states. [2018-11-18 09:24:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:31,699 INFO L93 Difference]: Finished difference Result 300 states and 389 transitions. [2018-11-18 09:24:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:31,700 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2018-11-18 09:24:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:31,710 INFO L225 Difference]: With dead ends: 300 [2018-11-18 09:24:31,710 INFO L226 Difference]: Without dead ends: 184 [2018-11-18 09:24:31,713 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 09:24:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-11-18 09:24:31,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-11-18 09:24:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-18 09:24:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2018-11-18 09:24:31,762 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 63 [2018-11-18 09:24:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:31,762 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2018-11-18 09:24:31,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2018-11-18 09:24:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-18 09:24:31,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:31,766 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 09:24:31,767 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:31,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:31,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2013214471, now seen corresponding path program 1 times [2018-11-18 09:24:31,768 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:31,768 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:31,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:31,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:31,978 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 09:24:31,978 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 (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 09:24:31,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:31,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:31,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:31,983 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand 3 states. [2018-11-18 09:24:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:32,029 INFO L93 Difference]: Finished difference Result 381 states and 483 transitions. [2018-11-18 09:24:32,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:32,030 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-11-18 09:24:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:32,032 INFO L225 Difference]: With dead ends: 381 [2018-11-18 09:24:32,032 INFO L226 Difference]: Without dead ends: 231 [2018-11-18 09:24:32,034 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 09:24:32,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-11-18 09:24:32,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2018-11-18 09:24:32,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-18 09:24:32,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 281 transitions. [2018-11-18 09:24:32,053 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 281 transitions. Word has length 85 [2018-11-18 09:24:32,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:32,053 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 281 transitions. [2018-11-18 09:24:32,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 281 transitions. [2018-11-18 09:24:32,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-18 09:24:32,055 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:32,056 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 09:24:32,056 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:32,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1030959608, now seen corresponding path program 1 times [2018-11-18 09:24:32,057 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:32,057 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:32,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:32,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:32,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:32,447 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 09:24:32,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:32,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:32,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 09:24:32,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 09:24:32,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:24:32,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:24:32,452 INFO L87 Difference]: Start difference. First operand 221 states and 281 transitions. Second operand 6 states. [2018-11-18 09:24:32,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:32,570 INFO L93 Difference]: Finished difference Result 429 states and 549 transitions. [2018-11-18 09:24:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:24:32,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-11-18 09:24:32,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:32,572 INFO L225 Difference]: With dead ends: 429 [2018-11-18 09:24:32,572 INFO L226 Difference]: Without dead ends: 222 [2018-11-18 09:24:32,573 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 09:24:32,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-11-18 09:24:32,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-11-18 09:24:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-18 09:24:32,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 282 transitions. [2018-11-18 09:24:32,587 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 282 transitions. Word has length 99 [2018-11-18 09:24:32,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:32,588 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 282 transitions. [2018-11-18 09:24:32,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 09:24:32,588 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 282 transitions. [2018-11-18 09:24:32,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-11-18 09:24:32,590 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:32,590 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 09:24:32,590 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:32,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:32,591 INFO L82 PathProgramCache]: Analyzing trace with hash -920440562, now seen corresponding path program 1 times [2018-11-18 09:24:32,591 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:32,591 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:32,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:32,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:32,978 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 09:24:32,978 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:33,143 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 09:24:33,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:33,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:33,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-18 09:24:33,346 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:33,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:24:33,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2018-11-18 09:24:33,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 09:24:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 09:24:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-11-18 09:24:33,364 INFO L87 Difference]: Start difference. First operand 222 states and 282 transitions. Second operand 16 states. [2018-11-18 09:24:33,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:33,633 INFO L93 Difference]: Finished difference Result 449 states and 576 transitions. [2018-11-18 09:24:33,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 09:24:33,634 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 101 [2018-11-18 09:24:33,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:33,635 INFO L225 Difference]: With dead ends: 449 [2018-11-18 09:24:33,635 INFO L226 Difference]: Without dead ends: 241 [2018-11-18 09:24:33,636 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-11-18 09:24:33,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-18 09:24:33,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 230. [2018-11-18 09:24:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-18 09:24:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 289 transitions. [2018-11-18 09:24:33,650 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 289 transitions. Word has length 101 [2018-11-18 09:24:33,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:33,650 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 289 transitions. [2018-11-18 09:24:33,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 09:24:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 289 transitions. [2018-11-18 09:24:33,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-18 09:24:33,651 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:33,652 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 09:24:33,652 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:33,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:33,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1512431414, now seen corresponding path program 1 times [2018-11-18 09:24:33,654 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:33,654 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:33,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:33,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:33,804 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 09:24:33,804 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:33,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:33,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:33,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:33,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:33,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:33,807 INFO L87 Difference]: Start difference. First operand 230 states and 289 transitions. Second operand 3 states. [2018-11-18 09:24:33,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:33,823 INFO L93 Difference]: Finished difference Result 418 states and 537 transitions. [2018-11-18 09:24:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:33,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-11-18 09:24:33,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:33,824 INFO L225 Difference]: With dead ends: 418 [2018-11-18 09:24:33,824 INFO L226 Difference]: Without dead ends: 221 [2018-11-18 09:24:33,825 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 09:24:33,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-18 09:24:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2018-11-18 09:24:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-11-18 09:24:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 272 transitions. [2018-11-18 09:24:33,836 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 272 transitions. Word has length 103 [2018-11-18 09:24:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:33,836 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 272 transitions. [2018-11-18 09:24:33,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 272 transitions. [2018-11-18 09:24:33,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-18 09:24:33,838 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:33,838 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 09:24:33,838 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:33,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:33,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1008151020, now seen corresponding path program 1 times [2018-11-18 09:24:33,839 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:33,839 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:33,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:34,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:34,206 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 09:24:34,206 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:34,430 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 09:24:34,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:34,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:34,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:34,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:34,674 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 09:24:34,674 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:34,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-11-18 09:24:34,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 17 [2018-11-18 09:24:34,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-18 09:24:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-18 09:24:34,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-11-18 09:24:34,693 INFO L87 Difference]: Start difference. First operand 215 states and 272 transitions. Second operand 17 states. [2018-11-18 09:24:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:41,837 INFO L93 Difference]: Finished difference Result 626 states and 800 transitions. [2018-11-18 09:24:41,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-18 09:24:41,838 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 109 [2018-11-18 09:24:41,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:41,840 INFO L225 Difference]: With dead ends: 626 [2018-11-18 09:24:41,840 INFO L226 Difference]: Without dead ends: 418 [2018-11-18 09:24:41,841 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 312 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-11-18 09:24:41,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-11-18 09:24:41,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 250. [2018-11-18 09:24:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 09:24:41,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 307 transitions. [2018-11-18 09:24:41,853 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 307 transitions. Word has length 109 [2018-11-18 09:24:41,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:41,853 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 307 transitions. [2018-11-18 09:24:41,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-18 09:24:41,853 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 307 transitions. [2018-11-18 09:24:41,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 09:24:41,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:41,854 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 09:24:41,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:41,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:41,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1355562411, now seen corresponding path program 1 times [2018-11-18 09:24:41,855 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:41,855 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:41,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:41,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:41,978 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 09:24:41,978 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:41,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:41,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 09:24:41,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 09:24:41,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:24:41,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:24:41,981 INFO L87 Difference]: Start difference. First operand 250 states and 307 transitions. Second operand 3 states. [2018-11-18 09:24:41,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:41,993 INFO L93 Difference]: Finished difference Result 371 states and 458 transitions. [2018-11-18 09:24:41,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:24:41,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-11-18 09:24:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:41,995 INFO L225 Difference]: With dead ends: 371 [2018-11-18 09:24:41,995 INFO L226 Difference]: Without dead ends: 259 [2018-11-18 09:24:41,996 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 09:24:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-11-18 09:24:42,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 250. [2018-11-18 09:24:42,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-18 09:24:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 305 transitions. [2018-11-18 09:24:42,004 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 305 transitions. Word has length 117 [2018-11-18 09:24:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:42,004 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 305 transitions. [2018-11-18 09:24:42,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 09:24:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 305 transitions. [2018-11-18 09:24:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-18 09:24:42,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:42,006 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 09:24:42,006 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:42,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1778264237, now seen corresponding path program 1 times [2018-11-18 09:24:42,006 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:42,006 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:42,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:42,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:42,409 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 09:24:42,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:42,667 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 09:24:42,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 09:24:42,669 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 09:24:42,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:42,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:42,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:42,911 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-11-18 09:24:42,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 09:24:43,185 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 09:24:43,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-11-18 09:24:43,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9, 8] total 26 [2018-11-18 09:24:43,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 09:24:43,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 09:24:43,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-11-18 09:24:43,204 INFO L87 Difference]: Start difference. First operand 250 states and 305 transitions. Second operand 26 states. [2018-11-18 09:24:46,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:46,122 INFO L93 Difference]: Finished difference Result 679 states and 840 transitions. [2018-11-18 09:24:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 09:24:46,123 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 117 [2018-11-18 09:24:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:46,124 INFO L225 Difference]: With dead ends: 679 [2018-11-18 09:24:46,124 INFO L226 Difference]: Without dead ends: 443 [2018-11-18 09:24:46,125 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 442 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=945, Unknown=0, NotChecked=0, Total=1056 [2018-11-18 09:24:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-11-18 09:24:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 428. [2018-11-18 09:24:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-11-18 09:24:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 517 transitions. [2018-11-18 09:24:46,140 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 517 transitions. Word has length 117 [2018-11-18 09:24:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:46,140 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 517 transitions. [2018-11-18 09:24:46,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 09:24:46,140 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 517 transitions. [2018-11-18 09:24:46,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 09:24:46,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:46,142 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 09:24:46,142 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:46,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:46,142 INFO L82 PathProgramCache]: Analyzing trace with hash -818273090, now seen corresponding path program 1 times [2018-11-18 09:24:46,142 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:46,143 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:46,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:46,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:46,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:46,955 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 09:24:46,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:46,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:46,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-18 09:24:46,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 09:24:46,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 09:24:46,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:24:46,959 INFO L87 Difference]: Start difference. First operand 428 states and 517 transitions. Second operand 8 states. [2018-11-18 09:24:51,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:24:51,160 INFO L93 Difference]: Finished difference Result 841 states and 1026 transitions. [2018-11-18 09:24:51,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 09:24:51,161 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2018-11-18 09:24:51,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:24:51,163 INFO L225 Difference]: With dead ends: 841 [2018-11-18 09:24:51,163 INFO L226 Difference]: Without dead ends: 448 [2018-11-18 09:24:51,164 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-18 09:24:51,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-11-18 09:24:51,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 436. [2018-11-18 09:24:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-11-18 09:24:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 525 transitions. [2018-11-18 09:24:51,177 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 525 transitions. Word has length 134 [2018-11-18 09:24:51,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:24:51,177 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 525 transitions. [2018-11-18 09:24:51,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 09:24:51,177 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 525 transitions. [2018-11-18 09:24:51,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-11-18 09:24:51,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 09:24:51,179 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 09:24:51,179 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 09:24:51,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:24:51,179 INFO L82 PathProgramCache]: Analyzing trace with hash -777598340, now seen corresponding path program 1 times [2018-11-18 09:24:51,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 09:24:51,180 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/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 09:24:51,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:24:51,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:24:51,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:24:52,855 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 09:24:52,855 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 09:24:52,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:24:52,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-18 09:24:52,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 09:24:52,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 09:24:52,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-11-18 09:24:52,858 INFO L87 Difference]: Start difference. First operand 436 states and 525 transitions. Second operand 14 states. [2018-11-18 09:25:05,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:25:05,323 INFO L93 Difference]: Finished difference Result 615 states and 746 transitions. [2018-11-18 09:25:05,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-18 09:25:05,325 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2018-11-18 09:25:05,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 09:25:05,326 INFO L225 Difference]: With dead ends: 615 [2018-11-18 09:25:05,326 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 09:25:05,327 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 09:25:05,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 09:25:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 09:25:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 09:25:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 09:25:05,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 134 [2018-11-18 09:25:05,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 09:25:05,328 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:25:05,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 09:25:05,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:25:05,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 09:25:05,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 09:25:05,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:25:05,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:25:05,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:25:05,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:25:05,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:25:05,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-18 09:25:05,988 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-11-18 09:25:06,122 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-11-18 09:25:06,352 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 20 [2018-11-18 09:25:06,711 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2018-11-18 09:25:06,865 WARN L180 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 14 [2018-11-18 09:25:07,090 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 7 [2018-11-18 09:25:07,309 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-11-18 09:25:07,439 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-11-18 09:25:07,582 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L428 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-11-18 09:25:07,633 INFO L428 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L428 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5909 5917) the Hoare annotation is: true [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5909 5917) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5909 5917) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point L6237(lines 6237 6268) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 6188 6283) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point L6213(lines 6213 6276) no Hoare annotation was computed. [2018-11-18 09:25:07,633 INFO L425 ceAbstractionStarter]: For program point L6238(line 6238) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6247(line 6247) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6214(line 6214) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6280(line 6280) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6239(lines 6239 6245) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L421 ceAbstractionStarter]: At program point L6206(line 6206) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6206-1(line 6206) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 6188 6283) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6215(lines 6215 6232) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6248(lines 6248 6264) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L421 ceAbstractionStarter]: At program point L6207(line 6207) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6240-1(line 6240) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6207-1(line 6207) no Hoare annotation was computed. [2018-11-18 09:25:07,634 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 09:25:07,634 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 09:25:07,634 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)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= (bvadd ~ldv_state_variable_0~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6249-1(line 6249) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6274(line 6274) no Hoare annotation was computed. [2018-11-18 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6266(line 6266) no Hoare annotation was computed. [2018-11-18 09:25:07,634 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 09:25:07,634 INFO L425 ceAbstractionStarter]: For program point L6250(lines 6250 6255) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6217(lines 6217 6228) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6250-2(lines 6248 6262) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L428 ceAbstractionStarter]: At program point L6275(line 6275) the Hoare annotation is: true [2018-11-18 09:25:07,635 INFO L428 ceAbstractionStarter]: At program point L6267(line 6267) the Hoare annotation is: true [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6234(line 6234) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L421 ceAbstractionStarter]: At program point L6201(line 6201) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6201-1(line 6201) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6226(line 6226) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6218(line 6218) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6235(lines 6235 6272) no Hoare annotation was computed. [2018-11-18 09:25:07,635 INFO L428 ceAbstractionStarter]: At program point L6227(line 6227) the Hoare annotation is: true [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6219(lines 6219 6224) no Hoare annotation was computed. [2018-11-18 09:25:07,635 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)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0))) [2018-11-18 09:25:07,635 INFO L421 ceAbstractionStarter]: At program point L6203(line 6203) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0) (= ~ldv_state_variable_1~0 (_ bv0 32))) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|))) [2018-11-18 09:25:07,635 INFO L425 ceAbstractionStarter]: For program point L6203-1(line 6203) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point L6220-1(line 6220) no Hoare annotation was computed. [2018-11-18 09:25:07,636 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)|)) (and (= |main_~#ldvarg0~0.offset| (_ bv0 32)) (= |main_~#ldvarg2~0.offset| (_ bv0 32)) (= (_ bv1 32) ~ldv_module_refcounter~0))) [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5888 5899) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5888 5899) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L428 ceAbstractionStarter]: At program point L5894(line 5894) the Hoare annotation is: true [2018-11-18 09:25:07,636 INFO L428 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5888 5899) the Hoare annotation is: true [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point L5894-1(line 5894) no Hoare annotation was computed. [2018-11-18 09:25:07,636 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 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point L6374(lines 6374 6384) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point L6375-1(line 6375) no Hoare annotation was computed. [2018-11-18 09:25:07,636 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 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point L6376(lines 6376 6381) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6369 6387) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6369 6387) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6167 6175) no Hoare annotation was computed. [2018-11-18 09:25:07,636 INFO L428 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6167 6175) the Hoare annotation is: true [2018-11-18 09:25:07,636 INFO L425 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6167 6175) no Hoare annotation was computed. [2018-11-18 09:25:07,636 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 09:25:07,636 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 09:25:07,636 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 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,637 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 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6309) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6303 6311) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L428 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6303 6311) the Hoare annotation is: true [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6303 6311) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6284 6292) no Hoare annotation was computed. [2018-11-18 09:25:07,637 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 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6289-1(line 6289) no Hoare annotation was computed. [2018-11-18 09:25:07,637 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 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6284 6292) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6140-2(lines 6140 6144) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6140(lines 6140 6144) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6134(lines 6134 6138) no Hoare annotation was computed. [2018-11-18 09:25:07,637 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 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6161-1(line 6161) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6126 6165) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6149-2(lines 6147 6159) no Hoare annotation was computed. [2018-11-18 09:25:07,637 INFO L425 ceAbstractionStarter]: For program point L6149(lines 6149 6153) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point L6145(lines 6145 6159) no Hoare annotation was computed. [2018-11-18 09:25:07,638 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 09:25:07,638 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 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point L6160-1(line 6160) no Hoare annotation was computed. [2018-11-18 09:25:07,638 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 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6126 6165) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point L6148-1(line 6148) no Hoare annotation was computed. [2018-11-18 09:25:07,638 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 09:25:07,638 INFO L428 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6424 6436) the Hoare annotation is: true [2018-11-18 09:25:07,638 INFO L421 ceAbstractionStarter]: At program point L6430(line 6430) the Hoare annotation is: (not (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point L6429(lines 6424 6436) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6424 6436) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5936 5944) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5936 5944) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L428 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5936 5944) the Hoare annotation is: true [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,638 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 09:25:07,638 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,638 INFO L425 ceAbstractionStarter]: For program point L6394(lines 6394 6398) no Hoare annotation was computed. [2018-11-18 09:25:07,639 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 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point L6393-2(lines 6388 6405) no Hoare annotation was computed. [2018-11-18 09:25:07,639 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 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point L6393(lines 6393 6402) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point L6394-1(lines 6394 6398) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6388 6405) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5900 5908) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L421 ceAbstractionStarter]: At program point L5905(line 5905) the Hoare annotation is: (or (not (= (_ bv0 32) ~ldv_state_variable_1~0)) (not (= (_ bv1 32) ~ldv_module_refcounter~0)) (and (= |ldv_memset_#in~n| ldv_memset_~n) (= |ldv_memset_#in~s.offset| ldv_memset_~s.offset))) [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point L5905-1(line 5905) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L428 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5900 5908) the Hoare annotation is: true [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5900 5908) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L428 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6293 6301) no Hoare annotation was computed. [2018-11-18 09:25:07,639 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 09:25:07,639 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 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6293 6301) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6176 6184) no Hoare annotation was computed. [2018-11-18 09:25:07,639 INFO L428 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6176 6184) the Hoare annotation is: true [2018-11-18 09:25:07,639 INFO L425 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6176 6184) no Hoare annotation was computed. [2018-11-18 09:25:07,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 09:25:07 BoogieIcfgContainer [2018-11-18 09:25:07,651 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 09:25:07,652 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:25:07,652 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:25:07,652 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:25:07,652 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:24:31" (3/4) ... [2018-11-18 09:25:07,655 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-11-18 09:25:07,660 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-11-18 09:25:07,661 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-11-18 09:25:07,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 78 nodes and edges [2018-11-18 09:25:07,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 33 nodes and edges [2018-11-18 09:25:07,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-11-18 09:25:07,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 09:25:07,666 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-18 09:25:07,683 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || ((ldvarg0 == 0bv32 && ldvarg2 == 0bv32) && 1bv32 == ldv_module_refcounter) [2018-11-18 09:25:07,684 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 09:25:07,684 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter [2018-11-18 09:25:07,714 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_529c6d44-dec7-42b8-9d47-30caf8efb2d7/bin-2019/utaipan/witness.graphml [2018-11-18 09:25:07,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:25:07,714 INFO L168 Benchmark]: Toolchain (without parser) took 40199.79 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 373.8 MB). Free memory was 939.0 MB in the beginning and 1.2 GB in the end (delta: -301.5 MB). Peak memory consumption was 72.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:25:07,715 INFO L168 Benchmark]: CDTParser took 0.16 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 09:25:07,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1093.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 939.0 MB in the beginning and 1.0 GB in the end (delta: -63.9 MB). Peak memory consumption was 207.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:25:07,715 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:25:07,715 INFO L168 Benchmark]: Boogie Preprocessor took 42.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.0 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:25:07,715 INFO L168 Benchmark]: RCFGBuilder took 2630.53 ms. Allocated memory is still 1.2 GB. Free memory was 997.0 MB in the beginning and 927.6 MB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2018-11-18 09:25:07,716 INFO L168 Benchmark]: TraceAbstraction took 36338.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 927.6 MB in the beginning and 1.3 GB in the end (delta: -323.7 MB). Peak memory consumption was 227.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:25:07,716 INFO L168 Benchmark]: Witness Printer took 61.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:25:07,717 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.16 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 1093.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 939.0 MB in the beginning and 1.0 GB in the end (delta: -63.9 MB). Peak memory consumption was 207.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.56 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 997.0 MB in the end (delta: 5.9 MB). Peak memory consumption was 5.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2630.53 ms. Allocated memory is still 1.2 GB. Free memory was 997.0 MB in the beginning and 927.6 MB in the end (delta: 69.4 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 36338.47 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 181.4 MB). Free memory was 927.6 MB in the beginning and 1.3 GB in the end (delta: -323.7 MB). Peak memory consumption was 227.6 MB. Max. memory is 11.5 GB. * Witness Printer took 61.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 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))) || ((ldvarg0 == 0bv32 && ldvarg2 == 0bv32) && 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 19 procedures, 127 locations, 1 error locations. SAFE Result, 36.2s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 27.3s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1549 SDtfs, 787 SDslu, 9286 SDs, 0 SdLazy, 1643 SolverSat, 155 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 25.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1855 GetRequests, 1740 SyntacticMatches, 5 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436occurred in iteration=9, 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, 10 MinimizatonAttempts, 234 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 44 LocationsWithAnnotation, 488 PreInvPairs, 539 NumberOfFragments, 852 HoareAnnotationTreeSize, 488 FomulaSimplifications, 3528 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 44 FomulaSimplificationsInter, 5239 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1389 NumberOfCodeBlocks, 1389 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1816 ConstructedInterpolants, 12 QuantifiedInterpolants, 425049 SizeOfPredicates, 45 NumberOfNonLiveVariables, 6001 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 593/662 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...