./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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 32bit --witnessprinter.graph.data.programhash ef034042979fe1e524a3655a8992190a25335ff0 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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 32bit --witnessprinter.graph.data.programhash ef034042979fe1e524a3655a8992190a25335ff0 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:04:58,741 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:04:58,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:04:58,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:04:58,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:04:58,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:04:58,749 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:04:58,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:04:58,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:04:58,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:04:58,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:04:58,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:04:58,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:04:58,753 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:04:58,754 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:04:58,754 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:04:58,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:04:58,756 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:04:58,757 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:04:58,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:04:58,758 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:04:58,759 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:04:58,760 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:04:58,760 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:04:58,760 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:04:58,761 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:04:58,762 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:04:58,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:04:58,762 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:04:58,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:04:58,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:04:58,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:04:58,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:04:58,764 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:04:58,764 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:04:58,765 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:04:58,765 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:04:58,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:04:58,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:04:58,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:04:58,773 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:04:58,773 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:04:58,774 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:04:58,774 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:04:58,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:04:58,775 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:04:58,775 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:04:58,775 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:04:58,775 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:04:58,775 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:04:58,776 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:04:58,776 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:04:58,777 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:04:58,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:04:58,778 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:04:58,778 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_614cbae8-c947-46df-a9cf-7a005fb61700/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-12-09 00:04:58,796 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:04:58,802 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:04:58,804 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:04:58,805 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:04:58,806 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:04:58,806 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 00:04:58,840 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/18856e5d9/0fd61ef0dd9d477399fc6b8c921332ee/FLAGe930f880c [2018-12-09 00:04:59,219 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:04:59,219 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 00:04:59,226 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/18856e5d9/0fd61ef0dd9d477399fc6b8c921332ee/FLAGe930f880c [2018-12-09 00:04:59,587 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/18856e5d9/0fd61ef0dd9d477399fc6b8c921332ee [2018-12-09 00:04:59,593 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:04:59,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:04:59,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:04:59,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:04:59,600 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:04:59,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44bd7056 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59, skipping insertion in model container [2018-12-09 00:04:59,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:04:59,630 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:04:59,779 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:04:59,785 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:04:59,849 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:04:59,877 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:04:59,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59 WrapperNode [2018-12-09 00:04:59,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:04:59,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:04:59,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:04:59,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:04:59,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,891 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:04:59,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:04:59,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:04:59,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:04:59,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... [2018-12-09 00:04:59,914 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:04:59,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:04:59,915 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:04:59,915 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:04:59,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:04:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-09 00:04:59,945 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-09 00:04:59,945 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 00:04:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-09 00:04:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-09 00:04:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-09 00:04:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:04:59,946 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 00:04:59,946 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 00:04:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:04:59,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:04:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:04:59,947 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:04:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 00:04:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 00:04:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:04:59,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:04:59,947 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:05:00,123 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:05:00,123 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 00:05:00,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:00 BoogieIcfgContainer [2018-12-09 00:05:00,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:05:00,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:05:00,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:05:00,126 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:05:00,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:04:59" (1/3) ... [2018-12-09 00:05:00,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5824e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:05:00, skipping insertion in model container [2018-12-09 00:05:00,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:04:59" (2/3) ... [2018-12-09 00:05:00,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b5824e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:05:00, skipping insertion in model container [2018-12-09 00:05:00,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:00" (3/3) ... [2018-12-09 00:05:00,127 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 00:05:00,133 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:05:00,137 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:05:00,145 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:05:00,162 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:05:00,163 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:05:00,163 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:05:00,163 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:05:00,163 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:05:00,163 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:05:00,163 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:05:00,163 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:05:00,173 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-12-09 00:05:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:05:00,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:00,177 INFO L402 BasicCegarLoop]: trace histogram [1, 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-09 00:05:00,178 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:00,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:00,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1637370932, now seen corresponding path program 1 times [2018-12-09 00:05:00,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:00,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:00,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:00,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:00,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:00,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:00,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:05:00,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:05:00,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:00,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:05:00,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:05:00,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:05:00,336 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 5 states. [2018-12-09 00:05:00,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:00,386 INFO L93 Difference]: Finished difference Result 97 states and 126 transitions. [2018-12-09 00:05:00,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:05:00,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-09 00:05:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:00,395 INFO L225 Difference]: With dead ends: 97 [2018-12-09 00:05:00,395 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 00:05:00,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09 00:05:00,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 00:05:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-09 00:05:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 00:05:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-12-09 00:05:00,425 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-12-09 00:05:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:00,426 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-12-09 00:05:00,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:05:00,426 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-12-09 00:05:00,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:05:00,427 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:00,427 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:05:00,427 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:00,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:00,428 INFO L82 PathProgramCache]: Analyzing trace with hash 2053071435, now seen corresponding path program 1 times [2018-12-09 00:05:00,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:00,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:00,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:00,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:00,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:00,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:00,506 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-12-09 00:05:00,507 INFO L205 CegarAbsIntRunner]: [15], [17], [23], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [129], [130], [133], [134], [135], [136], [137] [2018-12-09 00:05:00,526 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:05:00,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:05:00,670 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:05:00,671 INFO L272 AbstractInterpreter]: Visited 23 different actions 46 times. Merged at 7 different actions 11 times. Never widened. Performed 411 root evaluator evaluations with a maximum evaluation depth of 3. Performed 411 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 27 variables. [2018-12-09 00:05:00,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:00,677 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:05:00,735 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 88.11% of their original sizes. [2018-12-09 00:05:00,735 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:05:00,821 INFO L418 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-12-09 00:05:00,821 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:05:00,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:05:00,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [6] total 18 [2018-12-09 00:05:00,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:00,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 00:05:00,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 00:05:00,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2018-12-09 00:05:00,823 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 14 states. [2018-12-09 00:05:01,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:01,421 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-12-09 00:05:01,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:05:01,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-12-09 00:05:01,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:01,422 INFO L225 Difference]: With dead ends: 66 [2018-12-09 00:05:01,422 INFO L226 Difference]: Without dead ends: 53 [2018-12-09 00:05:01,423 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:05:01,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-09 00:05:01,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 44. [2018-12-09 00:05:01,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-09 00:05:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-12-09 00:05:01,428 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 34 [2018-12-09 00:05:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:01,428 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-12-09 00:05:01,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 00:05:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-12-09 00:05:01,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:05:01,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:01,429 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:05:01,430 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:01,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:01,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1676985131, now seen corresponding path program 1 times [2018-12-09 00:05:01,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:01,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:01,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:01,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:01,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:05:01,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:01,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:01,475 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-12-09 00:05:01,475 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-09 00:05:01,476 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:05:01,476 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:05:01,508 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-09 00:05:01,509 INFO L272 AbstractInterpreter]: Visited 31 different actions 62 times. Merged at 9 different actions 13 times. Never widened. Performed 539 root evaluator evaluations with a maximum evaluation depth of 4. Performed 539 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-09 00:05:01,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:01,510 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-09 00:05:01,539 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-12-09 00:05:01,540 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-09 00:05:01,710 INFO L418 sIntCurrentIteration]: We unified 41 AI predicates to 41 [2018-12-09 00:05:01,710 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-09 00:05:01,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:05:01,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-12-09 00:05:01,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:01,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-09 00:05:01,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-09 00:05:01,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2018-12-09 00:05:01,711 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 20 states. [2018-12-09 00:05:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:02,505 INFO L93 Difference]: Finished difference Result 87 states and 100 transitions. [2018-12-09 00:05:02,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 00:05:02,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2018-12-09 00:05:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:02,507 INFO L225 Difference]: With dead ends: 87 [2018-12-09 00:05:02,507 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 00:05:02,508 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:05:02,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 00:05:02,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-12-09 00:05:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-09 00:05:02,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2018-12-09 00:05:02,518 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 42 [2018-12-09 00:05:02,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:02,518 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2018-12-09 00:05:02,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-09 00:05:02,518 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2018-12-09 00:05:02,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 00:05:02,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:02,520 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:05:02,520 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:02,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:02,521 INFO L82 PathProgramCache]: Analyzing trace with hash 736616856, now seen corresponding path program 1 times [2018-12-09 00:05:02,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:02,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:02,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:02,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:02,587 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:02,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:02,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:02,588 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-12-09 00:05:02,588 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-09 00:05:02,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:05:02,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:05:02,635 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:05:02,635 INFO L272 AbstractInterpreter]: Visited 43 different actions 88 times. Merged at 11 different actions 18 times. Never widened. Performed 693 root evaluator evaluations with a maximum evaluation depth of 4. Performed 693 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 4 different actions. Largest state had 27 variables. [2018-12-09 00:05:02,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:02,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:05:02,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:02,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:02,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:02,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:05:02,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:02,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:02,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:02,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:02,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:05:02,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2018-12-09 00:05:02,793 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:05:02,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:05:02,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:05:02,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:05:02,794 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand 6 states. [2018-12-09 00:05:02,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:02,832 INFO L93 Difference]: Finished difference Result 103 states and 121 transitions. [2018-12-09 00:05:02,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:05:02,833 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2018-12-09 00:05:02,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:02,833 INFO L225 Difference]: With dead ends: 103 [2018-12-09 00:05:02,833 INFO L226 Difference]: Without dead ends: 64 [2018-12-09 00:05:02,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 98 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:05:02,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-09 00:05:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-12-09 00:05:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-09 00:05:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-12-09 00:05:02,843 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 51 [2018-12-09 00:05:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:02,843 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-12-09 00:05:02,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:05:02,843 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-12-09 00:05:02,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:05:02,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:02,844 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] [2018-12-09 00:05:02,845 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:02,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:02,845 INFO L82 PathProgramCache]: Analyzing trace with hash -105291945, now seen corresponding path program 2 times [2018-12-09 00:05:02,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:02,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:02,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:02,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:02,846 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:03,578 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:03,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:03,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:03,578 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:05:03,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:05:03,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:03,578 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:03,588 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:05:03,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:05:03,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-09 00:05:03,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:03,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:03,636 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:05:03,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,639 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 00:05:03,700 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:03,701 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:03,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 00:05:03,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,705 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 00:05:03,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:03,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:03,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,718 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 00:05:03,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:03,850 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:03,850 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,851 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:30 [2018-12-09 00:05:03,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-09 00:05:03,896 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:03,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-12-09 00:05:03,897 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,899 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:03,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:28 [2018-12-09 00:05:04,397 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int) (sll_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (+ |c_sll_update_at_#in~head.offset| 4)))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-09 00:05:04,402 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 34 treesize of output 28 [2018-12-09 00:05:04,404 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:05:04,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-12-09 00:05:04,405 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:04,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:04,417 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-09 00:05:04,418 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:04,418 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:04,422 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:04,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:04,427 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:51, output treesize:18 [2018-12-09 00:05:04,555 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 22 treesize of output 16 [2018-12-09 00:05:04,556 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 16 treesize of output 7 [2018-12-09 00:05:04,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:04,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:04,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:04,560 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:7 [2018-12-09 00:05:04,566 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 00:05:04,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:04,966 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-12-09 00:05:04,970 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:05,117 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:05,122 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:05,480 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:05,486 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:05,892 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:06,399 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-12-09 00:05:06,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-12-09 00:05:06,455 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-09 00:05:06,455 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,469 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 23 treesize of output 21 [2018-12-09 00:05:06,470 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 6 treesize of output 1 [2018-12-09 00:05:06,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,473 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,475 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 16 treesize of output 12 [2018-12-09 00:05:06,476 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 12 treesize of output 3 [2018-12-09 00:05:06,476 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,478 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 00:05:06,519 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,521 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,522 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,525 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,526 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,529 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2018-12-09 00:05:06,568 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-09 00:05:06,568 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,584 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 23 treesize of output 21 [2018-12-09 00:05:06,587 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 6 treesize of output 1 [2018-12-09 00:05:06,587 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,591 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,593 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 16 treesize of output 12 [2018-12-09 00:05:06,595 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 12 treesize of output 3 [2018-12-09 00:05:06,595 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,597 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,609 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-09 00:05:06,641 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,644 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,645 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,647 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:06,648 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,652 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:06,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-09 00:05:06,676 INFO L202 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:121, output treesize:65 [2018-12-09 00:05:07,983 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification that was a NOOP. DAG size: 38 [2018-12-09 00:05:07,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-12-09 00:05:08,008 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-09 00:05:08,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,029 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2018-12-09 00:05:08,035 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-12-09 00:05:08,036 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-09 00:05:08,044 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-09 00:05:08,044 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,058 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 10 treesize of output 3 [2018-12-09 00:05:08,059 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,064 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 00:05:08,065 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 23 treesize of output 21 [2018-12-09 00:05:08,067 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 6 treesize of output 1 [2018-12-09 00:05:08,067 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,070 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,084 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-09 00:05:08,163 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,168 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,168 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,171 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,172 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,176 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,177 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,180 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,180 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,184 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,185 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,190 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,191 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,195 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,256 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,261 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:08,312 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 67 [2018-12-09 00:05:08,327 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 8 [2018-12-09 00:05:08,327 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2018-12-09 00:05:08,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2018-12-09 00:05:08,350 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-12-09 00:05:08,357 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 17 treesize of output 11 [2018-12-09 00:05:08,358 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-09 00:05:08,364 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,368 INFO L267 ElimStorePlain]: Start of recursive call 28: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-09 00:05:08,369 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 31 treesize of output 29 [2018-12-09 00:05:08,371 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 6 treesize of output 1 [2018-12-09 00:05:08,371 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,374 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,389 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-09 00:05:08,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 7 dim-0 vars, and 11 xjuncts. [2018-12-09 00:05:08,466 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 8 variables, input treesize:149, output treesize:300 [2018-12-09 00:05:08,466 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 11 [2018-12-09 00:05:08,887 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 18 treesize of output 16 [2018-12-09 00:05:08,888 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 16 treesize of output 20 [2018-12-09 00:05:08,894 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 17 treesize of output 4 [2018-12-09 00:05:08,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,895 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:08,896 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:18, output treesize:4 [2018-12-09 00:05:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:09,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:05:09,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29, 29] total 70 [2018-12-09 00:05:09,225 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:05:09,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-09 00:05:09,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-09 00:05:09,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4483, Unknown=7, NotChecked=134, Total=4830 [2018-12-09 00:05:09,227 INFO L87 Difference]: Start difference. First operand 61 states and 70 transitions. Second operand 46 states. [2018-12-09 00:05:12,656 WARN L180 SmtUtils]: Spent 860.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2018-12-09 00:05:14,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:14,909 INFO L93 Difference]: Finished difference Result 128 states and 166 transitions. [2018-12-09 00:05:14,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-09 00:05:14,909 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 60 [2018-12-09 00:05:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:14,911 INFO L225 Difference]: With dead ends: 128 [2018-12-09 00:05:14,911 INFO L226 Difference]: Without dead ends: 126 [2018-12-09 00:05:14,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 12 SemanticMatches, 102 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1973 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=628, Invalid=9869, Unknown=13, NotChecked=202, Total=10712 [2018-12-09 00:05:14,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-09 00:05:14,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 79. [2018-12-09 00:05:14,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-09 00:05:14,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2018-12-09 00:05:14,931 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 60 [2018-12-09 00:05:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:14,931 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2018-12-09 00:05:14,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-09 00:05:14,932 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-12-09 00:05:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 00:05:14,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:14,933 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] [2018-12-09 00:05:14,933 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:14,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:14,933 INFO L82 PathProgramCache]: Analyzing trace with hash -849271432, now seen corresponding path program 1 times [2018-12-09 00:05:14,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:14,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:14,935 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:05:14,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:14,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:05:14,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:14,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:14,984 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2018-12-09 00:05:14,984 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-09 00:05:14,985 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:05:14,985 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:05:15,038 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:05:15,038 INFO L272 AbstractInterpreter]: Visited 44 different actions 124 times. Merged at 15 different actions 37 times. Widened at 1 different actions 1 times. Performed 1008 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1008 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 12 fixpoints after 6 different actions. Largest state had 27 variables. [2018-12-09 00:05:15,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:15,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:05:15,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,039 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:15,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:15,046 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:05:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:15,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:15,097 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:05:15,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:15,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:05:15,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:05:15,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-09 00:05:15,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:15,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:05:15,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:05:15,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:05:15,173 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand 5 states. [2018-12-09 00:05:15,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:15,208 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2018-12-09 00:05:15,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:05:15,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-09 00:05:15,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:15,210 INFO L225 Difference]: With dead ends: 104 [2018-12-09 00:05:15,210 INFO L226 Difference]: Without dead ends: 88 [2018-12-09 00:05:15,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:05:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-09 00:05:15,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 81. [2018-12-09 00:05:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-09 00:05:15,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2018-12-09 00:05:15,221 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 61 [2018-12-09 00:05:15,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:15,222 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2018-12-09 00:05:15,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:05:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2018-12-09 00:05:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 00:05:15,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:15,223 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:05:15,223 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:15,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:15,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1151488352, now seen corresponding path program 3 times [2018-12-09 00:05:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:15,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:15,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:05:15,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,267 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:15,267 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:05:15,267 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:05:15,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:15,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:05:15,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 00:05:15,307 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:05:15,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:15,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:15,339 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:15,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:15,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:05:15,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-09 00:05:15,430 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:05:15,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:05:15,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:05:15,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:05:15,431 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand 8 states. [2018-12-09 00:05:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:15,486 INFO L93 Difference]: Finished difference Result 142 states and 170 transitions. [2018-12-09 00:05:15,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:05:15,487 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-12-09 00:05:15,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:15,488 INFO L225 Difference]: With dead ends: 142 [2018-12-09 00:05:15,488 INFO L226 Difference]: Without dead ends: 91 [2018-12-09 00:05:15,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:05:15,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-09 00:05:15,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-12-09 00:05:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-09 00:05:15,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 92 transitions. [2018-12-09 00:05:15,501 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 92 transitions. Word has length 61 [2018-12-09 00:05:15,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:15,501 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 92 transitions. [2018-12-09 00:05:15,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:05:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 92 transitions. [2018-12-09 00:05:15,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 00:05:15,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:15,502 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:05:15,503 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:15,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:15,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1638853044, now seen corresponding path program 4 times [2018-12-09 00:05:15,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,504 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:05:15,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:05:15,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:15,540 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:05:15,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:05:15,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,540 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:15,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:15,549 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:05:15,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:15,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 00:05:15,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:15,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-12-09 00:05:15,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:05:15,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-09 00:05:15,686 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:05:15,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:05:15,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:05:15,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:05:15,687 INFO L87 Difference]: Start difference. First operand 78 states and 92 transitions. Second operand 8 states. [2018-12-09 00:05:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:15,730 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2018-12-09 00:05:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:05:15,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-12-09 00:05:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:15,731 INFO L225 Difference]: With dead ends: 124 [2018-12-09 00:05:15,731 INFO L226 Difference]: Without dead ends: 84 [2018-12-09 00:05:15,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:05:15,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-09 00:05:15,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 75. [2018-12-09 00:05:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 00:05:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 86 transitions. [2018-12-09 00:05:15,739 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 86 transitions. Word has length 61 [2018-12-09 00:05:15,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:15,739 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 86 transitions. [2018-12-09 00:05:15,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:05:15,739 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 86 transitions. [2018-12-09 00:05:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 00:05:15,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:15,740 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-09 00:05:15,740 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:15,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:15,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1196256737, now seen corresponding path program 5 times [2018-12-09 00:05:15,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:15,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,741 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:15,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 00:05:15,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:15,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:05:15,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:05:15,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:15,777 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:05:15,777 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 00:05:15,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-09 00:05:15,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:15,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:15,817 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 00:05:15,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:15,852 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-09 00:05:15,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:05:15,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 7] total 10 [2018-12-09 00:05:15,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:15,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:05:15,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:05:15,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:05:15,868 INFO L87 Difference]: Start difference. First operand 75 states and 86 transitions. Second operand 7 states. [2018-12-09 00:05:15,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:15,927 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2018-12-09 00:05:15,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:05:15,927 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2018-12-09 00:05:15,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:15,928 INFO L225 Difference]: With dead ends: 119 [2018-12-09 00:05:15,928 INFO L226 Difference]: Without dead ends: 96 [2018-12-09 00:05:15,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:05:15,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-09 00:05:15,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 82. [2018-12-09 00:05:15,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-09 00:05:15,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-09 00:05:15,942 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 68 [2018-12-09 00:05:15,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:15,943 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-09 00:05:15,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:05:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-09 00:05:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 00:05:15,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:15,944 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-09 00:05:15,944 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:15,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:15,944 INFO L82 PathProgramCache]: Analyzing trace with hash 541815126, now seen corresponding path program 6 times [2018-12-09 00:05:15,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:05:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:15,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:15,993 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-09 00:05:15,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:15,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 00:05:15,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 00:05:15,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:15,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:15,999 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-09 00:05:16,000 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-09 00:05:16,023 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-09 00:05:16,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:16,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:05:16,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 00:05:16,099 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:05:16,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 11 [2018-12-09 00:05:16,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:16,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:05:16,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:05:16,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:05:16,100 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 6 states. [2018-12-09 00:05:16,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:16,124 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2018-12-09 00:05:16,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:05:16,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-09 00:05:16,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:16,125 INFO L225 Difference]: With dead ends: 121 [2018-12-09 00:05:16,125 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 00:05:16,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:05:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 00:05:16,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 00:05:16,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:05:16,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-12-09 00:05:16,131 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 69 [2018-12-09 00:05:16,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:16,131 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-12-09 00:05:16,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:05:16,132 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-12-09 00:05:16,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:05:16,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:16,132 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-12-09 00:05:16,132 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:16,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:16,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1242182050, now seen corresponding path program 1 times [2018-12-09 00:05:16,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:16,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:05:16,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:16,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:16,169 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:05:16,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:16,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:16,169 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 71 with the following transitions: [2018-12-09 00:05:16,169 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-09 00:05:16,171 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:05:16,171 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:05:16,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:05:16,229 INFO L272 AbstractInterpreter]: Visited 45 different actions 145 times. Merged at 23 different actions 44 times. Never widened. Performed 1191 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1191 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 10 fixpoints after 6 different actions. Largest state had 27 variables. [2018-12-09 00:05:16,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:16,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:05:16,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:16,231 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:16,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:16,237 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:05:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:16,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:05:16,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:05:16,324 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:05:16,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-09 00:05:16,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:05:16,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:05:16,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:05:16,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:05:16,325 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 6 states. [2018-12-09 00:05:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:16,359 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-12-09 00:05:16,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:05:16,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-09 00:05:16,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:16,359 INFO L225 Difference]: With dead ends: 69 [2018-12-09 00:05:16,359 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 00:05:16,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 135 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:05:16,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 00:05:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 00:05:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:05:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-09 00:05:16,366 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 70 [2018-12-09 00:05:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:16,366 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-09 00:05:16,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:05:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-09 00:05:16,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 00:05:16,367 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:16,367 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-12-09 00:05:16,367 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:16,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2027250547, now seen corresponding path program 1 times [2018-12-09 00:05:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:05:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:16,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:16,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:05:16,368 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:05:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:17,006 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-09 00:05:17,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:17,006 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:05:17,006 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 72 with the following transitions: [2018-12-09 00:05:17,006 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [59], [79], [85], [87], [89], [91], [95], [96], [100], [107], [109], [113], [114], [115], [121], [123], [124], [125], [126], [127], [128], [129], [130], [133], [134], [135], [136], [137] [2018-12-09 00:05:17,007 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:05:17,007 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:05:17,068 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:05:17,068 INFO L272 AbstractInterpreter]: Visited 46 different actions 190 times. Merged at 27 different actions 76 times. Widened at 2 different actions 2 times. Performed 1378 root evaluator evaluations with a maximum evaluation depth of 4. Performed 1378 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 17 fixpoints after 8 different actions. Largest state had 27 variables. [2018-12-09 00:05:17,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:17,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:05:17,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:17,072 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:17,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:17,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:05:17,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:17,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:17,130 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:05:17,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 00:05:17,209 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:17,210 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:17,211 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 00:05:17,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 00:05:17,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:17,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:17,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,242 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 00:05:17,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 00:05:17,402 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 00:05:17,402 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:17,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:17,406 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:19 [2018-12-09 00:05:19,420 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~head.offset Int)) (and (<= sll_update_at_~head.offset |c_sll_update_at_#in~head.offset|) (= (store |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset (select (select |c_#memory_$Pointer$.base| |c_sll_update_at_#in~head.base|) sll_update_at_~head.offset))) |c_#memory_$Pointer$.base|))) is different from true [2018-12-09 00:05:19,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-09 00:05:19,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:19,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 00:05:19,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,430 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,435 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,435 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:18 [2018-12-09 00:05:19,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-09 00:05:19,565 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:05:19,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-09 00:05:19,630 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:19,634 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 113 [2018-12-09 00:05:19,635 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-09 00:05:19,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,647 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:19,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 79 [2018-12-09 00:05:19,652 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-09 00:05:19,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,657 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:19,661 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:126, output treesize:36 [2018-12-09 00:05:20,116 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 60 [2018-12-09 00:05:20,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2018-12-09 00:05:20,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2018-12-09 00:05:20,151 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,168 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2018-12-09 00:05:20,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,182 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 00:05:20,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 44 [2018-12-09 00:05:20,203 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-12-09 00:05:20,204 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,216 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-12-09 00:05:20,217 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-09 00:05:20,229 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,240 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-09 00:05:20,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2018-12-09 00:05:20,243 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-12-09 00:05:20,244 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,250 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-12-09 00:05:20,251 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,260 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,281 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-12-09 00:05:20,282 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 11 treesize of output 3 [2018-12-09 00:05:20,282 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,288 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,289 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-09 00:05:20,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 3 [2018-12-09 00:05:20,291 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,300 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2018-12-09 00:05:20,308 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 32 treesize of output 27 [2018-12-09 00:05:20,308 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,326 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 27 treesize of output 20 [2018-12-09 00:05:20,327 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,344 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2018-12-09 00:05:20,345 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,352 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,363 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:20,363 INFO L202 ElimStorePlain]: Needed 20 recursive calls to eliminate 5 variables, input treesize:65, output treesize:7 [2018-12-09 00:05:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-09 00:05:20,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:20,857 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,863 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,870 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,871 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,878 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,879 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,888 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:20,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 101 [2018-12-09 00:05:21,001 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 00:05:21,001 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,005 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,007 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 99 treesize of output 65 [2018-12-09 00:05:21,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 00:05:21,008 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,012 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,013 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 109 treesize of output 75 [2018-12-09 00:05:21,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 00:05:21,015 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,019 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,085 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,092 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,093 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,100 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,101 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,108 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,162 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,167 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,167 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,173 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,174 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,178 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,221 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 115 treesize of output 81 [2018-12-09 00:05:21,223 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-09 00:05:21,223 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,225 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 81 [2018-12-09 00:05:21,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-09 00:05:21,228 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,230 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,256 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,257 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,258 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,259 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:21,260 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,261 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:21,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-12-09 00:05:21,279 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:281, output treesize:260 [2018-12-09 00:05:21,515 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-09 00:05:21,797 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:21,798 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:217) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) 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) [2018-12-09 00:05:21,805 INFO L168 Benchmark]: Toolchain (without parser) took 22210.80 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 418.4 MB). Free memory was 952.4 MB in the beginning and 1.4 GB in the end (delta: -399.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 00:05:21,806 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:05:21,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:05:21,807 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:05:21,808 INFO L168 Benchmark]: Boogie Preprocessor took 18.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:05:21,809 INFO L168 Benchmark]: RCFGBuilder took 209.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-12-09 00:05:21,809 INFO L168 Benchmark]: TraceAbstraction took 21679.27 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 307.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:05:21,814 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 281.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -140.9 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.69 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 209.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21679.27 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 307.8 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -287.7 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:344) 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-09 00:05:23,070 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:05:23,071 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:05:23,077 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:05:23,077 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:05:23,078 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:05:23,078 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:05:23,079 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:05:23,081 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:05:23,081 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:05:23,082 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:05:23,082 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:05:23,083 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:05:23,083 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:05:23,084 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:05:23,084 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:05:23,085 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:05:23,086 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:05:23,087 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:05:23,088 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:05:23,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:05:23,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:05:23,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:05:23,090 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:05:23,090 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:05:23,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:05:23,091 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:05:23,091 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:05:23,092 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:05:23,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:05:23,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:05:23,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:05:23,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:05:23,093 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:05:23,094 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:05:23,094 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:05:23,094 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-09 00:05:23,104 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:05:23,104 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:05:23,105 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:05:23,105 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:05:23,105 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:05:23,105 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:05:23,105 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:05:23,105 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:05:23,106 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:05:23,106 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:05:23,106 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:05:23,106 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-09 00:05:23,107 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-09 00:05:23,108 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:05:23,108 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:05:23,108 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 00:05:23,108 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:05:23,108 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:05:23,108 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:05:23,109 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:05:23,109 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:05:23,109 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:05:23,109 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:05:23,109 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:05:23,109 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:05:23,109 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-09 00:05:23,110 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:05:23,110 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-09 00:05:23,110 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-09 00:05:23,110 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_614cbae8-c947-46df-a9cf-7a005fb61700/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef034042979fe1e524a3655a8992190a25335ff0 [2018-12-09 00:05:23,133 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:05:23,140 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:05:23,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:05:23,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:05:23,144 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:05:23,144 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 00:05:23,178 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/244cb2cf9/53a13d2bc6f840c28852f6f50e26814a/FLAGb435eec60 [2018-12-09 00:05:23,698 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:05:23,698 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/sv-benchmarks/c/list-simple/sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 00:05:23,704 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/244cb2cf9/53a13d2bc6f840c28852f6f50e26814a/FLAGb435eec60 [2018-12-09 00:05:24,214 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/data/244cb2cf9/53a13d2bc6f840c28852f6f50e26814a [2018-12-09 00:05:24,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:05:24,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:05:24,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:05:24,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:05:24,220 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:05:24,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e87b630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24, skipping insertion in model container [2018-12-09 00:05:24,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:05:24,246 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:05:24,400 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:05:24,408 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:05:24,472 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:05:24,495 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:05:24,495 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24 WrapperNode [2018-12-09 00:05:24,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:05:24,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:05:24,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:05:24,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:05:24,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,510 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:05:24,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:05:24,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:05:24,515 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:05:24,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,522 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,529 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,534 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... [2018-12-09 00:05:24,536 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:05:24,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:05:24,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:05:24,537 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:05:24,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-12-09 00:05:24,567 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-12-09 00:05:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-09 00:05:24,567 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-09 00:05:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-12-09 00:05:24,567 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-12-09 00:05:24,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-12-09 00:05:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-09 00:05:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-09 00:05:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:05:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:05:24,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-09 00:05:24,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:05:24,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-09 00:05:24,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:05:24,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:05:24,781 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:05:24,781 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-09 00:05:24,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:24 BoogieIcfgContainer [2018-12-09 00:05:24,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:05:24,782 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:05:24,782 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:05:24,784 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:05:24,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:05:24" (1/3) ... [2018-12-09 00:05:24,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e581c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:05:24, skipping insertion in model container [2018-12-09 00:05:24,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:05:24" (2/3) ... [2018-12-09 00:05:24,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e581c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:05:24, skipping insertion in model container [2018-12-09 00:05:24,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:05:24" (3/3) ... [2018-12-09 00:05:24,786 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-09 00:05:24,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:05:24,796 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:05:24,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:05:24,821 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 00:05:24,822 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:05:24,822 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:05:24,822 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:05:24,822 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:05:24,822 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:05:24,822 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:05:24,822 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:05:24,822 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:05:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-12-09 00:05:24,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 00:05:24,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:24,835 INFO L402 BasicCegarLoop]: trace histogram [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-09 00:05:24,836 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:24,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:24,839 INFO L82 PathProgramCache]: Analyzing trace with hash -131027277, now seen corresponding path program 1 times [2018-12-09 00:05:24,842 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:05:24,843 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:24,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:24,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:24,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:24,952 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:05:24,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:05:24,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:05:24,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:05:24,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:05:24,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:05:24,965 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2018-12-09 00:05:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:25,025 INFO L93 Difference]: Finished difference Result 95 states and 124 transitions. [2018-12-09 00:05:25,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:05:25,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-12-09 00:05:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:25,032 INFO L225 Difference]: With dead ends: 95 [2018-12-09 00:05:25,032 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 00:05:25,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 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-09 00:05:25,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 00:05:25,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-12-09 00:05:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-09 00:05:25,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2018-12-09 00:05:25,062 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 24 [2018-12-09 00:05:25,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:25,062 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2018-12-09 00:05:25,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:05:25,062 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2018-12-09 00:05:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:05:25,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:25,063 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 00:05:25,063 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:25,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1869041009, now seen corresponding path program 1 times [2018-12-09 00:05:25,064 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:05:25,064 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:25,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:25,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:25,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:25,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:25,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:25,290 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:25,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:25,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:25,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:25,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:05:25,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:05:25,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7, 7] total 16 [2018-12-09 00:05:25,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 00:05:25,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 00:05:25,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2018-12-09 00:05:25,611 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand 16 states. [2018-12-09 00:05:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:25,766 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2018-12-09 00:05:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:05:25,767 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 33 [2018-12-09 00:05:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:25,769 INFO L225 Difference]: With dead ends: 73 [2018-12-09 00:05:25,769 INFO L226 Difference]: Without dead ends: 49 [2018-12-09 00:05:25,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2018-12-09 00:05:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-09 00:05:25,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-12-09 00:05:25,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-09 00:05:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-12-09 00:05:25,776 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 33 [2018-12-09 00:05:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:25,777 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-12-09 00:05:25,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 00:05:25,777 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-12-09 00:05:25,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-09 00:05:25,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:25,779 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:05:25,779 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:25,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:25,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1464099955, now seen corresponding path program 2 times [2018-12-09 00:05:25,780 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:05:25,780 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:25,793 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:05:25,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-12-09 00:05:25,830 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:25,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:25,855 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 00:05:25,855 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-09 00:05:25,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:05:25,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:05:25,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:05:25,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:05:25,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:05:25,856 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 4 states. [2018-12-09 00:05:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:25,880 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-12-09 00:05:25,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:05:25,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2018-12-09 00:05:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:25,881 INFO L225 Difference]: With dead ends: 67 [2018-12-09 00:05:25,881 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 00:05:25,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:05:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 00:05:25,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 47. [2018-12-09 00:05:25,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-09 00:05:25,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2018-12-09 00:05:25,886 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 42 [2018-12-09 00:05:25,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:25,887 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2018-12-09 00:05:25,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:05:25,887 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-12-09 00:05:25,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 00:05:25,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:25,888 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:05:25,888 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:25,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:25,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1257371639, now seen corresponding path program 1 times [2018-12-09 00:05:25,888 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:05:25,888 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:25,901 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:05:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:25,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 00:05:26,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 00:05:26,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:26,046 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:26,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:26,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:26,131 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:26,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-09 00:05:26,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-09 00:05:26,409 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 27 treesize of output 18 [2018-12-09 00:05:26,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,435 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 18 treesize of output 13 [2018-12-09 00:05:26,435 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 12 [2018-12-09 00:05:26,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,461 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,464 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:31, output treesize:7 [2018-12-09 00:05:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 00:05:26,489 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:26,848 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 7 treesize of output 5 [2018-12-09 00:05:26,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-12-09 00:05:26,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:26,861 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-09 00:05:26,862 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:10 [2018-12-09 00:05:26,904 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-09 00:05:26,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:05:26,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 14, 12] total 26 [2018-12-09 00:05:26,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-09 00:05:26,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-09 00:05:26,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=568, Unknown=0, NotChecked=0, Total=650 [2018-12-09 00:05:26,921 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand 26 states. [2018-12-09 00:05:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:34,223 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2018-12-09 00:05:34,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 00:05:34,223 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-09 00:05:34,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:34,225 INFO L225 Difference]: With dead ends: 92 [2018-12-09 00:05:34,226 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 00:05:34,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 00:05:34,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 00:05:34,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 50. [2018-12-09 00:05:34,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-09 00:05:34,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2018-12-09 00:05:34,233 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 50 [2018-12-09 00:05:34,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:34,233 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2018-12-09 00:05:34,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-09 00:05:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2018-12-09 00:05:34,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 00:05:34,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:34,235 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] [2018-12-09 00:05:34,235 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:34,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1398950497, now seen corresponding path program 2 times [2018-12-09 00:05:34,236 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:05:34,236 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:05:34,252 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:05:34,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:05:34,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:34,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:34,368 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:34,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:34,432 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:34,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:34,434 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:34,440 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:05:34,470 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:05:34,470 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:05:34,473 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:34,478 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:34,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:05:34,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:05:34,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 00:05:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:05:34,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:05:34,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:05:34,524 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand 9 states. [2018-12-09 00:05:34,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:05:34,646 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2018-12-09 00:05:34,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:05:34,647 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2018-12-09 00:05:34,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:05:34,647 INFO L225 Difference]: With dead ends: 95 [2018-12-09 00:05:34,647 INFO L226 Difference]: Without dead ends: 73 [2018-12-09 00:05:34,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:05:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-09 00:05:34,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2018-12-09 00:05:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 00:05:34,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2018-12-09 00:05:34,653 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 58 [2018-12-09 00:05:34,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:05:34,654 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2018-12-09 00:05:34,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:05:34,654 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2018-12-09 00:05:34,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 00:05:34,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:05:34,654 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] [2018-12-09 00:05:34,655 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:05:34,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:05:34,655 INFO L82 PathProgramCache]: Analyzing trace with hash 124593572, now seen corresponding path program 1 times [2018-12-09 00:05:34,655 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:05:34,655 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:05:34,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:05:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:34,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:34,838 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:05:34,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,840 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,840 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 00:05:34,913 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:34,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:34,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 00:05:34,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 00:05:34,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:34,944 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:34,944 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,946 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:34,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 00:05:35,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:35,135 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:35,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:35,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:35,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:35,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 00:05:35,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-09 00:05:35,258 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:35,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 00:05:35,262 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:35,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:35,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:35,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-09 00:05:37,173 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_update_at_~data (_ BitVec 32)) (sll_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_update_at_#in~head.base|) (bvadd |c_sll_update_at_#in~head.offset| (_ bv4 32))))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) sll_update_at_~head.offset sll_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-09 00:05:37,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:37,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 32 [2018-12-09 00:05:37,192 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 13 [2018-12-09 00:05:37,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:37,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:37,214 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 22 treesize of output 18 [2018-12-09 00:05:37,216 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:05:37,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2018-12-09 00:05:37,217 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:37,224 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:37,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:37,235 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-12-09 00:05:39,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-09 00:05:39,545 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 20 treesize of output 11 [2018-12-09 00:05:39,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:39,562 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 18 treesize of output 9 [2018-12-09 00:05:39,563 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:39,569 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:39,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:39,572 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-09 00:05:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 00:05:39,615 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:42,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:05:42,257 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:05:42,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:05:42,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:05:42,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:05:42,298 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:05:42,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 00:05:42,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:42,305 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:42,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 00:05:42,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 00:05:42,317 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:42,318 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:42,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 00:05:42,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:05:42,336 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:42,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,339 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,346 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,346 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:23 [2018-12-09 00:05:42,352 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-09 00:05:42,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:05:42,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 00:05:42,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:24 [2018-12-09 00:05:42,375 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 32 treesize of output 26 [2018-12-09 00:05:42,378 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:05:42,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-12-09 00:05:42,379 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:42,387 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:05:42,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-12-09 00:05:42,419 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:05:42,419 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:42,438 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:16 [2018-12-09 00:05:44,506 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 31 [2018-12-09 00:05:44,509 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 20 treesize of output 11 [2018-12-09 00:05:44,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:44,522 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 16 treesize of output 7 [2018-12-09 00:05:44,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:05:44,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:44,532 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:05:44,532 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2018-12-09 00:05:44,538 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-09 00:05:44,538 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:05:46,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:05:46,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-12-09 00:05:46,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-09 00:05:46,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-09 00:05:46,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-12-09 00:05:46,911 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand 31 states. [2018-12-09 00:06:14,996 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-09 00:06:28,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:28,880 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-12-09 00:06:28,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-09 00:06:28,881 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-12-09 00:06:28,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:28,881 INFO L225 Difference]: With dead ends: 98 [2018-12-09 00:06:28,882 INFO L226 Difference]: Without dead ends: 95 [2018-12-09 00:06:28,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 601 ImplicationChecksByTransitivity, 35.3s TimeCoverageRelationStatistics Valid=273, Invalid=3137, Unknown=16, NotChecked=114, Total=3540 [2018-12-09 00:06:28,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-09 00:06:28,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2018-12-09 00:06:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-09 00:06:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 100 transitions. [2018-12-09 00:06:28,897 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 100 transitions. Word has length 59 [2018-12-09 00:06:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:28,897 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 100 transitions. [2018-12-09 00:06:28,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-09 00:06:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 100 transitions. [2018-12-09 00:06:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:06:28,898 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:28,898 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] [2018-12-09 00:06:28,898 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:28,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1169347144, now seen corresponding path program 1 times [2018-12-09 00:06:28,899 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:06:28,899 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/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-09 00:06:28,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:29,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:06:29,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-12-09 00:06:29,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:06:29,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-09 00:06:29,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:06:29,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:06:29,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:06:29,056 INFO L87 Difference]: Start difference. First operand 83 states and 100 transitions. Second operand 7 states. [2018-12-09 00:06:29,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:29,118 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2018-12-09 00:06:29,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:06:29,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 60 [2018-12-09 00:06:29,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:29,119 INFO L225 Difference]: With dead ends: 118 [2018-12-09 00:06:29,119 INFO L226 Difference]: Without dead ends: 94 [2018-12-09 00:06:29,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:06:29,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-09 00:06:29,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 89. [2018-12-09 00:06:29,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-09 00:06:29,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2018-12-09 00:06:29,130 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 60 [2018-12-09 00:06:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:29,130 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2018-12-09 00:06:29,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:06:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2018-12-09 00:06:29,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 00:06:29,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:29,131 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-09 00:06:29,131 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:29,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:29,131 INFO L82 PathProgramCache]: Analyzing trace with hash 109819455, now seen corresponding path program 2 times [2018-12-09 00:06:29,131 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:06:29,131 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:06:29,151 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:06:29,241 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:06:29,241 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:29,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:29,282 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:06:29,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:06:29,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:06:29,404 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:06:29,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:06:29,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:06:29,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:29,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:29,515 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:06:29,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-09 00:06:29,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:06:29,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 00:06:29,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 00:06:29,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 00:06:29,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:06:29,879 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand 18 states. [2018-12-09 00:06:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:30,759 INFO L93 Difference]: Finished difference Result 168 states and 214 transitions. [2018-12-09 00:06:30,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 00:06:30,760 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-12-09 00:06:30,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:30,761 INFO L225 Difference]: With dead ends: 168 [2018-12-09 00:06:30,761 INFO L226 Difference]: Without dead ends: 134 [2018-12-09 00:06:30,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2018-12-09 00:06:30,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-09 00:06:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 96. [2018-12-09 00:06:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-09 00:06:30,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 118 transitions. [2018-12-09 00:06:30,774 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 118 transitions. Word has length 60 [2018-12-09 00:06:30,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:30,774 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 118 transitions. [2018-12-09 00:06:30,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 00:06:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 118 transitions. [2018-12-09 00:06:30,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 00:06:30,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:30,775 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-12-09 00:06:30,775 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:30,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:30,775 INFO L82 PathProgramCache]: Analyzing trace with hash -616848017, now seen corresponding path program 1 times [2018-12-09 00:06:30,776 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:06:30,776 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:06:30,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:06:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:30,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:30,907 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:30,907 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:30,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:06:30,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:06:30,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:30,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:31,000 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:31,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:31,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:06:31,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-09 00:06:31,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 00:06:31,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 00:06:31,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:06:31,061 INFO L87 Difference]: Start difference. First operand 96 states and 118 transitions. Second operand 9 states. [2018-12-09 00:06:31,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:31,212 INFO L93 Difference]: Finished difference Result 145 states and 179 transitions. [2018-12-09 00:06:31,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:06:31,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-09 00:06:31,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:31,214 INFO L225 Difference]: With dead ends: 145 [2018-12-09 00:06:31,214 INFO L226 Difference]: Without dead ends: 117 [2018-12-09 00:06:31,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:06:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-09 00:06:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2018-12-09 00:06:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 00:06:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 120 transitions. [2018-12-09 00:06:31,230 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 120 transitions. Word has length 68 [2018-12-09 00:06:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:31,231 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 120 transitions. [2018-12-09 00:06:31,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 00:06:31,231 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 120 transitions. [2018-12-09 00:06:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 00:06:31,232 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:31,232 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-09 00:06:31,232 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:31,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:31,232 INFO L82 PathProgramCache]: Analyzing trace with hash 708191849, now seen corresponding path program 3 times [2018-12-09 00:06:31,232 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:06:31,233 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:06:31,253 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-09 00:06:31,429 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 00:06:31,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:31,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:31,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-09 00:06:31,460 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-09 00:06:31,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:06:31,583 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:06:31,589 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 00:06:37,444 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-09 00:06:37,444 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:37,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-09 00:06:37,474 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:37,712 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 00:06:37,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:06:37,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 8, 12] total 18 [2018-12-09 00:06:37,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 00:06:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 00:06:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:06:37,732 INFO L87 Difference]: Start difference. First operand 100 states and 120 transitions. Second operand 18 states. [2018-12-09 00:06:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:37,856 INFO L93 Difference]: Finished difference Result 134 states and 154 transitions. [2018-12-09 00:06:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:06:37,857 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 68 [2018-12-09 00:06:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:37,857 INFO L225 Difference]: With dead ends: 134 [2018-12-09 00:06:37,857 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 00:06:37,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 249 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-12-09 00:06:37,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 00:06:37,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 00:06:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 00:06:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2018-12-09 00:06:37,864 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 68 [2018-12-09 00:06:37,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:37,864 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2018-12-09 00:06:37,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 00:06:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2018-12-09 00:06:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-09 00:06:37,865 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:37,865 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 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] [2018-12-09 00:06:37,865 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:37,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -340505635, now seen corresponding path program 1 times [2018-12-09 00:06:37,866 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:06:37,866 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:06:37,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:06:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:38,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:38,062 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:06:38,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 00:06:38,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:38,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:38,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-09 00:06:38,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,114 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,114 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:8 [2018-12-09 00:06:38,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:06:38,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:06:38,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,138 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,143 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 00:06:38,311 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 00:06:38,315 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 00:06:38,315 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,317 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 00:06:38,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-09 00:06:38,407 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:38,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 00:06:38,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,413 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,419 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-09 00:06:38,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-09 00:06:38,659 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:06:38,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,689 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:120, output treesize:110 [2018-12-09 00:06:38,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:38,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 115 [2018-12-09 00:06:38,861 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-09 00:06:38,861 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:38,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 81 [2018-12-09 00:06:38,909 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-09 00:06:38,909 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,915 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:38,924 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:130, output treesize:42 [2018-12-09 00:06:39,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-09 00:06:39,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 5 [2018-12-09 00:06:39,812 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 00:06:39,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-09 00:06:39,849 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-09 00:06:39,861 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-09 00:06:39,868 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,869 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:39,872 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:71, output treesize:11 [2018-12-09 00:06:39,927 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:06:39,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:41,276 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-09 00:06:41,394 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-09 00:06:41,499 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 21 treesize of output 13 [2018-12-09 00:06:41,504 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-12-09 00:06:41,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,509 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,554 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:41,560 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:41,560 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,564 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,565 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,569 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,602 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,605 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,606 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:41,610 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:41,610 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,612 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 00:06:41,634 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:140, output treesize:88 [2018-12-09 00:06:41,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:06:41,796 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:06:41,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:06:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:06:41,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:41,839 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-09 00:06:41,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-09 00:06:41,845 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:41,846 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:41,846 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-09 00:06:41,846 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-09 00:06:41,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-09 00:06:41,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-09 00:06:41,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:12 [2018-12-09 00:06:41,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-12-09 00:06:41,878 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-12-09 00:06:41,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,882 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2018-12-09 00:06:41,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-12-09 00:06:41,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:41,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2018-12-09 00:06:41,891 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:41,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:20 [2018-12-09 00:06:42,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2018-12-09 00:06:42,263 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-09 00:06:42,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,305 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:123, output treesize:113 [2018-12-09 00:06:42,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:06:42,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 126 [2018-12-09 00:06:42,566 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-09 00:06:42,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,579 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,607 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 70 [2018-12-09 00:06:42,610 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 1 [2018-12-09 00:06:42,610 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,614 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:42,623 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:139, output treesize:42 [2018-12-09 00:06:43,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2018-12-09 00:06:43,463 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 44 treesize of output 29 [2018-12-09 00:06:43,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,484 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 29 treesize of output 18 [2018-12-09 00:06:43,484 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,503 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 9 [2018-12-09 00:06:43,503 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,510 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2018-12-09 00:06:43,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-12-09 00:06:43,542 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2018-12-09 00:06:43,560 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-12-09 00:06:43,569 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,570 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:43,574 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:76, output treesize:9 [2018-12-09 00:06:43,585 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 00:06:43,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:45,011 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-09 00:06:45,267 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-09 00:06:45,409 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-09 00:06:45,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,525 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,543 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,544 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,562 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,562 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,579 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,749 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,767 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,768 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,791 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,792 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,808 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,809 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,826 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:06:45,972 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 79 treesize of output 45 [2018-12-09 00:06:45,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-09 00:06:45,976 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:45,978 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:45,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 81 [2018-12-09 00:06:45,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-09 00:06:45,988 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:45,992 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:45,996 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 115 treesize of output 81 [2018-12-09 00:06:46,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 5 [2018-12-09 00:06:46,000 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-09 00:06:46,004 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:06:46,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-09 00:06:46,041 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 3 variables, input treesize:148, output treesize:115 [2018-12-09 00:06:46,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 00:06:46,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 41 [2018-12-09 00:06:46,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-09 00:06:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-09 00:06:46,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3076, Unknown=20, NotChecked=0, Total=3306 [2018-12-09 00:06:46,299 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 41 states. [2018-12-09 00:06:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:50,436 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-12-09 00:06:50,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-09 00:06:50,436 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 69 [2018-12-09 00:06:50,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:50,437 INFO L225 Difference]: With dead ends: 73 [2018-12-09 00:06:50,437 INFO L226 Difference]: Without dead ends: 67 [2018-12-09 00:06:50,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1442 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=432, Invalid=5554, Unknown=20, NotChecked=0, Total=6006 [2018-12-09 00:06:50,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-09 00:06:50,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-09 00:06:50,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 00:06:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2018-12-09 00:06:50,444 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 69 [2018-12-09 00:06:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:50,445 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2018-12-09 00:06:50,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-09 00:06:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2018-12-09 00:06:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-09 00:06:50,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:06:50,445 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-12-09 00:06:50,445 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:06:50,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:06:50,445 INFO L82 PathProgramCache]: Analyzing trace with hash -363826385, now seen corresponding path program 2 times [2018-12-09 00:06:50,446 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-09 00:06:50,446 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-09 00:06:50,458 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-09 00:06:50,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:06:50,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:50,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:50,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:50,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:06:50,713 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_614cbae8-c947-46df-a9cf-7a005fb61700/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 00:06:50,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 00:06:50,757 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 00:06:50,757 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 00:06:50,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:06:50,826 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:50,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:06:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-09 00:06:51,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-09 00:06:51,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-09 00:06:51,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-09 00:06:51,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-09 00:06:51,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-09 00:06:51,158 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand 18 states. [2018-12-09 00:06:51,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:06:51,723 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-12-09 00:06:51,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 00:06:51,723 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 70 [2018-12-09 00:06:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:06:51,723 INFO L225 Difference]: With dead ends: 70 [2018-12-09 00:06:51,723 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:06:51,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 261 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-09 00:06:51,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:06:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:06:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:06:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:06:51,724 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2018-12-09 00:06:51,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:06:51,724 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:06:51,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-09 00:06:51,724 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:06:51,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:06:51,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:06:51,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:06:51,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 00:06:52,069 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2018-12-09 00:06:52,496 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2018-12-09 00:06:52,624 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2018-12-09 00:06:52,960 WARN L180 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 51 [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-09 00:06:53,180 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point sll_destroyEXIT(lines 581 587) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L451 ceAbstractionStarter]: At program point L582-2(lines 582 586) the Hoare annotation is: true [2018-12-09 00:06:53,180 INFO L451 ceAbstractionStarter]: At program point sll_destroyENTRY(lines 581 587) the Hoare annotation is: true [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point L582-3(lines 581 587) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point sll_update_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= sll_update_at_~data |sll_update_at_#in~data|)) (.cse1 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse5 (and (= |sll_update_at_#in~index| sll_update_at_~index) (= sll_update_at_~head.base |sll_update_at_#in~head.base|) .cse0 (= |sll_update_at_#in~head.offset| sll_update_at_~head.offset) .cse2 .cse4 .cse1))) (and (or (and .cse0 .cse1 (bvsgt (bvadd |sll_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (let ((.cse3 (bvadd |sll_update_at_#in~head.offset| (_ bv4 32)))) (and .cse0 (= (bvadd sll_update_at_~index (_ bv1 32)) |sll_update_at_#in~index|) .cse2 (= (select (select |old(#memory_$Pointer$.base)| |sll_update_at_#in~head.base|) .cse3) sll_update_at_~head.base) .cse4 .cse1 (= (select (select |#memory_$Pointer$.offset| |sll_update_at_#in~head.base|) .cse3) sll_update_at_~head.offset))) .cse5 (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32)))))) (or .cse5 (bvsgt |sll_update_at_#in~index| (_ bv0 32)))))) [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-09 00:06:53,180 INFO L448 ceAbstractionStarter]: For program point sll_update_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point sll_update_atENTRY(lines 595 601) the Hoare annotation is: (let ((.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) (and (or (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |old(#memory_int)| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))) .cse0) (or .cse0 (bvsgt |sll_update_at_#in~index| (_ bv0 32))))) [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point L575(line 575) the Hoare annotation is: (let ((.cse0 (bvsgt sll_create_~len (_ bv0 32)))) (or (and (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)) (or (and (not (bvsgt (bvadd |sll_create_#in~len| (_ bv4294967295 32)) (_ bv0 32))) (bvsgt |sll_create_#in~len| (_ bv0 32))) .cse0)) (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))) [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point sll_createEXIT(lines 572 580) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point L575-1(line 575) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point L574-2(lines 574 578) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point L574-3(lines 574 578) the Hoare annotation is: (let ((.cse0 (= (_ bv1 1) (select |#valid| sll_create_~head~0.base)))) (or (and (= |#valid| |old(#valid)|) (= |sll_create_#in~len| sll_create_~len) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (and .cse0 (= (bvadd |sll_create_#in~len| (_ bv4294967295 32)) sll_create_~len) (bvsgt |sll_create_#in~len| (_ bv0 32))) (and .cse0 (not (= (select (select |#memory_$Pointer$.base| sll_create_~head~0.base) (_ bv4 32)) sll_create_~head~0.base)) (= (_ bv0 32) sll_create_~head~0.offset)))) [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point L574-4(lines 574 578) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point sll_createENTRY(lines 572 580) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point sll_createFINAL(lines 572 580) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:06:53,181 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point L609(line 609) the Hoare annotation is: (let ((.cse0 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv4 32)) main_~s~0.base))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse1 (= main_~s~0.offset (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 (= main_~i~0 (_ bv0 32)) .cse2) (and .cse0 .cse2 .cse1 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))) [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point L611-2(lines 611 616) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L448 ceAbstractionStarter]: For program point L609-1(lines 607 610) no Hoare annotation was computed. [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point L611-3(lines 611 616) the Hoare annotation is: (let ((.cse10 (bvsgt main_~i~0 (_ bv0 32))) (.cse5 (= main_~i~0 (_ bv0 32))) (.cse9 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse7 (bvneg main_~len~0)) (.cse8 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse9)) (.cse3 (let ((.cse11 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse10 .cse11) (and .cse11 .cse5)))) (.cse4 (= main_~s~0.offset (_ bv0 32))) (.cse6 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (let ((.cse0 (and .cse10 (and .cse3 .cse4 .cse6))) (.cse1 (not (= .cse8 main_~s~0.base))) (.cse2 (= (bvadd (select (select |#memory_int| .cse8) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse9)) (_ bv4294967295 32)) (bvneg .cse7)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse0 .cse1 (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse2 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse2 (= (bvadd .cse7 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-09 00:06:53,181 INFO L444 ceAbstractionStarter]: At program point L611-4(lines 611 616) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-09 00:06:53,182 INFO L444 ceAbstractionStarter]: At program point L605(line 605) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 00:06:53,182 INFO L444 ceAbstractionStarter]: At program point L607-2(lines 607 610) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse7 (not (= (select .cse6 (_ bv4 32)) main_~s~0.base))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse2 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)))) (or (let ((.cse4 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse0 (select .cse6 .cse4)) (.cse5 (bvneg main_~len~0))) (and (not (= .cse0 main_~s~0.base)) .cse1 .cse2 .cse3 (= (bvadd (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse4)) (_ bv4294967295 32)) (bvneg .cse5)) (= (bvadd .cse5 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) main_~i~0)))) (and .cse7 .cse1 (= main_~i~0 (_ bv0 32)) .cse2) (and .cse7 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))))) [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point L605-1(line 605) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 602 621) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 602 621) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L444 ceAbstractionStarter]: At program point L614(lines 602 621) the Hoare annotation is: false [2018-12-09 00:06:53,182 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 602 621) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point L617(line 617) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L444 ceAbstractionStarter]: At program point L613(line 613) the Hoare annotation is: (let ((.cse8 (bvadd main_~s~0.offset (_ bv4 32)))) (let ((.cse2 (select (select |#memory_int| main_~s~0.base) main_~s~0.offset)) (.cse6 (bvneg main_~len~0)) (.cse7 (select (select |#memory_$Pointer$.base| main_~s~0.base) .cse8))) (let ((.cse0 (not (= .cse7 main_~s~0.base))) (.cse5 (= (bvadd (select (select |#memory_int| .cse7) (select (select |#memory_$Pointer$.offset| main_~s~0.base) .cse8)) (_ bv4294967295 32)) (bvneg .cse6))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse4 (= main_~len~0 .cse2))) (or (and .cse0 .cse1 (= main_~expected~0 .cse2) (= main_~i~0 (_ bv0 32)) .cse3 .cse4 .cse5 (= (bvadd .cse6 main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 (= (bvadd main_~expected~0 (_ bv4294967294 32)) main_~i~0) (= (bvadd main_~len~0 main_~i~0) main_~new_data~0) .cse5 (and .cse1 .cse3 .cse4) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 619) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point L613-1(lines 613 615) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L451 ceAbstractionStarter]: At program point sll_get_data_atENTRY(lines 588 594) the Hoare annotation is: true [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atFINAL(lines 588 594) no Hoare annotation was computed. [2018-12-09 00:06:53,182 INFO L444 ceAbstractionStarter]: At program point L589-2(lines 589 592) the Hoare annotation is: (let ((.cse1 (bvsgt |sll_get_data_at_#in~index| (_ bv0 32))) (.cse3 (bvadd |sll_get_data_at_#in~index| (_ bv4294967295 32)))) (or (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32)))) (or (not (= (_ bv3 32) (select (select |#memory_int| .cse0) (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14) (_ bv4 32))))) (= .cse0 v_main_~s~0.base_BEFORE_CALL_14)))) (let ((.cse2 (bvadd |sll_get_data_at_#in~head.offset| (_ bv4 32)))) (and .cse1 (= sll_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_get_data_at_#in~head.base|) .cse2)) (= sll_get_data_at_~head.base (select (select |#memory_$Pointer$.base| |sll_get_data_at_#in~head.base|) .cse2)) (= .cse3 sll_get_data_at_~index))) (and .cse1 (bvsgt .cse3 (_ bv0 32))) (forall ((v_main_~s~0.base_BEFORE_CALL_6 (_ BitVec 32))) (not (= (_ bv2 32) (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_6) (_ bv0 32))))) (and (= |sll_get_data_at_#in~index| sll_get_data_at_~index) (= sll_get_data_at_~head.offset |sll_get_data_at_#in~head.offset|) (= sll_get_data_at_~head.base |sll_get_data_at_#in~head.base|)))) [2018-12-09 00:06:53,182 INFO L448 ceAbstractionStarter]: For program point L589-3(lines 589 592) no Hoare annotation was computed. [2018-12-09 00:06:53,183 INFO L448 ceAbstractionStarter]: For program point sll_get_data_atEXIT(lines 588 594) no Hoare annotation was computed. [2018-12-09 00:06:53,183 INFO L444 ceAbstractionStarter]: At program point node_createENTRY(lines 563 571) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) [2018-12-09 00:06:53,183 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-09 00:06:53,183 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-09 00:06:53,183 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-09 00:06:53,183 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-09 00:06:53,183 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-09 00:06:53,185 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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) [2018-12-09 00:06:53,187 INFO L168 Benchmark]: Toolchain (without parser) took 88970.89 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 236.5 MB). Free memory was 938.0 MB in the beginning and 993.0 MB in the end (delta: -55.0 MB). Peak memory consumption was 181.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:53,187 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-09 00:06:53,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 277.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:53,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.09 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-09 00:06:53,188 INFO L168 Benchmark]: Boogie Preprocessor took 21.40 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:53,188 INFO L168 Benchmark]: RCFGBuilder took 245.26 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:53,188 INFO L168 Benchmark]: TraceAbstraction took 88404.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 993.0 MB in the end (delta: 88.6 MB). Peak memory consumption was 187.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:06:53,189 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 277.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.09 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 21.40 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: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 245.26 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88404.71 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 99.1 MB). Free memory was 1.1 GB in the beginning and 993.0 MB in the end (delta: 88.6 MB). Peak memory consumption was 187.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 619]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...