./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.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.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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 5ff4911e3fc4b31379d272e7a417bab5f7414e68 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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.i -s /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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 5ff4911e3fc4b31379d272e7a417bab5f7414e68 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 04:42:48,520 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:42:48,520 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:42:48,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:42:48,527 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:42:48,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:42:48,528 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:42:48,528 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:42:48,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:42:48,529 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:42:48,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:42:48,530 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:42:48,530 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:42:48,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:42:48,531 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:42:48,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:42:48,532 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:42:48,533 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:42:48,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:42:48,534 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:42:48,535 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:42:48,535 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:42:48,536 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:42:48,536 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:42:48,537 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:42:48,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:42:48,537 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:42:48,538 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:42:48,538 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:42:48,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:42:48,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:42:48,539 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:42:48,539 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:42:48,539 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:42:48,540 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:42:48,540 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:42:48,540 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Default.epf [2018-12-03 04:42:48,547 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:42:48,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:42:48,548 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:42:48,548 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 04:42:48,548 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:42:48,549 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:42:48,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:42:48,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:42:48,550 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 04:42:48,550 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-12-03 04:42:48,550 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_97e14e10-3be1-4192-ae0b-ee902695b087/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 -> 5ff4911e3fc4b31379d272e7a417bab5f7414e68 [2018-12-03 04:42:48,567 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:42:48,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:42:48,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:42:48,577 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:42:48,577 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:42:48,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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.i [2018-12-03 04:42:48,612 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/855bbe751/1f6bf4fc635b44348b6e6a7fde55ec54/FLAG0d48b9c29 [2018-12-03 04:42:49,091 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:42:49,092 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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.i [2018-12-03 04:42:49,106 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/855bbe751/1f6bf4fc635b44348b6e6a7fde55ec54/FLAG0d48b9c29 [2018-12-03 04:42:49,115 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/855bbe751/1f6bf4fc635b44348b6e6a7fde55ec54 [2018-12-03 04:42:49,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:42:49,118 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:42:49,118 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:42:49,118 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:42:49,121 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:42:49,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,123 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@340dd8fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49, skipping insertion in model container [2018-12-03 04:42:49,123 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,128 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:42:49,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:42:49,677 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:42:49,691 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:42:49,784 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:42:49,804 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:42:49,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49 WrapperNode [2018-12-03 04:42:49,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:42:49,805 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:42:49,805 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:42:49,805 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:42:49,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,822 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,828 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:42:49,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:42:49,829 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:42:49,829 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:42:49,835 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,839 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... [2018-12-03 04:42:49,861 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:42:49,861 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:42:49,861 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:42:49,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:42:49,862 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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-12-03 04:42:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-03 04:42:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-03 04:42:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 04:42:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 04:42:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-03 04:42:49,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-03 04:42:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:42:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-03 04:42:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-12-03 04:42:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-03 04:42:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-03 04:42:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-03 04:42:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-03 04:42:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-03 04:42:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-03 04:42:49,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-03 04:42:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-03 04:42:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 04:42:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 04:42:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-12-03 04:42:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-12-03 04:42:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-03 04:42:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-03 04:42:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-03 04:42:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-03 04:42:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:42:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:42:49,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-03 04:42:49,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-03 04:42:50,252 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:42:50,252 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 04:42:50,253 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:50 BoogieIcfgContainer [2018-12-03 04:42:50,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:42:50,254 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:42:50,254 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:42:50,256 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:42:50,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:42:49" (1/3) ... [2018-12-03 04:42:50,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fc51d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:50, skipping insertion in model container [2018-12-03 04:42:50,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:42:49" (2/3) ... [2018-12-03 04:42:50,258 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19fc51d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:42:50, skipping insertion in model container [2018-12-03 04:42:50,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:42:50" (3/3) ... [2018-12-03 04:42:50,259 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.i [2018-12-03 04:42:50,268 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:42:50,275 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 04:42:50,289 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 04:42:50,315 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:42:50,315 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:42:50,315 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:42:50,315 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:42:50,316 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:42:50,316 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:42:50,316 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:42:50,316 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:42:50,331 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states. [2018-12-03 04:42:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 04:42:50,335 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:50,336 INFO L402 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] [2018-12-03 04:42:50,338 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:50,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2145327332, now seen corresponding path program 1 times [2018-12-03 04:42:50,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:50,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:50,578 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 04:42:50,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:50,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:50,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:50,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:50,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:50,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:50,598 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 3 states. [2018-12-03 04:42:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:50,653 INFO L93 Difference]: Finished difference Result 308 states and 394 transitions. [2018-12-03 04:42:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:50,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-12-03 04:42:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:50,661 INFO L225 Difference]: With dead ends: 308 [2018-12-03 04:42:50,662 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 04:42:50,664 INFO L631 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-12-03 04:42:50,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 04:42:50,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-12-03 04:42:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 04:42:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 229 transitions. [2018-12-03 04:42:50,700 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 229 transitions. Word has length 71 [2018-12-03 04:42:50,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:50,702 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 229 transitions. [2018-12-03 04:42:50,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:50,702 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 229 transitions. [2018-12-03 04:42:50,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 04:42:50,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:50,705 INFO L402 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] [2018-12-03 04:42:50,705 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:50,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:50,705 INFO L82 PathProgramCache]: Analyzing trace with hash -897537356, now seen corresponding path program 1 times [2018-12-03 04:42:50,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:50,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 04:42:50,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:50,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:50,784 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:50,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:50,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:50,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:50,786 INFO L87 Difference]: Start difference. First operand 188 states and 229 transitions. Second operand 3 states. [2018-12-03 04:42:50,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:50,811 INFO L93 Difference]: Finished difference Result 198 states and 237 transitions. [2018-12-03 04:42:50,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:50,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-03 04:42:50,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:50,813 INFO L225 Difference]: With dead ends: 198 [2018-12-03 04:42:50,813 INFO L226 Difference]: Without dead ends: 193 [2018-12-03 04:42:50,813 INFO L631 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-12-03 04:42:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-12-03 04:42:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 188. [2018-12-03 04:42:50,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 04:42:50,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 228 transitions. [2018-12-03 04:42:50,824 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 228 transitions. Word has length 76 [2018-12-03 04:42:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:50,824 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 228 transitions. [2018-12-03 04:42:50,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2018-12-03 04:42:50,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 04:42:50,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:50,825 INFO L402 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] [2018-12-03 04:42:50,825 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:50,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:50,826 INFO L82 PathProgramCache]: Analyzing trace with hash -840279054, now seen corresponding path program 1 times [2018-12-03 04:42:50,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:50,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:50,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:50,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:50,891 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 04:42:50,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:50,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:50,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:50,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:50,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:50,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:50,892 INFO L87 Difference]: Start difference. First operand 188 states and 228 transitions. Second operand 3 states. [2018-12-03 04:42:50,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:50,924 INFO L93 Difference]: Finished difference Result 491 states and 615 transitions. [2018-12-03 04:42:50,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:50,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-12-03 04:42:50,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:50,928 INFO L225 Difference]: With dead ends: 491 [2018-12-03 04:42:50,929 INFO L226 Difference]: Without dead ends: 328 [2018-12-03 04:42:50,930 INFO L631 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-12-03 04:42:50,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-12-03 04:42:50,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 324. [2018-12-03 04:42:50,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-12-03 04:42:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 403 transitions. [2018-12-03 04:42:50,954 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 403 transitions. Word has length 76 [2018-12-03 04:42:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:50,955 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 403 transitions. [2018-12-03 04:42:50,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 403 transitions. [2018-12-03 04:42:50,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 04:42:50,957 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:50,957 INFO L402 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] [2018-12-03 04:42:50,957 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:50,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:50,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1016867802, now seen corresponding path program 1 times [2018-12-03 04:42:50,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:50,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:50,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:51,056 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-03 04:42:51,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:51,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:51,056 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:51,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:51,057 INFO L87 Difference]: Start difference. First operand 324 states and 403 transitions. Second operand 3 states. [2018-12-03 04:42:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:51,097 INFO L93 Difference]: Finished difference Result 702 states and 883 transitions. [2018-12-03 04:42:51,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:51,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2018-12-03 04:42:51,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:51,100 INFO L225 Difference]: With dead ends: 702 [2018-12-03 04:42:51,100 INFO L226 Difference]: Without dead ends: 413 [2018-12-03 04:42:51,102 INFO L631 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-12-03 04:42:51,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-12-03 04:42:51,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 400. [2018-12-03 04:42:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-12-03 04:42:51,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 503 transitions. [2018-12-03 04:42:51,123 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 503 transitions. Word has length 90 [2018-12-03 04:42:51,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:51,123 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 503 transitions. [2018-12-03 04:42:51,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:51,123 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 503 transitions. [2018-12-03 04:42:51,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 04:42:51,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:51,125 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:51,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:51,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:51,126 INFO L82 PathProgramCache]: Analyzing trace with hash 2136446144, now seen corresponding path program 1 times [2018-12-03 04:42:51,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:51,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:51,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:51,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:51,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:51,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:42:51,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:51,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:42:51,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:42:51,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:42:51,253 INFO L87 Difference]: Start difference. First operand 400 states and 503 transitions. Second operand 7 states. [2018-12-03 04:42:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:51,286 INFO L93 Difference]: Finished difference Result 801 states and 1015 transitions. [2018-12-03 04:42:51,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:42:51,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 109 [2018-12-03 04:42:51,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:51,288 INFO L225 Difference]: With dead ends: 801 [2018-12-03 04:42:51,288 INFO L226 Difference]: Without dead ends: 436 [2018-12-03 04:42:51,289 INFO L631 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-12-03 04:42:51,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-12-03 04:42:51,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 430. [2018-12-03 04:42:51,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-03 04:42:51,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 537 transitions. [2018-12-03 04:42:51,301 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 537 transitions. Word has length 109 [2018-12-03 04:42:51,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:51,301 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 537 transitions. [2018-12-03 04:42:51,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:42:51,301 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 537 transitions. [2018-12-03 04:42:51,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 04:42:51,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:51,302 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:51,303 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:51,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:51,303 INFO L82 PathProgramCache]: Analyzing trace with hash 856582466, now seen corresponding path program 1 times [2018-12-03 04:42:51,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:51,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:51,350 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:51,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:51,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:51,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:51,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:51,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:51,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:51,351 INFO L87 Difference]: Start difference. First operand 430 states and 537 transitions. Second operand 3 states. [2018-12-03 04:42:51,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:51,366 INFO L93 Difference]: Finished difference Result 800 states and 1016 transitions. [2018-12-03 04:42:51,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:51,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2018-12-03 04:42:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:51,367 INFO L225 Difference]: With dead ends: 800 [2018-12-03 04:42:51,367 INFO L226 Difference]: Without dead ends: 405 [2018-12-03 04:42:51,368 INFO L631 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-12-03 04:42:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-12-03 04:42:51,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 393. [2018-12-03 04:42:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-12-03 04:42:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 490 transitions. [2018-12-03 04:42:51,379 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 490 transitions. Word has length 109 [2018-12-03 04:42:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:51,379 INFO L480 AbstractCegarLoop]: Abstraction has 393 states and 490 transitions. [2018-12-03 04:42:51,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:51,379 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 490 transitions. [2018-12-03 04:42:51,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 04:42:51,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:51,380 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:51,380 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:51,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:51,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1389124644, now seen corresponding path program 1 times [2018-12-03 04:42:51,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:51,482 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:51,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:51,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:42:51,482 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:51,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:42:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:42:51,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:42:51,483 INFO L87 Difference]: Start difference. First operand 393 states and 490 transitions. Second operand 7 states. [2018-12-03 04:42:51,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:51,884 INFO L93 Difference]: Finished difference Result 638 states and 790 transitions. [2018-12-03 04:42:51,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 04:42:51,884 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-03 04:42:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:51,886 INFO L225 Difference]: With dead ends: 638 [2018-12-03 04:42:51,887 INFO L226 Difference]: Without dead ends: 635 [2018-12-03 04:42:51,887 INFO L631 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-12-03 04:42:51,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2018-12-03 04:42:51,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 600. [2018-12-03 04:42:51,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-03 04:42:51,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 753 transitions. [2018-12-03 04:42:51,906 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 753 transitions. Word has length 115 [2018-12-03 04:42:51,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:51,907 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 753 transitions. [2018-12-03 04:42:51,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:42:51,907 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 753 transitions. [2018-12-03 04:42:51,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 04:42:51,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:51,908 INFO L402 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] [2018-12-03 04:42:51,909 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:51,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:51,909 INFO L82 PathProgramCache]: Analyzing trace with hash 577868148, now seen corresponding path program 1 times [2018-12-03 04:42:51,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:51,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:51,971 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:51,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:51,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:42:51,971 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:51,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:42:51,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:42:51,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:42:51,972 INFO L87 Difference]: Start difference. First operand 600 states and 753 transitions. Second operand 3 states. [2018-12-03 04:42:51,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:51,989 INFO L93 Difference]: Finished difference Result 1034 states and 1298 transitions. [2018-12-03 04:42:51,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:42:51,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-12-03 04:42:51,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:51,991 INFO L225 Difference]: With dead ends: 1034 [2018-12-03 04:42:51,991 INFO L226 Difference]: Without dead ends: 612 [2018-12-03 04:42:51,992 INFO L631 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-12-03 04:42:51,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-03 04:42:52,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2018-12-03 04:42:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-03 04:42:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 749 transitions. [2018-12-03 04:42:52,008 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 749 transitions. Word has length 124 [2018-12-03 04:42:52,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:52,008 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 749 transitions. [2018-12-03 04:42:52,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:42:52,008 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 749 transitions. [2018-12-03 04:42:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 04:42:52,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:52,009 INFO L402 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] [2018-12-03 04:42:52,009 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:52,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:52,009 INFO L82 PathProgramCache]: Analyzing trace with hash 443854642, now seen corresponding path program 1 times [2018-12-03 04:42:52,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:52,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:52,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:52,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:52,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:52,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:42:52,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 04:42:52,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:52,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 04:42:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 04:42:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 04:42:52,096 INFO L87 Difference]: Start difference. First operand 600 states and 749 transitions. Second operand 7 states. [2018-12-03 04:42:52,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:52,126 INFO L93 Difference]: Finished difference Result 1026 states and 1280 transitions. [2018-12-03 04:42:52,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 04:42:52,127 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-12-03 04:42:52,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:52,128 INFO L225 Difference]: With dead ends: 1026 [2018-12-03 04:42:52,128 INFO L226 Difference]: Without dead ends: 604 [2018-12-03 04:42:52,129 INFO L631 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-12-03 04:42:52,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-12-03 04:42:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2018-12-03 04:42:52,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2018-12-03 04:42:52,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 743 transitions. [2018-12-03 04:42:52,145 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 743 transitions. Word has length 124 [2018-12-03 04:42:52,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:52,145 INFO L480 AbstractCegarLoop]: Abstraction has 598 states and 743 transitions. [2018-12-03 04:42:52,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 04:42:52,145 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 743 transitions. [2018-12-03 04:42:52,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 04:42:52,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:52,146 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:52,146 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:52,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:52,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1431815232, now seen corresponding path program 1 times [2018-12-03 04:42:52,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:52,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:52,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:52,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:52,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:52,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:52,278 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:52,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:52,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 04:42:52,279 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 140 with the following transitions: [2018-12-03 04:42:52,280 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [9], [11], [13], [16], [19], [22], [25], [27], [46], [49], [52], [55], [58], [60], [64], [67], [70], [72], [75], [83], [116], [119], [121], [124], [127], [128], [129], [130], [133], [138], [141], [145], [150], [152], [155], [163], [165], [167], [169], [170], [174], [175], [181], [182], [184], [185], [191], [192], [193], [194], [195], [197], [198], [199], [201], [202], [203], [204], [205], [207], [208], [211], [217], [218], [222], [235], [237], [238], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [251], [252], [253], [254], [255], [256], [259], [260], [261], [262], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [287], [288], [289], [293], [294], [295], [296] [2018-12-03 04:42:52,306 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 04:42:52,306 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 04:42:53,388 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 04:42:53,389 INFO L272 AbstractInterpreter]: Visited 118 different actions 499 times. Merged at 21 different actions 88 times. Widened at 1 different actions 2 times. Performed 15229 root evaluator evaluations with a maximum evaluation depth of 10. Performed 15229 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 7 fixpoints after 4 different actions. Largest state had 131 variables. [2018-12-03 04:42:53,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:53,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 04:42:53,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:53,396 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:42:53,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:53,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 04:42:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:53,525 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:42:53,586 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:53,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:42:53,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 04:42:53,779 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 04:42:53,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 12 [2018-12-03 04:42:53,779 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:53,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:42:53,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:42:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-12-03 04:42:53,780 INFO L87 Difference]: Start difference. First operand 598 states and 743 transitions. Second operand 6 states. [2018-12-03 04:42:53,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:53,838 INFO L93 Difference]: Finished difference Result 1195 states and 1486 transitions. [2018-12-03 04:42:53,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:42:53,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 139 [2018-12-03 04:42:53,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:53,840 INFO L225 Difference]: With dead ends: 1195 [2018-12-03 04:42:53,840 INFO L226 Difference]: Without dead ends: 599 [2018-12-03 04:42:53,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 270 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-12-03 04:42:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-12-03 04:42:53,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2018-12-03 04:42:53,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2018-12-03 04:42:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 744 transitions. [2018-12-03 04:42:53,859 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 744 transitions. Word has length 139 [2018-12-03 04:42:53,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:53,860 INFO L480 AbstractCegarLoop]: Abstraction has 599 states and 744 transitions. [2018-12-03 04:42:53,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:42:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 744 transitions. [2018-12-03 04:42:53,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 04:42:53,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:53,861 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:53,861 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:53,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:53,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1548976622, now seen corresponding path program 1 times [2018-12-03 04:42:53,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:53,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:53,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:53,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:53,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:53,965 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 04:42:53,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:53,966 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 04:42:53,966 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 142 with the following transitions: [2018-12-03 04:42:53,966 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [9], [11], [13], [16], [19], [22], [25], [27], [46], [49], [52], [55], [58], [60], [64], [67], [70], [72], [75], [83], [116], [119], [121], [124], [127], [128], [129], [130], [133], [138], [141], [145], [150], [152], [155], [163], [165], [167], [169], [170], [174], [175], [179], [181], [182], [184], [185], [191], [192], [193], [194], [195], [197], [198], [199], [201], [202], [203], [204], [205], [207], [208], [211], [217], [218], [222], [235], [237], [238], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [251], [252], [253], [254], [255], [256], [259], [260], [261], [262], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [287], [288], [289], [293], [294], [295], [296] [2018-12-03 04:42:53,970 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 04:42:53,970 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 04:42:54,772 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 04:42:54,772 INFO L272 AbstractInterpreter]: Visited 119 different actions 517 times. Merged at 24 different actions 100 times. Widened at 1 different actions 2 times. Performed 15333 root evaluator evaluations with a maximum evaluation depth of 10. Performed 15333 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 13 fixpoints after 6 different actions. Largest state had 131 variables. [2018-12-03 04:42:54,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:54,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 04:42:54,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:54,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:42:54,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:54,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 04:42:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:54,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:42:54,938 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 04:42:54,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:42:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 04:42:55,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 04:42:55,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 11 [2018-12-03 04:42:55,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 04:42:55,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:42:55,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:42:55,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-03 04:42:55,119 INFO L87 Difference]: Start difference. First operand 599 states and 744 transitions. Second operand 6 states. [2018-12-03 04:42:55,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:42:55,172 INFO L93 Difference]: Finished difference Result 1180 states and 1469 transitions. [2018-12-03 04:42:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:42:55,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2018-12-03 04:42:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:42:55,174 INFO L225 Difference]: With dead ends: 1180 [2018-12-03 04:42:55,174 INFO L226 Difference]: Without dead ends: 600 [2018-12-03 04:42:55,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 289 GetRequests, 274 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-03 04:42:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-12-03 04:42:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2018-12-03 04:42:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-03 04:42:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 745 transitions. [2018-12-03 04:42:55,189 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 745 transitions. Word has length 141 [2018-12-03 04:42:55,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:42:55,189 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 745 transitions. [2018-12-03 04:42:55,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:42:55,189 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 745 transitions. [2018-12-03 04:42:55,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 04:42:55,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:42:55,190 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:42:55,190 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:42:55,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 620175688, now seen corresponding path program 1 times [2018-12-03 04:42:55,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 04:42:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:55,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:55,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 04:42:55,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 04:42:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-12-03 04:42:55,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:55,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 04:42:55,278 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 144 with the following transitions: [2018-12-03 04:42:55,278 INFO L205 CegarAbsIntRunner]: [0], [1], [2], [4], [6], [9], [11], [13], [16], [19], [22], [25], [27], [46], [49], [52], [55], [58], [60], [64], [67], [70], [72], [75], [83], [116], [119], [121], [124], [127], [128], [129], [130], [133], [138], [141], [145], [150], [152], [155], [163], [165], [167], [169], [170], [174], [175], [179], [181], [182], [184], [185], [189], [191], [192], [193], [194], [195], [197], [198], [199], [201], [202], [203], [204], [205], [207], [208], [211], [217], [218], [222], [235], [237], [238], [240], [241], [242], [244], [245], [246], [247], [248], [249], [250], [251], [252], [253], [254], [255], [256], [259], [260], [261], [262], [267], [269], [270], [271], [272], [273], [274], [275], [276], [277], [278], [279], [280], [281], [282], [283], [284], [285], [287], [288], [289], [293], [294], [295], [296] [2018-12-03 04:42:55,280 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 04:42:55,280 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 04:42:55,986 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 04:42:55,986 INFO L272 AbstractInterpreter]: Visited 120 different actions 539 times. Merged at 27 different actions 115 times. Widened at 2 different actions 3 times. Performed 15509 root evaluator evaluations with a maximum evaluation depth of 10. Performed 15509 inverse root evaluator evaluations with a maximum inverse evaluation depth of 10. Found 20 fixpoints after 8 different actions. Largest state had 131 variables. [2018-12-03 04:42:55,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:42:55,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 04:42:55,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:42:55,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:42:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:42:55,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 04:42:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:42:56,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:42:56,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 152 [2018-12-03 04:42:56,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,186 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 147 [2018-12-03 04:42:56,416 WARN L180 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-03 04:42:56,421 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,423 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 130 [2018-12-03 04:42:56,527 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-12-03 04:42:56,532 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 124 [2018-12-03 04:42:56,653 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-03 04:42:56,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,663 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,666 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,669 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,677 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,678 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 123 [2018-12-03 04:42:56,815 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2018-12-03 04:42:56,821 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,823 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,826 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,833 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 133 [2018-12-03 04:42:56,955 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-03 04:42:56,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,961 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,963 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,964 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:56,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-12-03 04:42:57,094 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-03 04:42:57,098 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,101 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,102 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,103 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,104 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,105 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,106 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,107 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,108 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,110 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-12-03 04:42:57,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-12-03 04:42:57,115 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,164 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,267 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,319 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,372 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,427 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:57,527 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,534 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 140 [2018-12-03 04:42:57,854 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2018-12-03 04:42:57,859 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:57,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 138 [2018-12-03 04:42:58,210 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 73 [2018-12-03 04:42:58,216 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,218 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,226 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,231 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 127 [2018-12-03 04:42:58,333 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-12-03 04:42:58,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,341 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,348 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,351 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,353 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 133 [2018-12-03 04:42:58,465 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-12-03 04:42:58,469 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,471 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,474 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,475 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,478 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,479 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,482 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,483 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-12-03 04:42:58,586 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2018-12-03 04:42:58,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,592 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,594 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,595 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,598 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,600 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,601 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-12-03 04:42:58,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-12-03 04:42:58,606 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:58,655 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:58,704 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:58,754 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:58,814 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:58,945 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,947 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,951 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,962 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,978 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:58,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 141 [2018-12-03 04:42:59,391 WARN L180 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 77 [2018-12-03 04:42:59,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,415 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,416 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 137 [2018-12-03 04:42:59,536 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2018-12-03 04:42:59,540 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,546 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,549 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,551 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,554 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,555 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,556 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-12-03 04:42:59,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-12-03 04:42:59,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-12-03 04:42:59,652 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-03 04:42:59,704 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:59,752 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:59,808 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:42:59,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,917 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,919 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,921 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,926 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:42:59,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 155 [2018-12-03 04:43:00,267 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 87 [2018-12-03 04:43:00,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,271 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,274 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,276 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,277 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,278 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 158 [2018-12-03 04:43:00,395 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 65 [2018-12-03 04:43:00,399 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,400 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,401 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,405 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,406 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,408 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,409 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,410 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-12-03 04:43:00,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-12-03 04:43:00,417 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:00,470 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:00,532 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:00,637 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,660 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:00,677 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 27 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 172 [2018-12-03 04:43:01,016 WARN L180 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 95 [2018-12-03 04:43:01,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,024 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,028 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,029 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,032 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,034 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,037 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,038 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 35 disjoint index pairs (out of 36 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 200 [2018-12-03 04:43:01,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 186 [2018-12-03 04:43:01,058 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:01,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,246 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,248 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,249 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,252 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,254 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,255 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,256 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,257 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 196 [2018-12-03 04:43:01,265 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-12-03 04:43:01,559 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 04:43:01,897 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,900 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,903 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,904 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,905 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,906 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,908 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,909 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:01,913 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 182 [2018-12-03 04:43:01,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-12-03 04:43:01,919 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:01,992 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:02,285 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-12-03 04:43:02,641 INFO L267 ElimStorePlain]: Start of recursive call 23: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-12-03 04:43:03,033 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-12-03 04:43:03,496 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-12-03 04:43:04,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,016 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,023 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 124 [2018-12-03 04:43:04,135 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-12-03 04:43:04,141 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,153 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,156 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,159 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,160 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 123 [2018-12-03 04:43:04,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,221 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,222 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,223 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,224 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,227 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 133 [2018-12-03 04:43:04,294 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,295 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,296 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,299 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,300 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,301 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 146 [2018-12-03 04:43:04,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,387 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,388 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,391 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,392 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,394 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:04,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 170 [2018-12-03 04:43:04,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 29 disjoint index pairs (out of 28 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 162 [2018-12-03 04:43:04,401 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,452 INFO L267 ElimStorePlain]: Start of recursive call 37: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,499 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,565 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,619 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:04,674 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:05,621 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-12-03 04:43:06,741 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-03 04:43:07,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-12-03 04:43:08,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, End of recursive call: 56 dim-0 vars, and 9 xjuncts. [2018-12-03 04:43:08,046 INFO L202 ElimStorePlain]: Needed 38 recursive calls to eliminate 8 variables, input treesize:188, output treesize:1539 [2018-12-03 04:43:17,963 WARN L180 SmtUtils]: Spent 9.84 s on a formula simplification. DAG size of input: 707 DAG size of output: 257 [2018-12-03 04:43:26,062 WARN L180 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 257 [2018-12-03 04:43:26,632 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification that was a NOOP. DAG size: 286 [2018-12-03 04:43:26,638 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,640 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,645 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,649 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,650 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,651 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,652 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,653 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,657 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,658 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,662 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,664 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,668 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:26,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 54 disjoint index pairs (out of 55 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 366 [2018-12-03 04:43:26,683 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 352 [2018-12-03 04:43:26,684 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:27,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,174 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,177 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,178 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,182 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:27,199 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 55 disjoint index pairs (out of 55 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 226 treesize of output 330 [2018-12-03 04:43:27,201 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-03 04:43:27,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-03 04:43:28,607 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,609 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,611 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,612 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,613 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,614 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,616 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,618 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,620 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,621 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,623 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,624 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:28,626 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 199 treesize of output 266 [2018-12-03 04:43:28,630 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 240 [2018-12-03 04:43:28,631 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:28,744 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:29,449 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,450 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,451 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,452 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,453 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,454 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,455 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,456 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,457 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,458 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,459 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,460 INFO L701 Elim1Store]: detected not equals via solver [2018-12-03 04:43:29,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 196 treesize of output 333 [2018-12-03 04:43:29,466 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 237 [2018-12-03 04:43:29,467 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:29,613 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:30,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 3 dim-1 vars, End of recursive call: 34 dim-0 vars, and 5 xjuncts. [2018-12-03 04:43:30,365 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 23 variables, input treesize:594, output treesize:1270 [2018-12-03 04:43:36,722 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-03 04:43:36,923 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:43:36,924 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:187) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 45 more [2018-12-03 04:43:36,928 INFO L168 Benchmark]: Toolchain (without parser) took 47811.01 ms. Allocated memory was 1.0 GB in the beginning and 1.9 GB in the end (delta: 863.0 MB). Free memory was 941.5 MB in the beginning and 1.7 GB in the end (delta: -786.3 MB). Peak memory consumption was 941.7 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:36,929 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:43:36,929 INFO L168 Benchmark]: CACSL2BoogieTranslator took 686.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 941.5 MB in the beginning and 1.0 GB in the end (delta: -93.4 MB). Peak memory consumption was 98.8 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:36,930 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:36,930 INFO L168 Benchmark]: Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:36,931 INFO L168 Benchmark]: RCFGBuilder took 391.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 966.8 MB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:36,931 INFO L168 Benchmark]: TraceAbstraction took 46674.14 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 757.6 MB). Free memory was 966.8 MB in the beginning and 1.7 GB in the end (delta: -761.1 MB). Peak memory consumption was 861.5 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:36,932 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 686.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.4 MB). Free memory was 941.5 MB in the beginning and 1.0 GB in the end (delta: -93.4 MB). Peak memory consumption was 98.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 391.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 966.8 MB in the end (delta: 62.8 MB). Peak memory consumption was 62.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 46674.14 ms. Allocated memory was 1.1 GB in the beginning and 1.9 GB in the end (delta: 757.6 MB). Free memory was 966.8 MB in the beginning and 1.7 GB in the end (delta: -761.1 MB). Peak memory consumption was 861.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-03 04:43:37,969 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 04:43:37,970 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 04:43:37,976 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 04:43:37,977 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 04:43:37,977 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 04:43:37,978 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 04:43:37,979 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 04:43:37,979 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 04:43:37,980 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 04:43:37,980 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 04:43:37,980 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 04:43:37,981 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 04:43:37,981 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 04:43:37,982 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 04:43:37,982 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 04:43:37,982 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 04:43:37,983 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 04:43:37,984 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 04:43:37,985 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 04:43:37,985 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 04:43:37,986 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 04:43:37,987 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 04:43:37,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 04:43:37,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 04:43:37,988 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 04:43:37,988 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 04:43:37,989 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 04:43:37,989 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 04:43:37,989 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 04:43:37,990 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 04:43:37,990 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 04:43:37,990 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 04:43:37,990 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 04:43:37,991 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 04:43:37,991 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 04:43:37,991 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/config/svcomp-Reach-64bit-Taipan_Bitvector.epf [2018-12-03 04:43:37,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 04:43:37,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 04:43:37,999 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 04:43:37,999 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 04:43:37,999 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 04:43:37,999 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 04:43:37,999 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 04:43:37,999 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 04:43:37,999 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 04:43:37,999 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 04:43:38,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-03 04:43:38,000 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 04:43:38,001 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 04:43:38,001 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-03 04:43:38,001 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-03 04:43:38,002 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_97e14e10-3be1-4192-ae0b-ee902695b087/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 -> 5ff4911e3fc4b31379d272e7a417bab5f7414e68 [2018-12-03 04:43:38,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 04:43:38,027 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 04:43:38,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 04:43:38,030 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 04:43:38,031 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 04:43:38,031 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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.i [2018-12-03 04:43:38,067 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/bbe438b81/b82d07dd81bf4b36bb0704bcc3f8dfec/FLAG020ca7851 [2018-12-03 04:43:38,574 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 04:43:38,574 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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.i [2018-12-03 04:43:38,591 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/bbe438b81/b82d07dd81bf4b36bb0704bcc3f8dfec/FLAG020ca7851 [2018-12-03 04:43:39,099 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/data/bbe438b81/b82d07dd81bf4b36bb0704bcc3f8dfec [2018-12-03 04:43:39,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 04:43:39,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 04:43:39,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 04:43:39,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 04:43:39,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 04:43:39,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47abe2bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39, skipping insertion in model container [2018-12-03 04:43:39,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 04:43:39,171 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 04:43:39,781 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:43:39,802 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 04:43:39,926 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 04:43:39,956 INFO L195 MainTranslator]: Completed translation [2018-12-03 04:43:39,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39 WrapperNode [2018-12-03 04:43:39,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 04:43:39,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 04:43:39,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 04:43:39,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 04:43:39,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,980 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 04:43:39,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 04:43:39,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 04:43:39,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 04:43:39,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:39,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:40,017 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:40,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:40,026 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... [2018-12-03 04:43:40,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 04:43:40,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 04:43:40,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 04:43:40,032 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 04:43:40,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/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-12-03 04:43:40,070 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2018-12-03 04:43:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2018-12-03 04:43:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 04:43:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 04:43:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get [2018-12-03 04:43:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get [2018-12-03 04:43:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 04:43:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-03 04:43:40,071 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2018-12-03 04:43:40,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2018-12-03 04:43:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2018-12-03 04:43:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2018-12-03 04:43:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-03 04:43:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-03 04:43:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-03 04:43:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_init [2018-12-03 04:43:40,072 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_init [2018-12-03 04:43:40,072 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-03 04:43:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-03 04:43:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2018-12-03 04:43:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2018-12-03 04:43:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put_6 [2018-12-03 04:43:40,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put_6 [2018-12-03 04:43:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 04:43:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-03 04:43:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2018-12-03 04:43:40,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-12-03 04:43:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure sock_unregister [2018-12-03 04:43:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_unregister [2018-12-03 04:43:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2018-12-03 04:43:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2018-12-03 04:43:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_create [2018-12-03 04:43:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_create [2018-12-03 04:43:40,074 INFO L130 BoogieDeclarations]: Found specification of procedure pppox_exit [2018-12-03 04:43:40,074 INFO L138 BoogieDeclarations]: Found implementation of procedure pppox_exit [2018-12-03 04:43:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-03 04:43:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-03 04:43:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2018-12-03 04:43:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2018-12-03 04:43:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 04:43:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 04:43:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_try_module_get_5 [2018-12-03 04:43:40,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_try_module_get_5 [2018-12-03 04:43:40,075 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2018-12-03 04:43:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2018-12-03 04:43:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure sock_register [2018-12-03 04:43:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_register [2018-12-03 04:43:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 04:43:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 04:43:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2018-12-03 04:43:40,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2018-12-03 04:43:40,511 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 04:43:40,512 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 04:43:40,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:40 BoogieIcfgContainer [2018-12-03 04:43:40,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 04:43:40,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 04:43:40,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 04:43:40,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 04:43:40,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 04:43:39" (1/3) ... [2018-12-03 04:43:40,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a7c151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:43:40, skipping insertion in model container [2018-12-03 04:43:40,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 04:43:39" (2/3) ... [2018-12-03 04:43:40,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77a7c151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:43:40, skipping insertion in model container [2018-12-03 04:43:40,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:40" (3/3) ... [2018-12-03 04:43:40,517 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.i [2018-12-03 04:43:40,523 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 04:43:40,528 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 04:43:40,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 04:43:40,562 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-03 04:43:40,563 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 04:43:40,563 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 04:43:40,563 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 04:43:40,563 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 04:43:40,563 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 04:43:40,563 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 04:43:40,563 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 04:43:40,563 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 04:43:40,579 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-12-03 04:43:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 04:43:40,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:40,587 INFO L402 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] [2018-12-03 04:43:40,588 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:40,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:40,591 INFO L82 PathProgramCache]: Analyzing trace with hash 250893536, now seen corresponding path program 1 times [2018-12-03 04:43:40,595 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:40,595 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:40,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:40,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 04:43:40,834 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:40,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:40,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:43:40,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:43:40,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:43:40,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:43:40,854 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 3 states. [2018-12-03 04:43:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:40,907 INFO L93 Difference]: Finished difference Result 327 states and 419 transitions. [2018-12-03 04:43:40,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:43:40,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-03 04:43:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:40,917 INFO L225 Difference]: With dead ends: 327 [2018-12-03 04:43:40,917 INFO L226 Difference]: Without dead ends: 200 [2018-12-03 04:43:40,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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-12-03 04:43:40,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-03 04:43:40,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2018-12-03 04:43:40,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 04:43:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 241 transitions. [2018-12-03 04:43:40,958 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 241 transitions. Word has length 69 [2018-12-03 04:43:40,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:40,958 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 241 transitions. [2018-12-03 04:43:40,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:43:40,959 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 241 transitions. [2018-12-03 04:43:40,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 04:43:40,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:40,961 INFO L402 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, 1, 1, 1] [2018-12-03 04:43:40,961 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:40,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:40,962 INFO L82 PathProgramCache]: Analyzing trace with hash 469035080, now seen corresponding path program 1 times [2018-12-03 04:43:40,962 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:40,962 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:40,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:41,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-03 04:43:41,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:41,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:43:41,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:43:41,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:43:41,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:43:41,133 INFO L87 Difference]: Start difference. First operand 197 states and 241 transitions. Second operand 3 states. [2018-12-03 04:43:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:41,186 INFO L93 Difference]: Finished difference Result 423 states and 525 transitions. [2018-12-03 04:43:41,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:43:41,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2018-12-03 04:43:41,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:41,189 INFO L225 Difference]: With dead ends: 423 [2018-12-03 04:43:41,189 INFO L226 Difference]: Without dead ends: 260 [2018-12-03 04:43:41,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 86 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-12-03 04:43:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-03 04:43:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 247. [2018-12-03 04:43:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-03 04:43:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 307 transitions. [2018-12-03 04:43:41,213 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 307 transitions. Word has length 88 [2018-12-03 04:43:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:41,214 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 307 transitions. [2018-12-03 04:43:41,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:43:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 307 transitions. [2018-12-03 04:43:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 04:43:41,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:41,216 INFO L402 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, 1, 1] [2018-12-03 04:43:41,217 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:41,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1305361854, now seen corresponding path program 1 times [2018-12-03 04:43:41,218 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:41,218 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:41,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:41,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:41,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-12-03 04:43:41,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2018-12-03 04:43:41,434 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:41,440 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:41,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-03 04:43:41,460 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2018-12-03 04:43:41,460 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-03 04:43:41,464 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:41,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-03 04:43:41,467 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:46, output treesize:7 [2018-12-03 04:43:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-03 04:43:41,492 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:41,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:41,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 04:43:41,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 04:43:41,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 04:43:41,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 04:43:41,495 INFO L87 Difference]: Start difference. First operand 247 states and 307 transitions. Second operand 5 states. [2018-12-03 04:43:41,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:41,638 INFO L93 Difference]: Finished difference Result 470 states and 592 transitions. [2018-12-03 04:43:41,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 04:43:41,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-12-03 04:43:41,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:41,641 INFO L225 Difference]: With dead ends: 470 [2018-12-03 04:43:41,641 INFO L226 Difference]: Without dead ends: 257 [2018-12-03 04:43:41,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:43:41,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-03 04:43:41,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-12-03 04:43:41,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-12-03 04:43:41,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 314 transitions. [2018-12-03 04:43:41,653 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 314 transitions. Word has length 107 [2018-12-03 04:43:41,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:41,653 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 314 transitions. [2018-12-03 04:43:41,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 04:43:41,653 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 314 transitions. [2018-12-03 04:43:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 04:43:41,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:41,654 INFO L402 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, 1, 1] [2018-12-03 04:43:41,655 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:41,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:41,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1603402048, now seen corresponding path program 1 times [2018-12-03 04:43:41,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:41,656 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:41,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:42,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:42,070 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-03 04:43:42,070 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:42,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:42,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 04:43:42,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 04:43:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 04:43:42,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 04:43:42,075 INFO L87 Difference]: Start difference. First operand 254 states and 314 transitions. Second operand 6 states. [2018-12-03 04:43:42,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:42,162 INFO L93 Difference]: Finished difference Result 492 states and 612 transitions. [2018-12-03 04:43:42,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 04:43:42,162 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2018-12-03 04:43:42,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:42,164 INFO L225 Difference]: With dead ends: 492 [2018-12-03 04:43:42,164 INFO L226 Difference]: Without dead ends: 255 [2018-12-03 04:43:42,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 102 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-12-03 04:43:42,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-12-03 04:43:42,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-12-03 04:43:42,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 04:43:42,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 315 transitions. [2018-12-03 04:43:42,178 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 315 transitions. Word has length 107 [2018-12-03 04:43:42,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:42,178 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 315 transitions. [2018-12-03 04:43:42,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 04:43:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 315 transitions. [2018-12-03 04:43:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 04:43:42,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:42,180 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:42,180 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:42,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1129967362, now seen corresponding path program 1 times [2018-12-03 04:43:42,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:42,181 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:42,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:42,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:42,591 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-03 04:43:42,592 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:43:42,758 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 04:43:42,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:43:42,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:43:42,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:42,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:42,863 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-03 04:43:42,938 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:42,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 04:43:42,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 16 [2018-12-03 04:43:42,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 04:43:42,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 04:43:42,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2018-12-03 04:43:42,957 INFO L87 Difference]: Start difference. First operand 255 states and 315 transitions. Second operand 16 states. [2018-12-03 04:43:43,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:43,257 INFO L93 Difference]: Finished difference Result 512 states and 639 transitions. [2018-12-03 04:43:43,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 04:43:43,257 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-12-03 04:43:43,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:43,259 INFO L225 Difference]: With dead ends: 512 [2018-12-03 04:43:43,259 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 04:43:43,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 310 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2018-12-03 04:43:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 04:43:43,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 263. [2018-12-03 04:43:43,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-12-03 04:43:43,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 322 transitions. [2018-12-03 04:43:43,269 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 322 transitions. Word has length 109 [2018-12-03 04:43:43,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:43,269 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 322 transitions. [2018-12-03 04:43:43,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 04:43:43,269 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 322 transitions. [2018-12-03 04:43:43,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 04:43:43,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:43,270 INFO L402 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, 1, 1] [2018-12-03 04:43:43,271 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:43,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1649188542, now seen corresponding path program 1 times [2018-12-03 04:43:43,271 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:43,271 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:43,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:43,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:43,409 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 04:43:43,410 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:43,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:43,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:43:43,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:43:43,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:43:43,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:43:43,412 INFO L87 Difference]: Start difference. First operand 263 states and 322 transitions. Second operand 3 states. [2018-12-03 04:43:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:43,425 INFO L93 Difference]: Finished difference Result 481 states and 600 transitions. [2018-12-03 04:43:43,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:43:43,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2018-12-03 04:43:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:43,427 INFO L225 Difference]: With dead ends: 481 [2018-12-03 04:43:43,427 INFO L226 Difference]: Without dead ends: 254 [2018-12-03 04:43:43,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 109 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-12-03 04:43:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-03 04:43:43,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2018-12-03 04:43:43,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-03 04:43:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 305 transitions. [2018-12-03 04:43:43,434 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 305 transitions. Word has length 111 [2018-12-03 04:43:43,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:43,434 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 305 transitions. [2018-12-03 04:43:43,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:43:43,434 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 305 transitions. [2018-12-03 04:43:43,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 04:43:43,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:43,435 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:43,435 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:43,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1486664420, now seen corresponding path program 1 times [2018-12-03 04:43:43,436 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:43,436 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:43,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:43,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:43,890 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 17 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-03 04:43:43,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:43:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-03 04:43:44,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:43:44,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:43:44,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:44,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-03 04:43:44,373 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:44,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-03 04:43:44,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 8] total 17 [2018-12-03 04:43:44,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 04:43:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 04:43:44,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-12-03 04:43:44,392 INFO L87 Difference]: Start difference. First operand 248 states and 305 transitions. Second operand 17 states. [2018-12-03 04:43:45,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:45,663 INFO L93 Difference]: Finished difference Result 725 states and 899 transitions. [2018-12-03 04:43:45,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 04:43:45,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 117 [2018-12-03 04:43:45,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:45,665 INFO L225 Difference]: With dead ends: 725 [2018-12-03 04:43:45,665 INFO L226 Difference]: Without dead ends: 484 [2018-12-03 04:43:45,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 336 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-12-03 04:43:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-12-03 04:43:45,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 280. [2018-12-03 04:43:45,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 04:43:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 337 transitions. [2018-12-03 04:43:45,675 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 337 transitions. Word has length 117 [2018-12-03 04:43:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:45,675 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 337 transitions. [2018-12-03 04:43:45,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 04:43:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 337 transitions. [2018-12-03 04:43:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 04:43:45,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:45,676 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:45,676 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:45,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:45,676 INFO L82 PathProgramCache]: Analyzing trace with hash 255289994, now seen corresponding path program 1 times [2018-12-03 04:43:45,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:45,677 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:45,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:45,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 04:43:45,801 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:45,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:45,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 04:43:45,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 04:43:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 04:43:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 04:43:45,804 INFO L87 Difference]: Start difference. First operand 280 states and 337 transitions. Second operand 3 states. [2018-12-03 04:43:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:45,818 INFO L93 Difference]: Finished difference Result 416 states and 503 transitions. [2018-12-03 04:43:45,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 04:43:45,819 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2018-12-03 04:43:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:45,820 INFO L225 Difference]: With dead ends: 416 [2018-12-03 04:43:45,821 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 04:43:45,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 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-12-03 04:43:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 04:43:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 280. [2018-12-03 04:43:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-03 04:43:45,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 335 transitions. [2018-12-03 04:43:45,833 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 335 transitions. Word has length 128 [2018-12-03 04:43:45,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:45,834 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 335 transitions. [2018-12-03 04:43:45,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 04:43:45,834 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 335 transitions. [2018-12-03 04:43:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 04:43:45,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:45,836 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:45,836 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:45,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:45,836 INFO L82 PathProgramCache]: Analyzing trace with hash 121276488, now seen corresponding path program 1 times [2018-12-03 04:43:45,837 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:45,837 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:45,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:46,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-03 04:43:46,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:43:46,569 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 04:43:46,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 04:43:46,573 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 04:43:46,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:46,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:46,804 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-03 04:43:46,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 04:43:47,027 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-12-03 04:43:47,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2018-12-03 04:43:47,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 9, 8] total 26 [2018-12-03 04:43:47,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 04:43:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 04:43:47,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2018-12-03 04:43:47,047 INFO L87 Difference]: Start difference. First operand 280 states and 335 transitions. Second operand 26 states. [2018-12-03 04:43:47,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:47,796 INFO L93 Difference]: Finished difference Result 740 states and 901 transitions. [2018-12-03 04:43:47,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 04:43:47,796 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 128 [2018-12-03 04:43:47,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:47,797 INFO L225 Difference]: With dead ends: 740 [2018-12-03 04:43:47,797 INFO L226 Difference]: Without dead ends: 477 [2018-12-03 04:43:47,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 518 GetRequests, 486 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-12-03 04:43:47,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-12-03 04:43:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 462. [2018-12-03 04:43:47,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2018-12-03 04:43:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 551 transitions. [2018-12-03 04:43:47,809 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 551 transitions. Word has length 128 [2018-12-03 04:43:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:47,809 INFO L480 AbstractCegarLoop]: Abstraction has 462 states and 551 transitions. [2018-12-03 04:43:47,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 04:43:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 551 transitions. [2018-12-03 04:43:47,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 04:43:47,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 04:43:47,810 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 04:43:47,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 04:43:47,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 04:43:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash 810441938, now seen corresponding path program 1 times [2018-12-03 04:43:47,811 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-03 04:43:47,811 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-03 04:43:47,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 04:43:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 04:43:48,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 04:43:49,564 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-12-03 04:43:49,564 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-03 04:43:49,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 04:43:49,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-03 04:43:49,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 04:43:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 04:43:49,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2018-12-03 04:43:49,570 INFO L87 Difference]: Start difference. First operand 462 states and 551 transitions. Second operand 14 states. [2018-12-03 04:43:56,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 04:43:56,684 INFO L93 Difference]: Finished difference Result 651 states and 782 transitions. [2018-12-03 04:43:56,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 04:43:56,686 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2018-12-03 04:43:56,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 04:43:56,687 INFO L225 Difference]: With dead ends: 651 [2018-12-03 04:43:56,687 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 04:43:56,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-12-03 04:43:56,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 04:43:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 04:43:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 04:43:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 04:43:56,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 145 [2018-12-03 04:43:56,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 04:43:56,688 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 04:43:56,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 04:43:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 04:43:56,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 04:43:56,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 04:43:56,998 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-03 04:43:57,645 WARN L180 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 44 [2018-12-03 04:43:57,806 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 31 [2018-12-03 04:43:57,938 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 38 [2018-12-03 04:43:58,112 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 30 [2018-12-03 04:43:58,378 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 7 [2018-12-03 04:43:58,661 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2018-12-03 04:43:58,828 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 20 [2018-12-03 04:43:59,002 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 14 [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetEXIT(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L451 ceAbstractionStarter]: At program point L-1-1(line -1) the Hoare annotation is: true [2018-12-03 04:43:59,005 INFO L451 ceAbstractionStarter]: At program point #Ultimate.C_memsetENTRY(line -1) the Hoare annotation is: true [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point #Ultimate.C_memsetFINAL(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L451 ceAbstractionStarter]: At program point ldv_undef_intENTRY(lines 5900 5907) the Hoare annotation is: true [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intFINAL(lines 5900 5907) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point ldv_undef_intEXIT(lines 5900 5907) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 6151 6238) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L444 ceAbstractionStarter]: At program point L6163(line 6163) 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-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6163-1(line 6163) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6229(line 6229) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L451 ceAbstractionStarter]: At program point L6188(line 6188) the Hoare annotation is: true [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6180(line 6180) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L451 ceAbstractionStarter]: At program point L6230(line 6230) the Hoare annotation is: true [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6197(lines 6197 6224) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6222(line 6222) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6181(lines 6181 6185) no Hoare annotation was computed. [2018-12-03 04:43:59,005 INFO L448 ceAbstractionStarter]: For program point L6206(line 6206) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6198(line 6198) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6165(line 6165) 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-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6165-1(line 6165) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L451 ceAbstractionStarter]: At program point L6223(line 6223) the Hoare annotation is: true [2018-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 6151 6238) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6182(line 6182) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6182-1(line 6182) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6207(lines 6207 6220) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 6151 6238) 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-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6199(lines 6199 6204) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6232(lines 6162 6237) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6216(lines 6162 6237) 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-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6208-1(line 6208) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6175(lines 6175 6231) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6208(line 6208) the Hoare annotation is: (or (not (= (_ bv0 32) |old(~ldv_state_variable_1~0)|)) (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (and (= (_ bv1 32) ~ldv_module_refcounter~0) (= (bvadd ~ldv_state_variable_0~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6167(line 6167) 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-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6200-1(line 6200) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6167-1(line 6167) 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-12-03 04:43:59,006 INFO L444 ceAbstractionStarter]: At program point L6200(line 6200) 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-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6209-2(lines 6207 6219) no Hoare annotation was computed. [2018-12-03 04:43:59,006 INFO L448 ceAbstractionStarter]: For program point L6209(lines 6209 6213) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6176(line 6176) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6168(line 6168) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6177(lines 6177 6192) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6235(line 6235) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L444 ceAbstractionStarter]: At program point L6169(line 6169) 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-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6169-1(line 6169) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6194(line 6194) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6195(lines 6195 6227) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6187(line 6187) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6179(lines 6179 6189) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L451 ceAbstractionStarter]: At program point L5886(line 5886) the Hoare annotation is: true [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocFINAL(lines 5881 5891) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L5886-1(line 5886) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point ldv_init_zallocEXIT(lines 5881 5891) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L451 ceAbstractionStarter]: At program point ldv_init_zallocENTRY(lines 5881 5891) the Hoare annotation is: true [2018-12-03 04:43:59,007 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_getENTRY(lines 6309 6325) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,007 INFO L444 ceAbstractionStarter]: At program point L6314(line 6314) 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-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6315(lines 6315 6320) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6313(lines 6313 6322) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point L6314-1(line 6314) no Hoare annotation was computed. [2018-12-03 04:43:59,007 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getFINAL(lines 6309 6325) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_getEXIT(lines 6309 6325) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point pppox_initFINAL(lines 6133 6140) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L451 ceAbstractionStarter]: At program point pppox_initENTRY(lines 6133 6140) the Hoare annotation is: true [2018-12-03 04:43:59,008 INFO L451 ceAbstractionStarter]: At program point L6137(line 6137) the Hoare annotation is: true [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point L6137-1(line 6137) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point pppox_initEXIT(lines 6133 6140) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L451 ceAbstractionStarter]: At program point sock_unregisterENTRY(lines 6391 6393) the Hoare annotation is: true [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point sock_unregisterEXIT(lines 6391 6393) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point sock_unregisterFINAL(lines 6391 6393) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTFINAL(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L451 ceAbstractionStarter]: At program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTENTRY(line -1) the Hoare annotation is: true [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INTEXIT(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~ldv_module_refcounter~0)| ~ldv_module_refcounter~0) [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6259) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ldv_errorFINAL(lines 6255 6261) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L451 ceAbstractionStarter]: At program point ldv_errorENTRY(lines 6255 6261) the Hoare annotation is: true [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ldv_errorEXIT(lines 6255 6261) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5EXIT(lines 6239 6246) no Hoare annotation was computed. [2018-12-03 04:43:59,008 INFO L444 ceAbstractionStarter]: At program point ldv_try_module_get_5ENTRY(lines 6239 6246) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,008 INFO L448 ceAbstractionStarter]: For program point ldv_try_module_get_5FINAL(lines 6239 6246) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L444 ceAbstractionStarter]: At program point L6243(line 6243) 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-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6243-1(line 6243) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6103(lines 6103 6106) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L444 ceAbstractionStarter]: At program point L6126(line 6126) 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-12-03 04:43:59,009 INFO L444 ceAbstractionStarter]: At program point L6128(lines 6101 6130) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point pppox_createFINAL(lines 6096 6131) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6126-1(line 6126) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6116-2(lines 6114 6125) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6116(lines 6116 6120) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6112(lines 6112 6125) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L444 ceAbstractionStarter]: At program point pppox_createENTRY(lines 6096 6131) the Hoare annotation is: (or (not (= (_ bv1 32) |old(~ldv_module_refcounter~0)|)) (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6108-2(lines 6108 6111) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6108(lines 6108 6111) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L444 ceAbstractionStarter]: At program point L6127(line 6127) 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-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6127-1(line 6127) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point pppox_createEXIT(lines 6096 6131) no Hoare annotation was computed. [2018-12-03 04:43:59,009 INFO L444 ceAbstractionStarter]: At program point L6115(line 6115) 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-12-03 04:43:59,009 INFO L448 ceAbstractionStarter]: For program point L6115-1(line 6115) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L451 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 6354 6363) the Hoare annotation is: true [2018-12-03 04:43:59,010 INFO L444 ceAbstractionStarter]: At program point L6358(line 6358) the Hoare annotation is: (not (= (_ bv1 32) ~ldv_module_refcounter~0)) [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 6354 6363) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point L6357(lines 6354 6363) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point ldv_stopFINAL(lines 5924 5930) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point ldv_stopEXIT(lines 5924 5930) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L451 ceAbstractionStarter]: At program point ldv_stopENTRY(lines 5924 5930) the Hoare annotation is: true [2018-12-03 04:43:59,010 INFO L451 ceAbstractionStarter]: At program point sock_registerENTRY(lines 6388 6390) the Hoare annotation is: true [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point sock_registerEXIT(lines 6388 6390) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point sock_registerFINAL(lines 6388 6390) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L444 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-12-03 04:43:59,010 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L451 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 6371 6373) the Hoare annotation is: true [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 6371 6373) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point L6330(lines 6330 6333) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L444 ceAbstractionStarter]: At program point L6331(line 6331) 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-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point L6329-2(lines 6326 6339) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L444 ceAbstractionStarter]: At program point ldv_module_putENTRY(lines 6326 6339) 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-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point L6329(lines 6329 6336) no Hoare annotation was computed. [2018-12-03 04:43:59,010 INFO L448 ceAbstractionStarter]: For program point L6330-1(lines 6330 6333) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point ldv_module_putEXIT(lines 6326 6339) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point ldv_memsetFINAL(lines 5892 5899) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point L5896-1(line 5896) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L451 ceAbstractionStarter]: At program point ldv_memsetENTRY(lines 5892 5899) the Hoare annotation is: true [2018-12-03 04:43:59,011 INFO L444 ceAbstractionStarter]: At program point L5896(line 5896) the Hoare annotation is: (or (= |ldv_memset_#in~n| ldv_memset_~n) (not (= (_ bv0 32) ~ldv_state_variable_1~0)) (not (= (_ bv1 32) ~ldv_module_refcounter~0))) [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point ldv_memsetEXIT(lines 5892 5899) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L451 ceAbstractionStarter]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: true [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6EXIT(lines 6247 6253) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L444 ceAbstractionStarter]: At program point L6250(line 6250) 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-12-03 04:43:59,011 INFO L444 ceAbstractionStarter]: At program point ldv_module_put_6ENTRY(lines 6247 6253) 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-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point ldv_module_put_6FINAL(lines 6247 6253) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point pppox_exitEXIT(lines 6141 6147) no Hoare annotation was computed. [2018-12-03 04:43:59,011 INFO L451 ceAbstractionStarter]: At program point pppox_exitENTRY(lines 6141 6147) the Hoare annotation is: true [2018-12-03 04:43:59,011 INFO L448 ceAbstractionStarter]: For program point pppox_exitFINAL(lines 6141 6147) no Hoare annotation was computed. [2018-12-03 04:43:59,018 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:43:59 BoogieIcfgContainer [2018-12-03 04:43:59,018 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 04:43:59,018 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 04:43:59,018 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 04:43:59,018 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 04:43:59,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:43:40" (3/4) ... [2018-12-03 04:43:59,020 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undef_int [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_init_zalloc [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_init [2018-12-03 04:43:59,024 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_unregister [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~X~$Pointer$~X~C_INT~TO~C_INT [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_try_module_get_5 [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_create [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_check_final_state [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure sock_register [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_initialize [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_memset [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_module_put_6 [2018-12-03 04:43:59,025 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure pppox_exit [2018-12-03 04:43:59,029 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2018-12-03 04:43:59,029 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2018-12-03 04:43:59,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2018-12-03 04:43:59,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-03 04:43:59,030 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-03 04:43:59,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || 1bv32 == ldv_module_refcounter [2018-12-03 04:43:59,046 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!(0bv32 == \old(ldv_state_variable_1)) || 1bv32 == ldv_module_refcounter) || !(1bv32 == \old(ldv_module_refcounter)) [2018-12-03 04:43:59,047 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter [2018-12-03 04:43:59,066 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_97e14e10-3be1-4192-ae0b-ee902695b087/bin-2019/utaipan/witness.graphml [2018-12-03 04:43:59,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 04:43:59,067 INFO L168 Benchmark]: Toolchain (without parser) took 19965.14 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 931.2 MB in the beginning and 841.3 MB in the end (delta: 89.9 MB). Peak memory consumption was 432.8 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:59,067 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:43:59,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:59,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 04:43:59,068 INFO L168 Benchmark]: Boogie Preprocessor took 44.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:59,068 INFO L168 Benchmark]: RCFGBuilder took 480.65 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:59,068 INFO L168 Benchmark]: TraceAbstraction took 18505.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 1.0 GB in the beginning and 850.3 MB in the end (delta: 191.3 MB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:59,068 INFO L168 Benchmark]: Witness Printer took 48.52 ms. Allocated memory is still 1.4 GB. Free memory was 850.3 MB in the beginning and 841.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. [2018-12-03 04:43:59,069 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 853.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 169.3 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 108.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 480.65 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: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18505.14 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 173.5 MB). Free memory was 1.0 GB in the beginning and 850.3 MB in the end (delta: 191.3 MB). Peak memory consumption was 364.8 MB. Max. memory is 11.5 GB. * Witness Printer took 48.52 ms. Allocated memory is still 1.4 GB. Free memory was 850.3 MB in the beginning and 841.3 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6259]: 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: 5924]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6101]: Loop Invariant Derived loop invariant: !(1bv32 == \old(ldv_module_refcounter)) || 1bv32 == ldv_module_refcounter - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6162]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_state_variable_1)) || !(1bv32 == \old(ldv_module_refcounter))) || 1bv32 == ldv_module_refcounter - InvariantResult [Line: 6162]: Loop Invariant Derived loop invariant: (!(0bv32 == \old(ldv_state_variable_1)) || 1bv32 == ldv_module_refcounter) || !(1bv32 == \old(ldv_module_refcounter)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 22 procedures, 138 locations, 1 error locations. SAFE Result, 18.4s OverallTime, 10 OverallIterations, 8 TraceHistogramMax, 9.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1675 SDtfs, 777 SDslu, 9938 SDs, 0 SdLazy, 1834 SolverSat, 165 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1968 GetRequests, 1855 SyntacticMatches, 5 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=462occurred 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, 264 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 49 LocationsWithAnnotation, 542 PreInvPairs, 593 NumberOfFragments, 824 HoareAnnotationTreeSize, 542 FomulaSimplifications, 6498 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 49 FomulaSimplificationsInter, 5707 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1463 NumberOfCodeBlocks, 1463 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1928 ConstructedInterpolants, 12 QuantifiedInterpolants, 458402 SizeOfPredicates, 43 NumberOfNonLiveVariables, 7146 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 17 InterpolantComputations, 10 PerfectInterpolantSequences, 542/611 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...