./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_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_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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 abd6dbc145d5f477746656086724ee83e0738836 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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 abd6dbc145d5f477746656086724ee83e0738836 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 15:51:02,955 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:51:02,956 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:51:02,962 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:51:02,962 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:51:02,963 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:51:02,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:51:02,964 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:51:02,965 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:51:02,965 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:51:02,966 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:51:02,966 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:51:02,966 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:51:02,967 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:51:02,967 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:51:02,968 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:51:02,968 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:51:02,969 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:51:02,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:51:02,971 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:51:02,971 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:51:02,972 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:51:02,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:51:02,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:51:02,973 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:51:02,974 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:51:02,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:51:02,974 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:51:02,975 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:51:02,975 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:51:02,976 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:51:02,976 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:51:02,976 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:51:02,976 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:51:02,977 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:51:02,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:51:02,977 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 15:51:02,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:51:02,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:51:02,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:51:02,985 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:51:02,985 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:51:02,985 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:51:02,985 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:51:02,985 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:51:02,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:51:02,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 15:51:02,987 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:51:02,987 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:51:02,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 15:51:02,988 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 15:51:02,988 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_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2018-12-08 15:51:03,006 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:51:03,016 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:51:03,018 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:51:03,019 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:51:03,020 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:51:03,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 15:51:03,057 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/951fc5823/4296c1cc439845e495e333db0071b19a/FLAG9b4c59e15 [2018-12-08 15:51:03,412 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:51:03,413 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 15:51:03,419 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/951fc5823/4296c1cc439845e495e333db0071b19a/FLAG9b4c59e15 [2018-12-08 15:51:03,788 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/951fc5823/4296c1cc439845e495e333db0071b19a [2018-12-08 15:51:03,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:51:03,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:51:03,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:51:03,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:51:03,793 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:51:03,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:51:03" (1/1) ... [2018-12-08 15:51:03,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32f91bec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:03, skipping insertion in model container [2018-12-08 15:51:03,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:51:03" (1/1) ... [2018-12-08 15:51:03,803 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:51:03,826 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:51:03,991 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:51:03,997 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:51:04,062 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:51:04,093 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:51:04,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04 WrapperNode [2018-12-08 15:51:04,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:51:04,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:51:04,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:51:04,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:51:04,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,119 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:51:04,119 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:51:04,119 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:51:04,119 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:51:04,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,131 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,138 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,143 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... [2018-12-08 15:51:04,144 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:51:04,145 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:51:04,145 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:51:04,145 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:51:04,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:51:04,176 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 15:51:04,176 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 15:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-08 15:51:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 15:51:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-08 15:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-08 15:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 15:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-08 15:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-08 15:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-08 15:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-08 15:51:04,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:51:04,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:51:04,378 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:51:04,379 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 15:51:04,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:51:04 BoogieIcfgContainer [2018-12-08 15:51:04,379 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:51:04,380 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:51:04,380 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:51:04,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:51:04,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:51:03" (1/3) ... [2018-12-08 15:51:04,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecd21cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:51:04, skipping insertion in model container [2018-12-08 15:51:04,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:51:04" (2/3) ... [2018-12-08 15:51:04,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ecd21cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:51:04, skipping insertion in model container [2018-12-08 15:51:04,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:51:04" (3/3) ... [2018-12-08 15:51:04,385 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 15:51:04,390 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:51:04,395 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 15:51:04,404 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 15:51:04,424 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:51:04,424 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 15:51:04,424 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:51:04,424 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:51:04,425 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:51:04,425 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:51:04,425 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:51:04,425 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:51:04,436 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-12-08 15:51:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-08 15:51:04,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:51:04,440 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] [2018-12-08 15:51:04,441 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:51:04,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:51:04,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1072166703, now seen corresponding path program 1 times [2018-12-08 15:51:04,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:51:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:04,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:51:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:04,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:51:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:51:04,584 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-08 15:51:04,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:51:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:51:04,585 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:51:04,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:51:04,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:51:04,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:51:04,598 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 5 states. [2018-12-08 15:51:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:51:04,662 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2018-12-08 15:51:04,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:51:04,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-12-08 15:51:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:51:04,670 INFO L225 Difference]: With dead ends: 101 [2018-12-08 15:51:04,670 INFO L226 Difference]: Without dead ends: 46 [2018-12-08 15:51:04,673 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-08 15:51:04,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-08 15:51:04,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2018-12-08 15:51:04,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 15:51:04,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-08 15:51:04,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 32 [2018-12-08 15:51:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:51:04,702 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-08 15:51:04,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:51:04,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-08 15:51:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 15:51:04,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:51:04,704 INFO L402 BasicCegarLoop]: trace histogram [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-08 15:51:04,704 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:51:04,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:51:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash 35479273, now seen corresponding path program 1 times [2018-12-08 15:51:04,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:51:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:04,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:51:04,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:04,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:51:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:51:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:51:04,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:51:04,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:51:04,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:51:04,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:51:04,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:51:04,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:51:04,775 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 4 states. [2018-12-08 15:51:04,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:51:04,797 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2018-12-08 15:51:04,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:51:04,797 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-08 15:51:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:51:04,798 INFO L225 Difference]: With dead ends: 67 [2018-12-08 15:51:04,799 INFO L226 Difference]: Without dead ends: 54 [2018-12-08 15:51:04,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:51:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-08 15:51:04,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-08 15:51:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-08 15:51:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2018-12-08 15:51:04,806 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 40 [2018-12-08 15:51:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:51:04,806 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2018-12-08 15:51:04,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:51:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2018-12-08 15:51:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 15:51:04,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:51:04,807 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:51:04,808 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:51:04,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:51:04,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1184429299, now seen corresponding path program 1 times [2018-12-08 15:51:04,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:51:04,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:04,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:51:04,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:04,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:51:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:51:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:51:04,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:51:04,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:51:04,867 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-12-08 15:51:04,868 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-08 15:51:04,888 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:51:04,888 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:51:05,040 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-12-08 15:51:05,041 INFO L272 AbstractInterpreter]: Visited 33 different actions 66 times. Merged at 8 different actions 11 times. Never widened. Performed 652 root evaluator evaluations with a maximum evaluation depth of 4. Performed 652 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 3 fixpoints after 3 different actions. Largest state had 31 variables. [2018-12-08 15:51:05,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:51:05,046 INFO L401 sIntCurrentIteration]: Generating AbsInt predicates [2018-12-08 15:51:05,114 INFO L227 lantSequenceWeakener]: Weakened 2 states. On average, predicates are now at 75% of their original sizes. [2018-12-08 15:51:05,115 INFO L416 sIntCurrentIteration]: Unifying AI predicates [2018-12-08 15:51:05,317 INFO L418 sIntCurrentIteration]: We unified 47 AI predicates to 47 [2018-12-08 15:51:05,317 INFO L427 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-12-08 15:51:05,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:51:05,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [5] total 23 [2018-12-08 15:51:05,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:51:05,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-08 15:51:05,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-08 15:51:05,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2018-12-08 15:51:05,319 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand 20 states. [2018-12-08 15:51:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:51:06,349 INFO L93 Difference]: Finished difference Result 88 states and 102 transitions. [2018-12-08 15:51:06,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-08 15:51:06,350 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-12-08 15:51:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:51:06,351 INFO L225 Difference]: With dead ends: 88 [2018-12-08 15:51:06,351 INFO L226 Difference]: Without dead ends: 75 [2018-12-08 15:51:06,352 INFO L631 BasicCegarLoop]: 2 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2018-12-08 15:51:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-08 15:51:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 58. [2018-12-08 15:51:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 15:51:06,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 67 transitions. [2018-12-08 15:51:06,359 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 67 transitions. Word has length 48 [2018-12-08 15:51:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:51:06,359 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 67 transitions. [2018-12-08 15:51:06,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-08 15:51:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2018-12-08 15:51:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 15:51:06,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:51:06,360 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:51:06,360 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:51:06,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:51:06,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1276480668, now seen corresponding path program 1 times [2018-12-08 15:51:06,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:51:06,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:06,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:51:06,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:51:06,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:51:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:51:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:51:07,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:51:07,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:51:07,038 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-12-08 15:51:07,038 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-08 15:51:07,039 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:51:07,040 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:51:07,077 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:51:07,077 INFO L272 AbstractInterpreter]: Visited 45 different actions 95 times. Merged at 13 different actions 19 times. Never widened. Performed 807 root evaluator evaluations with a maximum evaluation depth of 4. Performed 807 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 6 fixpoints after 5 different actions. Largest state had 31 variables. [2018-12-08 15:51:07,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:51:07,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:51:07,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:51:07,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:51:07,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:51:07,087 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:51:07,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:51:07,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:51:07,152 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-08 15:51:07,153 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 15:51:07,259 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:51:07,260 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:51:07,260 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-08 15:51:07,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 15:51:07,295 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-08 15:51:07,297 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-08 15:51:07,297 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-08 15:51:07,341 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 28 treesize of output 24 [2018-12-08 15:51:07,343 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 11 [2018-12-08 15:51:07,343 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,350 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-08 15:51:07,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-12-08 15:51:07,582 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 13 treesize of output 10 [2018-12-08 15:51:07,584 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 10 treesize of output 9 [2018-12-08 15:51:07,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-08 15:51:07,663 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 39 treesize of output 35 [2018-12-08 15:51:07,667 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:51:07,668 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 32 treesize of output 26 [2018-12-08 15:51:07,669 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,677 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:07,689 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-08 15:51:07,690 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:54, output treesize:35 [2018-12-08 15:51:08,204 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int) (sll_circular_update_at_~data Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ sll_circular_update_at_~head.offset 4) sll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-08 15:51:08,215 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-08 15:51:08,217 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-08 15:51:08,217 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:08,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:08,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-08 15:51:08,232 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 18 treesize of output 14 [2018-12-08 15:51:08,233 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-08 15:51:08,238 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 5 treesize of output 1 [2018-12-08 15:51:08,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:08,241 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:51:08,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:08,247 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:56, output treesize:16 [2018-12-08 15:51:08,636 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 37 treesize of output 37 [2018-12-08 15:51:08,642 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:51:08,643 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 29 treesize of output 10 [2018-12-08 15:51:08,643 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:08,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:08,661 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-08 15:51:08,661 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:43, output treesize:10 [2018-12-08 15:51:08,743 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 15:51:08,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:51:11,202 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-08 15:51:11,206 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:51:11,400 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:51:11,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:51:28,002 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:51:28,008 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:51:45,953 WARN L180 SmtUtils]: Spent 2.90 s on a formula simplification that was a NOOP. DAG size: 75 [2018-12-08 15:51:45,957 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:51:56,987 WARN L180 SmtUtils]: Spent 2.61 s on a formula simplification that was a NOOP. DAG size: 73 [2018-12-08 15:51:57,034 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 68 treesize of output 59 [2018-12-08 15:51:57,057 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 11 treesize of output 10 [2018-12-08 15:51:57,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,074 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 20 treesize of output 16 [2018-12-08 15:51:57,076 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 3 [2018-12-08 15:51:57,076 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,078 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,080 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-08 15:51:57,082 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 8 treesize of output 1 [2018-12-08 15:51:57,082 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,086 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,099 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-08 15:51:57,142 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,144 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,145 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-08 15:51:57,149 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-08 15:51:57,150 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-08 15:51:57,153 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-08 15:51:57,175 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-08 15:51:57,177 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-08 15:51:57,192 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 57 treesize of output 49 [2018-12-08 15:51:57,215 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 11 treesize of output 10 [2018-12-08 15:51:57,215 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,230 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 28 treesize of output 26 [2018-12-08 15:51:57,232 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 8 treesize of output 1 [2018-12-08 15:51:57,232 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,235 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,236 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 20 treesize of output 16 [2018-12-08 15:51:57,238 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 3 [2018-12-08 15:51:57,238 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,239 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:51:57,248 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-12-08 15:51:57,269 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-08 15:51:57,269 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:137, output treesize:65 [2018-12-08 15:51:57,332 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-12-08 15:52:01,760 WARN L180 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-08 15:52:01,891 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-08 15:52:01,898 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-08 15:52:01,921 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 82 treesize of output 73 [2018-12-08 15:52:01,939 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 11 treesize of output 10 [2018-12-08 15:52:01,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:01,954 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-08 15:52:01,956 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 8 treesize of output 1 [2018-12-08 15:52:01,956 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:01,959 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:01,965 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 22 treesize of output 26 [2018-12-08 15:52:01,968 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 21 treesize of output 17 [2018-12-08 15:52:01,968 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:01,977 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-08 15:52:01,977 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:01,988 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 18 treesize of output 18 [2018-12-08 15:52:01,988 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-12-08 15:52:01,993 INFO L267 ElimStorePlain]: Start of recursive call 8: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 15:52:02,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-12-08 15:52:02,086 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-08 15:52:02,091 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-08 15:52:02,092 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-08 15:52:02,098 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-08 15:52:02,099 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,103 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,104 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-08 15:52:02,108 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-08 15:52:02,109 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,113 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,114 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,117 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,118 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-08 15:52:02,124 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-08 15:52:02,187 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 82 treesize of output 73 [2018-12-08 15:52:02,205 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 11 treesize of output 10 [2018-12-08 15:52:02,205 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,220 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 33 treesize of output 31 [2018-12-08 15:52:02,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, 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 1 [2018-12-08 15:52:02,223 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,227 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,234 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 22 treesize of output 26 [2018-12-08 15:52:02,236 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 21 treesize of output 13 [2018-12-08 15:52:02,236 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,250 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 18 treesize of output 18 [2018-12-08 15:52:02,250 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-12-08 15:52:02,258 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 9 [2018-12-08 15:52:02,258 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,263 INFO L267 ElimStorePlain]: Start of recursive call 30: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-08 15:52:02,277 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-08 15:52:02,375 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 13 xjuncts. [2018-12-08 15:52:02,375 INFO L202 ElimStorePlain]: Needed 33 recursive calls to eliminate 8 variables, input treesize:165, output treesize:348 [2018-12-08 15:52:02,375 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 13 [2018-12-08 15:52:02,882 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 37 treesize of output 31 [2018-12-08 15:52:02,884 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-08 15:52:02,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2018-12-08 15:52:02,912 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 34 treesize of output 33 [2018-12-08 15:52:02,912 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 39 [2018-12-08 15:52:02,938 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 15:52:02,969 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 17 treesize of output 15 [2018-12-08 15:52:02,970 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-08 15:52:02,970 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,972 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,973 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2018-12-08 15:52:02,979 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 19 treesize of output 4 [2018-12-08 15:52:02,979 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,981 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:02,999 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 30 treesize of output 32 [2018-12-08 15:52:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-12-08 15:52:03,008 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:03,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, 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 8 [2018-12-08 15:52:03,015 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:03,022 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 19 treesize of output 4 [2018-12-08 15:52:03,022 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:03,025 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:03,033 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:52:03,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:52:03,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:52:03,039 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 4 variables, input treesize:37, output treesize:9 [2018-12-08 15:52:03,366 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:52:03,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:52:03,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 31, 29] total 79 [2018-12-08 15:52:03,381 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:52:03,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-08 15:52:03,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-08 15:52:03,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=5745, Unknown=17, NotChecked=152, Total=6162 [2018-12-08 15:52:03,383 INFO L87 Difference]: Start difference. First operand 58 states and 67 transitions. Second operand 55 states. [2018-12-08 15:52:07,238 WARN L180 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2018-12-08 15:52:11,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:11,733 INFO L93 Difference]: Finished difference Result 139 states and 183 transitions. [2018-12-08 15:52:11,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-08 15:52:11,733 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 57 [2018-12-08 15:52:11,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:11,735 INFO L225 Difference]: With dead ends: 139 [2018-12-08 15:52:11,735 INFO L226 Difference]: Without dead ends: 137 [2018-12-08 15:52:11,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 65 SyntacticMatches, 8 SemanticMatches, 111 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2596 ImplicationChecksByTransitivity, 62.3s TimeCoverageRelationStatistics Valid=690, Invalid=11718, Unknown=28, NotChecked=220, Total=12656 [2018-12-08 15:52:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-08 15:52:11,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 95. [2018-12-08 15:52:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-08 15:52:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 120 transitions. [2018-12-08 15:52:11,753 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 120 transitions. Word has length 57 [2018-12-08 15:52:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:11,753 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 120 transitions. [2018-12-08 15:52:11,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-08 15:52:11,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 120 transitions. [2018-12-08 15:52:11,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 15:52:11,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:11,755 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:11,755 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:11,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:11,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1399081879, now seen corresponding path program 1 times [2018-12-08 15:52:11,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:11,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:11,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:11,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:11,801 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 15:52:11,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:11,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:11,801 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-12-08 15:52:11,801 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-08 15:52:11,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:52:11,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:52:11,851 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:52:11,851 INFO L272 AbstractInterpreter]: Visited 46 different actions 84 times. Merged at 10 different actions 13 times. Never widened. Performed 666 root evaluator evaluations with a maximum evaluation depth of 4. Performed 666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 5 fixpoints after 4 different actions. Largest state had 31 variables. [2018-12-08 15:52:11,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:11,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:52:11,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:11,853 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:11,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:11,862 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:52:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:11,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:11,921 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 15:52:11,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 15:52:11,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:52:11,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2018-12-08 15:52:11,969 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:52:11,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:52:11,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:52:11,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:52:11,970 INFO L87 Difference]: Start difference. First operand 95 states and 120 transitions. Second operand 5 states. [2018-12-08 15:52:11,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:11,999 INFO L93 Difference]: Finished difference Result 135 states and 167 transitions. [2018-12-08 15:52:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:52:11,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-08 15:52:11,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:12,000 INFO L225 Difference]: With dead ends: 135 [2018-12-08 15:52:12,000 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 15:52:12,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 110 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-08 15:52:12,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 15:52:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2018-12-08 15:52:12,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-08 15:52:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 127 transitions. [2018-12-08 15:52:12,014 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 127 transitions. Word has length 58 [2018-12-08 15:52:12,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:12,014 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 127 transitions. [2018-12-08 15:52:12,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:52:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 127 transitions. [2018-12-08 15:52:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 15:52:12,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:12,016 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:12,016 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:12,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:12,016 INFO L82 PathProgramCache]: Analyzing trace with hash -943903267, now seen corresponding path program 2 times [2018-12-08 15:52:12,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:12,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:12,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:12,066 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-08 15:52:12,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:12,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:52:12,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:52:12,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:12,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:52:12,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:52:12,119 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 15:52:12,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:52:12,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:12,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:52:12,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:12,200 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:52:12,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:52:12,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-08 15:52:12,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:52:12,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:52:12,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:52:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:52:12,216 INFO L87 Difference]: Start difference. First operand 101 states and 127 transitions. Second operand 8 states. [2018-12-08 15:52:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:12,279 INFO L93 Difference]: Finished difference Result 164 states and 200 transitions. [2018-12-08 15:52:12,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 15:52:12,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-08 15:52:12,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:12,280 INFO L225 Difference]: With dead ends: 164 [2018-12-08 15:52:12,280 INFO L226 Difference]: Without dead ends: 113 [2018-12-08 15:52:12,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 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-08 15:52:12,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-08 15:52:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 98. [2018-12-08 15:52:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 15:52:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2018-12-08 15:52:12,298 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 58 [2018-12-08 15:52:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:12,298 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2018-12-08 15:52:12,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:52:12,298 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2018-12-08 15:52:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-08 15:52:12,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:12,299 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:12,300 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:12,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1842889591, now seen corresponding path program 3 times [2018-12-08 15:52:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,301 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:52:12,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 15:52:12,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,340 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:12,340 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:52:12,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:52:12,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:12,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:52:12,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-08 15:52:12,372 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:52:12,372 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:52:12,375 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-08 15:52:12,406 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:12,450 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 15:52:12,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-08 15:52:12,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-08 15:52:12,465 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-08 15:52:12,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 15:52:12,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 15:52:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:52:12,466 INFO L87 Difference]: Start difference. First operand 98 states and 119 transitions. Second operand 8 states. [2018-12-08 15:52:12,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:12,514 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2018-12-08 15:52:12,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:52:12,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-08 15:52:12,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:12,516 INFO L225 Difference]: With dead ends: 149 [2018-12-08 15:52:12,516 INFO L226 Difference]: Without dead ends: 109 [2018-12-08 15:52:12,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 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-08 15:52:12,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-08 15:52:12,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 98. [2018-12-08 15:52:12,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 15:52:12,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2018-12-08 15:52:12,529 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 58 [2018-12-08 15:52:12,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:12,530 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2018-12-08 15:52:12,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 15:52:12,530 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2018-12-08 15:52:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 15:52:12,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:12,530 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:12,531 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:12,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1894997614, now seen corresponding path program 4 times [2018-12-08 15:52:12,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:52:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,532 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-08 15:52:12,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,569 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:12,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:52:12,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:52:12,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:12,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:12,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:52:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:12,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-12-08 15:52:12,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-08 15:52:12,703 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:52:12,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [7] total 14 [2018-12-08 15:52:12,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:52:12,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:52:12,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:52:12,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-08 15:52:12,704 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand 6 states. [2018-12-08 15:52:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:12,734 INFO L93 Difference]: Finished difference Result 167 states and 198 transitions. [2018-12-08 15:52:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:52:12,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-08 15:52:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:12,735 INFO L225 Difference]: With dead ends: 167 [2018-12-08 15:52:12,735 INFO L226 Difference]: Without dead ends: 95 [2018-12-08 15:52:12,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2018-12-08 15:52:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-08 15:52:12,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2018-12-08 15:52:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 15:52:12,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2018-12-08 15:52:12,745 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 65 [2018-12-08 15:52:12,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:12,745 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2018-12-08 15:52:12,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:52:12,745 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2018-12-08 15:52:12,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 15:52:12,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:12,745 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:12,746 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:12,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:12,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2144446540, now seen corresponding path program 5 times [2018-12-08 15:52:12,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:12,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:12,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,746 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:12,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:52:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:12,781 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-08 15:52:12,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-08 15:52:12,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,781 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:12,788 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:52:12,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-08 15:52:12,811 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 15:52:12,811 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:52:12,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:12,817 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:52:12,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:52:12,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:52:12,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 8 [2018-12-08 15:52:12,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:52:12,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:52:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:52:12,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:52:12,871 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand 6 states. [2018-12-08 15:52:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:12,893 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2018-12-08 15:52:12,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:52:12,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-08 15:52:12,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:12,894 INFO L225 Difference]: With dead ends: 104 [2018-12-08 15:52:12,894 INFO L226 Difference]: Without dead ends: 60 [2018-12-08 15:52:12,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:52:12,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-08 15:52:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-08 15:52:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-08 15:52:12,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-12-08 15:52:12,903 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 65 [2018-12-08 15:52:12,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:12,903 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-12-08 15:52:12,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:52:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-12-08 15:52:12,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 15:52:12,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:12,904 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, 1, 1, 1, 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-08 15:52:12,904 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:12,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:12,904 INFO L82 PathProgramCache]: Analyzing trace with hash -592708753, now seen corresponding path program 1 times [2018-12-08 15:52:12,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:12,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:52:12,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:12,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:52:12,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,935 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:12,935 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2018-12-08 15:52:12,935 INFO L205 CegarAbsIntRunner]: [0], [7], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-08 15:52:12,936 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:52:12,936 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:52:12,980 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:52:12,981 INFO L272 AbstractInterpreter]: Visited 47 different actions 104 times. Merged at 15 different actions 21 times. Never widened. Performed 879 root evaluator evaluations with a maximum evaluation depth of 4. Performed 879 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 6 different actions. Largest state had 31 variables. [2018-12-08 15:52:12,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:12,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:52:12,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:12,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:12,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:12,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:52:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:13,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:52:13,036 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:52:13,083 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:52:13,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [6] total 8 [2018-12-08 15:52:13,084 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 15:52:13,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 15:52:13,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 15:52:13,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 15:52:13,084 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-12-08 15:52:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:13,116 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2018-12-08 15:52:13,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 15:52:13,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 15:52:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:13,117 INFO L225 Difference]: With dead ends: 64 [2018-12-08 15:52:13,117 INFO L226 Difference]: Without dead ends: 60 [2018-12-08 15:52:13,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 129 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-08 15:52:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-08 15:52:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-08 15:52:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-08 15:52:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2018-12-08 15:52:13,122 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 67 [2018-12-08 15:52:13,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:13,123 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2018-12-08 15:52:13,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 15:52:13,123 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2018-12-08 15:52:13,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-08 15:52:13,123 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:13,123 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, 1, 1, 1, 1, 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-08 15:52:13,124 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:13,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1121174764, now seen corresponding path program 1 times [2018-12-08 15:52:13,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 15:52:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:13,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:13,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 15:52:13,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 15:52:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:13,784 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 15:52:13,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:13,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 15:52:13,784 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 69 with the following transitions: [2018-12-08 15:52:13,784 INFO L205 CegarAbsIntRunner]: [0], [7], [9], [13], [14], [15], [17], [23], [25], [28], [32], [40], [42], [45], [47], [49], [55], [58], [65], [67], [71], [72], [73], [74], [80], [82], [89], [91], [93], [97], [98], [123], [129], [131], [132], [133], [134], [135], [136], [137], [138], [141], [142], [143], [144], [145], [146], [147] [2018-12-08 15:52:13,785 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 15:52:13,785 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 15:52:13,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 15:52:13,846 INFO L272 AbstractInterpreter]: Visited 48 different actions 135 times. Merged at 21 different actions 42 times. Never widened. Performed 970 root evaluator evaluations with a maximum evaluation depth of 4. Performed 970 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 11 fixpoints after 7 different actions. Largest state had 31 variables. [2018-12-08 15:52:13,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:13,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 15:52:13,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:13,848 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:13,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:13,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 15:52:13,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:13,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:13,907 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-08 15:52:13,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:13,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:13,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 15:52:14,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:14,042 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:14,042 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-08 15:52:14,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2018-12-08 15:52:14,070 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-08 15:52:14,071 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-08 15:52:14,071 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-08 15:52:14,106 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 28 treesize of output 24 [2018-12-08 15:52:14,107 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 11 [2018-12-08 15:52:14,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,112 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-08 15:52:14,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:20 [2018-12-08 15:52:14,680 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~head.offset Int)) (and (<= |c_sll_circular_update_at_#in~head.offset| sll_circular_update_at_~head.offset) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base| (let ((.cse0 (+ sll_circular_update_at_~head.offset 4))) (store (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_sll_circular_update_at_#in~head.base|) .cse0))))))) is different from true [2018-12-08 15:52:14,687 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 39 treesize of output 35 [2018-12-08 15:52:14,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:14,690 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 32 treesize of output 26 [2018-12-08 15:52:14,690 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:14,699 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:26 [2018-12-08 15:52:14,842 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 25 treesize of output 18 [2018-12-08 15:52:14,844 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 18 treesize of output 17 [2018-12-08 15:52:14,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,855 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-08 15:52:14,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2018-12-08 15:52:14,939 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 117 treesize of output 118 [2018-12-08 15:52:14,941 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 32 treesize of output 1 [2018-12-08 15:52:14,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:14,975 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 97 treesize of output 87 [2018-12-08 15:52:14,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 21 [2018-12-08 15:52:14,988 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 15:52:14,996 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:52:15,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:15,014 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:139, output treesize:112 [2018-12-08 15:52:15,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 102 treesize of output 96 [2018-12-08 15:52:15,544 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 92 treesize of output 86 [2018-12-08 15:52:15,545 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-08 15:52:15,565 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 86 treesize of output 78 [2018-12-08 15:52:15,565 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-08 15:52:15,603 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 82 [2018-12-08 15:52:15,605 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:15,634 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 15:52:15,668 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 78 treesize of output 76 [2018-12-08 15:52:15,671 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2018-12-08 15:52:15,672 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:15,699 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 72 treesize of output 66 [2018-12-08 15:52:15,699 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-08 15:52:15,722 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 66 treesize of output 62 [2018-12-08 15:52:15,723 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-08 15:52:15,743 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:15,745 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 78 treesize of output 68 [2018-12-08 15:52:15,747 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 23 treesize of output 19 [2018-12-08 15:52:15,748 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-08 15:52:15,757 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 34 treesize of output 28 [2018-12-08 15:52:15,758 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-08 15:52:15,766 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-08 15:52:15,772 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 74 treesize of output 72 [2018-12-08 15:52:15,775 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 68 treesize of output 64 [2018-12-08 15:52:15,775 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:15,799 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 64 treesize of output 58 [2018-12-08 15:52:15,799 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-08 15:52:15,829 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 62 [2018-12-08 15:52:15,830 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:15,860 INFO L267 ElimStorePlain]: Start of recursive call 13: 3 dim-1 vars, End of recursive call: 5 dim-0 vars, and 3 xjuncts. [2018-12-08 15:52:15,940 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 62 treesize of output 60 [2018-12-08 15:52:15,942 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 56 treesize of output 41 [2018-12-08 15:52:15,943 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:15,964 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:15,965 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 52 treesize of output 23 [2018-12-08 15:52:15,965 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:15,979 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:15,980 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 58 treesize of output 48 [2018-12-08 15:52:15,982 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:15,983 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 36 treesize of output 7 [2018-12-08 15:52:15,983 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:15,992 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:15,993 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 58 treesize of output 48 [2018-12-08 15:52:15,996 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:15,996 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 36 treesize of output 7 [2018-12-08 15:52:15,997 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,001 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,007 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 58 treesize of output 56 [2018-12-08 15:52:16,010 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:16,011 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 48 treesize of output 19 [2018-12-08 15:52:16,011 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,027 INFO L267 ElimStorePlain]: Start of recursive call 24: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,032 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 58 treesize of output 56 [2018-12-08 15:52:16,034 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 52 treesize of output 37 [2018-12-08 15:52:16,034 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,053 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:16,053 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 48 treesize of output 19 [2018-12-08 15:52:16,054 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,066 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,067 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 36 treesize of output 30 [2018-12-08 15:52:16,068 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 22 treesize of output 7 [2018-12-08 15:52:16,068 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,071 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:16,092 INFO L202 ElimStorePlain]: Needed 30 recursive calls to eliminate 7 variables, input treesize:105, output treesize:10 [2018-12-08 15:52:16,135 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-12-08 15:52:16,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:16,629 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-08 15:52:16,635 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-08 15:52:16,636 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-08 15:52:16,643 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-08 15:52:16,643 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-08 15:52:16,649 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-08 15:52:16,650 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-08 15:52:16,656 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-08 15:52:16,785 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-08 15:52:16,791 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-08 15:52:16,791 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-08 15:52:16,796 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-08 15:52:16,797 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-08 15:52:16,803 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-08 15:52:16,804 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-08 15:52:16,809 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-08 15:52:16,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 89 [2018-12-08 15:52:16,976 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 73 treesize of output 72 [2018-12-08 15:52:16,976 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 86 [2018-12-08 15:52:17,007 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-12-08 15:52:17,037 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 60 [2018-12-08 15:52:17,039 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 1 [2018-12-08 15:52:17,039 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,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 37 treesize of output 33 [2018-12-08 15:52:17,044 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-08 15:52:17,048 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,076 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-12-08 15:52:17,078 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 40 treesize of output 31 [2018-12-08 15:52:17,078 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,082 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 61 [2018-12-08 15:52:17,089 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 48 [2018-12-08 15:52:17,089 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:17,098 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:17,145 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 68 treesize of output 66 [2018-12-08 15:52:17,146 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 50 treesize of output 46 [2018-12-08 15:52:17,147 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,162 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 53 [2018-12-08 15:52:17,163 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:17,176 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 15:52:17,212 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-12-08 15:52:17,225 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 92 [2018-12-08 15:52:17,227 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 66 treesize of output 65 [2018-12-08 15:52:17,227 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 70 [2018-12-08 15:52:17,264 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,290 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2018-12-08 15:52:17,296 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 45 [2018-12-08 15:52:17,296 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:17,305 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:52:17,328 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 24 treesize of output 28 [2018-12-08 15:52:17,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2018-12-08 15:52:17,330 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,350 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2018-12-08 15:52:17,350 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,353 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,357 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,360 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:17,360 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 97 treesize of output 83 [2018-12-08 15:52:17,363 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 66 [2018-12-08 15:52:17,363 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2018-12-08 15:52:17,372 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-12-08 15:52:17,373 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,376 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,380 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,382 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,384 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 96 [2018-12-08 15:52:17,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 85 [2018-12-08 15:52:17,388 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,393 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,394 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 48 [2018-12-08 15:52:17,395 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 40 treesize of output 31 [2018-12-08 15:52:17,395 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,398 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,401 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,462 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 45 treesize of output 23 [2018-12-08 15:52:17,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-12-08 15:52:17,463 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,465 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,467 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 59 treesize of output 37 [2018-12-08 15:52:17,468 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 5 [2018-12-08 15:52:17,468 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,470 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,520 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,526 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,526 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,533 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,534 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,539 INFO L267 ElimStorePlain]: Start of recursive call 55: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,571 INFO L267 ElimStorePlain]: Start of recursive call 58: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,575 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,576 INFO L267 ElimStorePlain]: Start of recursive call 60: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,581 INFO L267 ElimStorePlain]: Start of recursive call 59: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,581 INFO L267 ElimStorePlain]: Start of recursive call 62: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,586 INFO L267 ElimStorePlain]: Start of recursive call 61: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,615 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 97 treesize of output 69 [2018-12-08 15:52:17,617 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 35 treesize of output 5 [2018-12-08 15:52:17,617 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,619 INFO L267 ElimStorePlain]: Start of recursive call 63: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,620 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 97 treesize of output 69 [2018-12-08 15:52:17,622 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 35 treesize of output 5 [2018-12-08 15:52:17,622 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,624 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,642 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:52:17,642 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 33 treesize of output 44 [2018-12-08 15:52:17,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:17,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2018-12-08 15:52:17,645 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,650 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 12 treesize of output 6 [2018-12-08 15:52:17,651 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2018-12-08 15:52:17,651 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,652 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,654 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,666 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 92 [2018-12-08 15:52:17,672 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 70 [2018-12-08 15:52:17,673 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,701 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 32 treesize of output 31 [2018-12-08 15:52:17,701 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,720 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2018-12-08 15:52:17,721 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 10 treesize of output 8 [2018-12-08 15:52:17,721 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,726 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 8 treesize of output 1 [2018-12-08 15:52:17,726 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,728 INFO L267 ElimStorePlain]: Start of recursive call 74: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,748 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 58 treesize of output 60 [2018-12-08 15:52:17,755 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 50 [2018-12-08 15:52:17,756 INFO L267 ElimStorePlain]: Start of recursive call 78: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:52:17,777 INFO L267 ElimStorePlain]: Start of recursive call 77: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:52:17,781 INFO L267 ElimStorePlain]: Start of recursive call 71: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:17,782 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 33 treesize of output 31 [2018-12-08 15:52:17,783 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 31 treesize of output 29 [2018-12-08 15:52:17,784 INFO L267 ElimStorePlain]: Start of recursive call 80: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,785 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:17,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: 3 dim-0 vars, and 5 xjuncts. [2018-12-08 15:52:17,797 INFO L202 ElimStorePlain]: Needed 80 recursive calls to eliminate 8 variables, input treesize:245, output treesize:75 [2018-12-08 15:52:17,997 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-08 15:52:18,005 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-08 15:52:18,006 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-08 15:52:18,014 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-08 15:52:18,015 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-08 15:52:18,023 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-08 15:52:18,024 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-08 15:52:18,031 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-08 15:52:18,161 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-08 15:52:18,171 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-08 15:52:18,171 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-08 15:52:18,181 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-08 15:52:18,182 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-08 15:52:18,191 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-08 15:52:18,310 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 95 treesize of output 79 [2018-12-08 15:52:18,312 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-08 15:52:18,312 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,318 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,319 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 83 treesize of output 67 [2018-12-08 15:52:18,321 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-08 15:52:18,321 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,325 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,327 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 85 treesize of output 69 [2018-12-08 15:52:18,328 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-08 15:52:18,329 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,334 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,400 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-08 15:52:18,410 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-08 15:52:18,411 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-08 15:52:18,418 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-08 15:52:18,418 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-08 15:52:18,426 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-08 15:52:18,485 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,489 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,490 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,493 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,494 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:18,500 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:18,550 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 85 treesize of output 69 [2018-12-08 15:52:18,552 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 23 treesize of output 5 [2018-12-08 15:52:18,552 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,556 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,557 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 85 treesize of output 69 [2018-12-08 15:52:18,559 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 23 treesize of output 5 [2018-12-08 15:52:18,559 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,563 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:18,593 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-08 15:52:18,593 INFO L202 ElimStorePlain]: Needed 37 recursive calls to eliminate 6 variables, input treesize:197, output treesize:289 [2018-12-08 15:52:18,594 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-08 15:52:19,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:19,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:19,363 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-08 15:52:19,370 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-08 15:52:19,385 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:19,387 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:19,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 15:52:19,405 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:106, output treesize:24 [2018-12-08 15:52:19,720 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-08 15:52:19,725 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-08 15:52:19,935 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:52:19,936 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:347) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:264) 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-08 15:52:19,941 INFO L168 Benchmark]: Toolchain (without parser) took 76150.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -132.1 MB). Peak memory consumption was 17.8 MB. Max. memory is 11.5 GB. [2018-12-08 15:52:19,941 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 15:52:19,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 302.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -99.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-08 15:52:19,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.43 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-08 15:52:19,942 INFO L168 Benchmark]: Boogie Preprocessor took 25.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-08 15:52:19,942 INFO L168 Benchmark]: RCFGBuilder took 234.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2018-12-08 15:52:19,943 INFO L168 Benchmark]: TraceAbstraction took 75560.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.3 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-08 15:52:19,944 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 302.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 69.7 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -99.1 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.43 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 25.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 234.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 75560.06 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -66.3 MB). Peak memory consumption was 13.9 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:347) 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-08 15:52:21,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 15:52:21,161 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 15:52:21,167 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 15:52:21,167 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 15:52:21,168 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 15:52:21,169 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 15:52:21,170 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 15:52:21,171 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 15:52:21,172 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 15:52:21,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 15:52:21,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 15:52:21,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 15:52:21,173 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 15:52:21,174 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 15:52:21,174 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 15:52:21,174 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 15:52:21,175 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 15:52:21,177 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 15:52:21,177 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 15:52:21,178 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 15:52:21,179 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 15:52:21,180 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 15:52:21,181 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 15:52:21,181 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 15:52:21,181 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 15:52:21,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 15:52:21,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 15:52:21,182 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 15:52:21,183 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 15:52:21,183 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 15:52:21,184 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 15:52:21,184 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 15:52:21,184 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 15:52:21,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 15:52:21,185 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 15:52:21,185 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-08 15:52:21,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 15:52:21,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 15:52:21,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 15:52:21,195 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 15:52:21,195 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 15:52:21,195 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 15:52:21,195 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 15:52:21,195 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 15:52:21,195 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 15:52:21,196 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 15:52:21,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 15:52:21,197 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 15:52:21,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 15:52:21,198 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 15:52:21,198 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 15:52:21,198 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 15:52:21,198 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-08 15:52:21,198 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 15:52:21,198 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-08 15:52:21,198 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-08 15:52:21,198 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_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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 -> abd6dbc145d5f477746656086724ee83e0738836 [2018-12-08 15:52:21,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 15:52:21,226 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 15:52:21,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 15:52:21,230 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 15:52:21,230 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 15:52:21,231 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 15:52:21,272 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/eaad4d95e/dd3d6d2059e34cbcb08cfdc5ee946b57/FLAG6728ec3cf [2018-12-08 15:52:21,712 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 15:52:21,713 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/sv-benchmarks/c/list-simple/sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 15:52:21,719 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/eaad4d95e/dd3d6d2059e34cbcb08cfdc5ee946b57/FLAG6728ec3cf [2018-12-08 15:52:21,726 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/data/eaad4d95e/dd3d6d2059e34cbcb08cfdc5ee946b57 [2018-12-08 15:52:21,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 15:52:21,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 15:52:21,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 15:52:21,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 15:52:21,731 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 15:52:21,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:52:21" (1/1) ... [2018-12-08 15:52:21,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49da4dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:21, skipping insertion in model container [2018-12-08 15:52:21,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 03:52:21" (1/1) ... [2018-12-08 15:52:21,738 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 15:52:21,757 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 15:52:21,918 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:52:21,926 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 15:52:21,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 15:52:22,015 INFO L195 MainTranslator]: Completed translation [2018-12-08 15:52:22,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22 WrapperNode [2018-12-08 15:52:22,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 15:52:22,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 15:52:22,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 15:52:22,016 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 15:52:22,023 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,037 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 15:52:22,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 15:52:22,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 15:52:22,037 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 15:52:22,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... [2018-12-08 15:52:22,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 15:52:22,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 15:52:22,059 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 15:52:22,059 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 15:52:22,060 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-08 15:52:22,090 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-08 15:52:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 15:52:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-08 15:52:22,090 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-08 15:52:22,090 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 15:52:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 15:52:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_update_at [2018-12-08 15:52:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_update_at [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_destroy [2018-12-08 15:52:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_destroy [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-08 15:52:22,091 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_create [2018-12-08 15:52:22,091 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_create [2018-12-08 15:52:22,092 INFO L130 BoogieDeclarations]: Found specification of procedure sll_circular_get_data_at [2018-12-08 15:52:22,092 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_circular_get_data_at [2018-12-08 15:52:22,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 15:52:22,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 15:52:22,289 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 15:52:22,290 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-12-08 15:52:22,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:52:22 BoogieIcfgContainer [2018-12-08 15:52:22,290 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 15:52:22,291 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 15:52:22,291 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 15:52:22,292 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 15:52:22,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 03:52:21" (1/3) ... [2018-12-08 15:52:22,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce11909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:52:22, skipping insertion in model container [2018-12-08 15:52:22,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 03:52:22" (2/3) ... [2018-12-08 15:52:22,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ce11909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 03:52:22, skipping insertion in model container [2018-12-08 15:52:22,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 03:52:22" (3/3) ... [2018-12-08 15:52:22,294 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_true-unreach-call_true-valid-memsafety.i [2018-12-08 15:52:22,300 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 15:52:22,304 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 15:52:22,313 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 15:52:22,329 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 15:52:22,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 15:52:22,330 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 15:52:22,330 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 15:52:22,330 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 15:52:22,330 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 15:52:22,330 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 15:52:22,330 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 15:52:22,330 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 15:52:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2018-12-08 15:52:22,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-08 15:52:22,343 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:22,343 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] [2018-12-08 15:52:22,344 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:22,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1776900725, now seen corresponding path program 1 times [2018-12-08 15:52:22,350 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:52:22,350 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:22,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:22,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:22,474 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-08 15:52:22,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 15:52:22,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:52:22,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 15:52:22,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 15:52:22,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 15:52:22,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 15:52:22,488 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 5 states. [2018-12-08 15:52:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:22,571 INFO L93 Difference]: Finished difference Result 99 states and 131 transitions. [2018-12-08 15:52:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:52:22,572 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-08 15:52:22,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:22,578 INFO L225 Difference]: With dead ends: 99 [2018-12-08 15:52:22,578 INFO L226 Difference]: Without dead ends: 45 [2018-12-08 15:52:22,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 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-08 15:52:22,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-08 15:52:22,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-08 15:52:22,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-08 15:52:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-12-08 15:52:22,606 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 31 [2018-12-08 15:52:22,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:22,606 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-12-08 15:52:22,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 15:52:22,607 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-12-08 15:52:22,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 15:52:22,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:22,608 INFO L402 BasicCegarLoop]: trace histogram [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] [2018-12-08 15:52:22,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:22,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:22,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1601339917, now seen corresponding path program 1 times [2018-12-08 15:52:22,609 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:52:22,609 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:22,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:22,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:22,710 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:52:22,710 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-08 15:52:22,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 15:52:22,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 15:52:22,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 15:52:22,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 15:52:22,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:52:22,714 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-12-08 15:52:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:22,751 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2018-12-08 15:52:22,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 15:52:22,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-08 15:52:22,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:22,753 INFO L225 Difference]: With dead ends: 64 [2018-12-08 15:52:22,753 INFO L226 Difference]: Without dead ends: 52 [2018-12-08 15:52:22,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 15:52:22,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-08 15:52:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 44. [2018-12-08 15:52:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-08 15:52:22,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2018-12-08 15:52:22,758 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 39 [2018-12-08 15:52:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:22,759 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2018-12-08 15:52:22,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 15:52:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-12-08 15:52:22,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 15:52:22,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:22,760 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:22,760 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:22,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:22,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1095764041, now seen corresponding path program 1 times [2018-12-08 15:52:22,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:52:22,760 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 15:52:22,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:22,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:22,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:52:22,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:52:22,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:22,951 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:22,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:22,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:22,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:23,180 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 13 treesize of output 10 [2018-12-08 15:52:23,184 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 10 treesize of output 9 [2018-12-08 15:52:23,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:23,187 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:23,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:23,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-08 15:52:23,505 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-08 15:52:23,510 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-08 15:52:23,510 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:23,531 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-08 15:52:23,532 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:23,541 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:23,544 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-08 15:52:23,544 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-08 15:52:23,574 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:52:23,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:24,142 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 9 treesize of output 7 [2018-12-08 15:52:24,144 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 7 treesize of output 3 [2018-12-08 15:52:24,144 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:24,146 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:24,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 15:52:24,153 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:10 [2018-12-08 15:52:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 15:52:24,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:52:24,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 20, 12] total 33 [2018-12-08 15:52:24,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-08 15:52:24,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-08 15:52:24,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2018-12-08 15:52:24,267 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand 33 states. [2018-12-08 15:52:28,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:28,148 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-12-08 15:52:28,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-08 15:52:28,149 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2018-12-08 15:52:28,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:28,151 INFO L225 Difference]: With dead ends: 91 [2018-12-08 15:52:28,151 INFO L226 Difference]: Without dead ends: 79 [2018-12-08 15:52:28,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=201, Invalid=1779, Unknown=0, NotChecked=0, Total=1980 [2018-12-08 15:52:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-08 15:52:28,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 47. [2018-12-08 15:52:28,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-08 15:52:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2018-12-08 15:52:28,160 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 47 [2018-12-08 15:52:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:28,160 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2018-12-08 15:52:28,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-08 15:52:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-12-08 15:52:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-08 15:52:28,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:28,161 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:28,162 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:28,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1293558625, now seen corresponding path program 2 times [2018-12-08 15:52:28,162 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:52:28,162 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:28,181 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 15:52:28,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:52:28,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:52:28,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:28,318 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:52:28,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:28,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:52:28,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:28,375 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:28,380 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 15:52:28,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:52:28,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:52:28,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:28,469 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:52:28,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:28,508 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:52:28,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:52:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-08 15:52:28,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:52:28,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:52:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:52:28,524 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 9 states. [2018-12-08 15:52:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:52:28,649 INFO L93 Difference]: Finished difference Result 92 states and 109 transitions. [2018-12-08 15:52:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 15:52:28,650 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2018-12-08 15:52:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:52:28,651 INFO L225 Difference]: With dead ends: 92 [2018-12-08 15:52:28,651 INFO L226 Difference]: Without dead ends: 70 [2018-12-08 15:52:28,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 211 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-08 15:52:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-08 15:52:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 53. [2018-12-08 15:52:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 15:52:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-12-08 15:52:28,656 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 55 [2018-12-08 15:52:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:52:28,656 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-12-08 15:52:28,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:52:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-12-08 15:52:28,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-08 15:52:28,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:52:28,657 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:52:28,657 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:52:28,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:52:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1115647387, now seen corresponding path program 1 times [2018-12-08 15:52:28,658 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:52:28,658 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:28,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:52:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:28,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:28,799 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-08 15:52:28,799 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,800 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 15:52:28,857 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:28,858 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:28,858 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-08 15:52:28,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,863 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,864 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-08 15:52:28,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, 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-08 15:52:28,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, 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-08 15:52:28,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,890 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-08 15:52:28,925 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 28 treesize of output 24 [2018-12-08 15:52:28,928 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 11 [2018-12-08 15:52:28,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,933 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:28,939 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-08 15:52:28,939 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-08 15:52:29,165 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 13 treesize of output 10 [2018-12-08 15:52:29,169 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 10 treesize of output 9 [2018-12-08 15:52:29,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:29,175 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:29,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:29,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-08 15:52:29,323 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 39 treesize of output 35 [2018-12-08 15:52:29,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:29,335 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 32 treesize of output 26 [2018-12-08 15:52:29,336 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:29,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:29,379 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-08 15:52:29,379 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2018-12-08 15:52:31,233 WARN L854 $PredicateComparison]: unable to prove that (exists ((sll_circular_update_at_~data (_ BitVec 32)) (sll_circular_update_at_~head.offset (_ BitVec 32))) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_sll_circular_update_at_#in~head.base|) |c_sll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (bvadd sll_circular_update_at_~head.offset (_ bv4 32)) sll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2018-12-08 15:52:31,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 34 [2018-12-08 15:52:31,249 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 5 treesize of output 1 [2018-12-08 15:52:31,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:31,263 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 24 treesize of output 21 [2018-12-08 15:52:31,263 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-08 15:52:31,275 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:31,308 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 23 treesize of output 24 [2018-12-08 15:52:31,311 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 10 treesize of output 9 [2018-12-08 15:52:31,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:31,321 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:31,339 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:31,339 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:18 [2018-12-08 15:52:33,707 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-08 15:52:33,710 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-08 15:52:33,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:33,723 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-08 15:52:33,723 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:33,729 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:33,732 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-08 15:52:33,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-08 15:52:33,775 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 15:52:33,775 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:36,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:52:36,704 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:52:36,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:52:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:52:36,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:52:36,754 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-08 15:52:36,754 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,755 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 15:52:36,760 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:36,761 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:36,762 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-08 15:52:36,762 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,768 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-08 15:52:36,774 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-08 15:52:36,777 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-08 15:52:36,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-08 15:52:36,795 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 28 treesize of output 24 [2018-12-08 15:52:36,797 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 11 [2018-12-08 15:52:36,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,808 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-08 15:52:36,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-08 15:52:36,822 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 13 treesize of output 10 [2018-12-08 15:52:36,825 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 10 treesize of output 9 [2018-12-08 15:52:36,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,840 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-12-08 15:52:36,860 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 39 treesize of output 35 [2018-12-08 15:52:36,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:36,868 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 32 treesize of output 26 [2018-12-08 15:52:36,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,884 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-08 15:52:36,884 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:37 [2018-12-08 15:52:36,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:52:36,904 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-08 15:52:36,907 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-08 15:52:36,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-12-08 15:52:36,943 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 5 treesize of output 1 [2018-12-08 15:52:36,943 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,952 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-08 15:52:36,953 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:36,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:52:36,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:36,976 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:58, output treesize:18 [2018-12-08 15:52:39,028 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-08 15:52:39,030 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-08 15:52:39,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:39,043 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-08 15:52:39,043 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:52:39,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:52:39,052 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-08 15:52:39,052 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2018-12-08 15:52:39,059 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-08 15:52:39,059 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:52:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:52:41,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-12-08 15:52:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-08 15:52:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-08 15:52:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1232, Unknown=3, NotChecked=70, Total=1406 [2018-12-08 15:52:41,429 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 31 states. [2018-12-08 15:53:10,458 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification that was a NOOP. DAG size: 20 [2018-12-08 15:53:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:53:28,784 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2018-12-08 15:53:28,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-08 15:53:28,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 56 [2018-12-08 15:53:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:53:28,786 INFO L225 Difference]: With dead ends: 116 [2018-12-08 15:53:28,786 INFO L226 Difference]: Without dead ends: 113 [2018-12-08 15:53:28,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 36.8s TimeCoverageRelationStatistics Valid=263, Invalid=2917, Unknown=16, NotChecked=110, Total=3306 [2018-12-08 15:53:28,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-08 15:53:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 91. [2018-12-08 15:53:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 15:53:28,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2018-12-08 15:53:28,800 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 56 [2018-12-08 15:53:28,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:53:28,800 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2018-12-08 15:53:28,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-08 15:53:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2018-12-08 15:53:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 15:53:28,801 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:53:28,801 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:53:28,801 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:53:28,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:53:28,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1824064388, now seen corresponding path program 1 times [2018-12-08 15:53:28,801 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:53:28,801 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:28,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:53:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:53:28,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 15:53:28,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:28,947 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-12-08 15:53:28,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-08 15:53:28,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2018-12-08 15:53:28,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 15:53:28,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 15:53:28,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 15:53:28,950 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 7 states. [2018-12-08 15:53:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:53:28,994 INFO L93 Difference]: Finished difference Result 126 states and 153 transitions. [2018-12-08 15:53:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 15:53:28,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-12-08 15:53:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:53:28,996 INFO L225 Difference]: With dead ends: 126 [2018-12-08 15:53:28,996 INFO L226 Difference]: Without dead ends: 102 [2018-12-08 15:53:28,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 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-08 15:53:28,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-08 15:53:29,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2018-12-08 15:53:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 15:53:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-12-08 15:53:29,012 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 57 [2018-12-08 15:53:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:53:29,013 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-12-08 15:53:29,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 15:53:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-12-08 15:53:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-08 15:53:29,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:53:29,014 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:53:29,014 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:53:29,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:53:29,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1508377569, now seen corresponding path program 2 times [2018-12-08 15:53:29,015 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:53:29,015 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-08 15:53:29,029 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 15:53:29,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:53:29,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:53:29,132 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:53:29,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:29,288 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:53:29,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:53:29,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 15:53:29,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 15:53:29,385 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:53:29,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:53:29,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:53:29,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:29,821 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-12-08 15:53:29,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:53:29,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-08 15:53:29,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 15:53:29,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 15:53:29,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-08 15:53:29,837 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 18 states. [2018-12-08 15:53:30,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:53:30,671 INFO L93 Difference]: Finished difference Result 181 states and 237 transitions. [2018-12-08 15:53:30,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 15:53:30,673 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2018-12-08 15:53:30,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:53:30,674 INFO L225 Difference]: With dead ends: 181 [2018-12-08 15:53:30,674 INFO L226 Difference]: Without dead ends: 147 [2018-12-08 15:53:30,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 209 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-08 15:53:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-08 15:53:30,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 108. [2018-12-08 15:53:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-08 15:53:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 138 transitions. [2018-12-08 15:53:30,688 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 138 transitions. Word has length 57 [2018-12-08 15:53:30,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:53:30,689 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 138 transitions. [2018-12-08 15:53:30,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 15:53:30,689 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 138 transitions. [2018-12-08 15:53:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 15:53:30,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:53:30,690 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:53:30,690 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:53:30,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:53:30,690 INFO L82 PathProgramCache]: Analyzing trace with hash -415933901, now seen corresponding path program 3 times [2018-12-08 15:53:30,691 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:53:30,691 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:30,704 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-08 15:53:30,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 15:53:30,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:53:30,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:30,826 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:53:30,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:53:30,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:53:30,928 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:30,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 15:53:31,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-08 15:53:31,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:53:31,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:53:31,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:31,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-08 15:53:31,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:53:31,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-08 15:53:31,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:53:31,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:53:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:53:31,121 INFO L87 Difference]: Start difference. First operand 108 states and 138 transitions. Second operand 9 states. [2018-12-08 15:53:31,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:53:31,255 INFO L93 Difference]: Finished difference Result 153 states and 194 transitions. [2018-12-08 15:53:31,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 15:53:31,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-12-08 15:53:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:53:31,256 INFO L225 Difference]: With dead ends: 153 [2018-12-08 15:53:31,256 INFO L226 Difference]: Without dead ends: 93 [2018-12-08 15:53:31,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-12-08 15:53:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-08 15:53:31,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-08 15:53:31,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-08 15:53:31,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2018-12-08 15:53:31,269 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 64 [2018-12-08 15:53:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:53:31,269 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2018-12-08 15:53:31,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:53:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2018-12-08 15:53:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 15:53:31,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:53:31,270 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:53:31,270 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:53:31,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:53:31,270 INFO L82 PathProgramCache]: Analyzing trace with hash 555098392, now seen corresponding path program 1 times [2018-12-08 15:53:31,270 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:53:31,270 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:31,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:53:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:53:31,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:53:31,404 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:53:31,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:53:31,458 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:31,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:53:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:53:31,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:53:31,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:31,531 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:53:31,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:53:31,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6, 6] total 9 [2018-12-08 15:53:31,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-08 15:53:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 15:53:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-08 15:53:31,547 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 9 states. [2018-12-08 15:53:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:53:31,677 INFO L93 Difference]: Finished difference Result 142 states and 175 transitions. [2018-12-08 15:53:31,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 15:53:31,678 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2018-12-08 15:53:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:53:31,678 INFO L225 Difference]: With dead ends: 142 [2018-12-08 15:53:31,678 INFO L226 Difference]: Without dead ends: 114 [2018-12-08 15:53:31,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 252 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-08 15:53:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-08 15:53:31,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-12-08 15:53:31,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 15:53:31,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-12-08 15:53:31,692 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 65 [2018-12-08 15:53:31,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:53:31,692 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-12-08 15:53:31,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-08 15:53:31,692 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-12-08 15:53:31,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-08 15:53:31,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:53:31,693 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-12-08 15:53:31,693 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:53:31,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:53:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1599595657, now seen corresponding path program 4 times [2018-12-08 15:53:31,694 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:53:31,694 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:31,707 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:53:31,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:53:31,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:53:31,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-08 15:53:31,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2018-12-08 15:53:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:53:31,892 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:31,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-08 15:53:31,924 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-08 15:53:31,924 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:53:31,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-12-08 15:53:32,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-08 15:53:32,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:53:32,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 11, 9] total 22 [2018-12-08 15:53:32,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-08 15:53:32,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-08 15:53:32,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2018-12-08 15:53:32,286 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 22 states. [2018-12-08 15:53:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:53:32,533 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2018-12-08 15:53:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 15:53:32,534 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 65 [2018-12-08 15:53:32,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:53:32,534 INFO L225 Difference]: With dead ends: 123 [2018-12-08 15:53:32,534 INFO L226 Difference]: Without dead ends: 62 [2018-12-08 15:53:32,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 236 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-12-08 15:53:32,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-08 15:53:32,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-08 15:53:32,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-08 15:53:32,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-08 15:53:32,540 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 65 [2018-12-08 15:53:32,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:53:32,540 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-08 15:53:32,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-08 15:53:32,540 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-08 15:53:32,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-08 15:53:32,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:53:32,541 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 15:53:32,541 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:53:32,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:53:32,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1626914727, now seen corresponding path program 1 times [2018-12-08 15:53:32,541 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:53:32,541 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:32,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 15:53:32,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:53:32,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:32,705 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-08 15:53:32,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,707 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,707 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-08 15:53:32,757 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:32,758 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:32,759 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-08 15:53:32,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,764 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-08 15:53:32,785 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-08 15:53:32,787 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-08 15:53:32,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,789 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-08 15:53:32,823 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 28 treesize of output 24 [2018-12-08 15:53:32,825 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 11 [2018-12-08 15:53:32,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,830 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:32,835 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-08 15:53:32,835 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:23 [2018-12-08 15:53:33,002 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 19 treesize of output 16 [2018-12-08 15:53:33,004 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 16 treesize of output 1 [2018-12-08 15:53:33,005 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,006 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:19 [2018-12-08 15:53:33,072 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 39 treesize of output 35 [2018-12-08 15:53:33,075 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:33,077 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 32 treesize of output 26 [2018-12-08 15:53:33,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,083 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,093 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-08 15:53:33,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:31 [2018-12-08 15:53:33,348 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 25 treesize of output 18 [2018-12-08 15:53:33,354 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 18 treesize of output 17 [2018-12-08 15:53:33,354 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,362 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,387 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,387 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2018-12-08 15:53:33,528 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:33,547 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 100 treesize of output 101 [2018-12-08 15:53:33,552 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 32 treesize of output 1 [2018-12-08 15:53:33,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:33,607 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:53:33,624 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 89 [2018-12-08 15:53:33,645 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 53 [2018-12-08 15:53:33,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-08 15:53:33,665 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:53:33,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:53:33,698 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:88 [2018-12-08 15:53:34,677 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 54 treesize of output 52 [2018-12-08 15:53:34,681 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 48 treesize of output 35 [2018-12-08 15:53:34,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:34,721 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 36 treesize of output 9 [2018-12-08 15:53:34,721 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:34,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:34,757 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-08 15:53:34,759 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-08 15:53:34,759 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:34,773 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 13 treesize of output 9 [2018-12-08 15:53:34,773 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:34,774 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:34,777 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-08 15:53:34,777 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:75, output treesize:11 [2018-12-08 15:53:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 15:53:34,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:36,158 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-08 15:53:36,281 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-08 15:53:36,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 19 treesize of output 13 [2018-12-08 15:53:36,375 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-08 15:53:36,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,426 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,435 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,436 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-08 15:53:36,442 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-08 15:53:36,476 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,480 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,481 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-08 15:53:36,485 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-08 15:53:36,485 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,487 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,509 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-08 15:53:36,510 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:122, output treesize:72 [2018-12-08 15:53:36,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:53:36,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:53:36,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 15:53:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 15:53:36,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:53:36,727 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-08 15:53:36,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:36,730 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-08 15:53:37,051 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:37,053 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:37,054 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-08 15:53:37,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:11 [2018-12-08 15:53:37,189 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-08 15:53:37,191 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-08 15:53:37,191 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,193 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2018-12-08 15:53:37,298 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-08 15:53:37,300 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-08 15:53:37,300 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:37,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:37,313 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2018-12-08 15:53:38,007 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 34 treesize of output 33 [2018-12-08 15:53:38,011 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:38,013 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-12-08 15:53:38,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:38,020 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:38,031 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:38,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2018-12-08 15:53:38,634 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 25 treesize of output 18 [2018-12-08 15:53:38,640 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 18 treesize of output 17 [2018-12-08 15:53:38,640 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:38,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:38,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:38,687 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:107, output treesize:99 [2018-12-08 15:53:39,036 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 101 [2018-12-08 15:53:39,041 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 101 treesize of output 69 [2018-12-08 15:53:39,041 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:39,105 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:39,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 112 [2018-12-08 15:53:39,210 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 88 treesize of output 56 [2018-12-08 15:53:39,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:39,475 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 57 [2018-12-08 15:53:39,476 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-12-08 15:53:39,551 INFO L267 ElimStorePlain]: Start of recursive call 4: 4 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 15:53:39,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 15:53:39,586 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:135, output treesize:94 [2018-12-08 15:53:41,216 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2018-12-08 15:53:43,050 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-12-08 15:53:44,053 WARN L180 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 61 [2018-12-08 15:53:46,283 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,284 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,297 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,298 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:46,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 139 [2018-12-08 15:53:46,358 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 114 [2018-12-08 15:53:46,359 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-08 15:53:46,620 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 104 treesize of output 85 [2018-12-08 15:53:46,620 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:46,785 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 77 treesize of output 58 [2018-12-08 15:53:46,786 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:46,939 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:53:46,939 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 75 treesize of output 71 [2018-12-08 15:53:46,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,098 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 56 treesize of output 47 [2018-12-08 15:53:47,098 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,229 INFO L267 ElimStorePlain]: Start of recursive call 2: 12 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,262 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 15 treesize of output 19 [2018-12-08 15:53:47,263 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,287 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 33 treesize of output 33 [2018-12-08 15:53:47,291 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 29 treesize of output 25 [2018-12-08 15:53:47,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,304 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 13 treesize of output 9 [2018-12-08 15:53:47,304 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,305 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:47,308 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-08 15:53:47,308 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:109, output treesize:15 [2018-12-08 15:53:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 5 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 15:53:47,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:53:51,574 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-12-08 15:53:51,843 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-12-08 15:53:52,005 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-12-08 15:53:52,188 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-12-08 15:53:52,193 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 42 treesize of output 40 [2018-12-08 15:53:52,199 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 8 treesize of output 1 [2018-12-08 15:53:52,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,220 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 40 treesize of output 34 [2018-12-08 15:53:52,226 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-08 15:53:52,226 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,250 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,256 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:53:52,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-08 15:53:52,270 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 8 treesize of output 1 [2018-12-08 15:53:52,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,305 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-08 15:53:52,305 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,314 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,321 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 42 treesize of output 40 [2018-12-08 15:53:52,327 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 8 treesize of output 1 [2018-12-08 15:53:52,328 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,353 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,381 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 37 treesize of output 41 [2018-12-08 15:53:52,390 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 36 treesize of output 28 [2018-12-08 15:53:52,390 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,466 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 28 treesize of output 20 [2018-12-08 15:53:52,466 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,558 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 1 case distinctions, treesize of input 29 treesize of output 29 [2018-12-08 15:53:52,559 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-12-08 15:53:52,577 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,687 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,692 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,692 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,698 INFO L267 ElimStorePlain]: Start of recursive call 17: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,699 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,706 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,773 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,778 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,778 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,783 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,784 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,787 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,842 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 13 treesize of output 11 [2018-12-08 15:53:52,845 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-08 15:53:52,845 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,848 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,851 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 41 treesize of output 37 [2018-12-08 15:53:52,856 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 29 treesize of output 25 [2018-12-08 15:53:52,856 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,866 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,869 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 38 treesize of output 34 [2018-12-08 15:53:52,872 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 29 treesize of output 25 [2018-12-08 15:53:52,873 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,885 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 15:53:52,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:52,892 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:53:52,892 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 38 treesize of output 46 [2018-12-08 15:53:52,898 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:52,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-12-08 15:53:52,899 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,920 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-08 15:53:52,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:52,925 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-08 15:53:52,925 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,932 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,945 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,947 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 15:53:52,947 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,949 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-08 15:53:52,949 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:52,955 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 15:53:52,956 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 41 treesize of output 49 [2018-12-08 15:53:52,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:52,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-12-08 15:53:52,973 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:52,991 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-08 15:53:52,995 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 15:53:52,996 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-12-08 15:53:52,996 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-12-08 15:53:53,004 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:53,013 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 15:53:53,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 15:53:53,084 INFO L202 ElimStorePlain]: Needed 42 recursive calls to eliminate 4 variables, input treesize:162, output treesize:68 [2018-12-08 15:53:53,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 15:53:53,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 39] total 64 [2018-12-08 15:53:53,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-08 15:53:53,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-08 15:53:53,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=415, Invalid=6865, Unknown=30, NotChecked=0, Total=7310 [2018-12-08 15:53:53,464 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 64 states. [2018-12-08 15:54:02,112 WARN L180 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 71 [2018-12-08 15:54:02,981 WARN L180 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-12-08 15:54:03,498 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-12-08 15:54:05,283 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2018-12-08 15:54:06,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:54:06,176 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-12-08 15:54:06,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-08 15:54:06,177 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 66 [2018-12-08 15:54:06,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:54:06,178 INFO L225 Difference]: With dead ends: 72 [2018-12-08 15:54:06,178 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 15:54:06,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3692 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=875, Invalid=12900, Unknown=31, NotChecked=0, Total=13806 [2018-12-08 15:54:06,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 15:54:06,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 15:54:06,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 15:54:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-12-08 15:54:06,188 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 66 [2018-12-08 15:54:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:54:06,188 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-12-08 15:54:06,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-08 15:54:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-12-08 15:54:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 15:54:06,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 15:54:06,189 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, 1, 1, 1, 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-08 15:54:06,189 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 15:54:06,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 15:54:06,189 INFO L82 PathProgramCache]: Analyzing trace with hash 493482744, now seen corresponding path program 2 times [2018-12-08 15:54:06,190 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-08 15:54:06,190 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:54:06,203 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-08 15:54:06,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:54:06,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:54:06,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:54:06,358 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:54:06,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:54:06,479 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:54:06,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 15:54:06,482 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_202be6bc-6f9b-47e8-8e89-cf99152c78f1/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-08 15:54:06,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-08 15:54:06,582 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-08 15:54:06,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 15:54:06,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 15:54:06,647 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:54:06,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-08 15:54:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-12-08 15:54:07,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-08 15:54:07,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 8, 8] total 18 [2018-12-08 15:54:07,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-08 15:54:07,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-08 15:54:07,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-12-08 15:54:07,048 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 18 states. [2018-12-08 15:54:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 15:54:07,622 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-08 15:54:07,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-08 15:54:07,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2018-12-08 15:54:07,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 15:54:07,622 INFO L225 Difference]: With dead ends: 67 [2018-12-08 15:54:07,622 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 15:54:07,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2018-12-08 15:54:07,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 15:54:07,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 15:54:07,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 15:54:07,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 15:54:07,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2018-12-08 15:54:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 15:54:07,623 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 15:54:07,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-08 15:54:07,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 15:54:07,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 15:54:07,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 15:54:08,787 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 117 [2018-12-08 15:54:09,088 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2018-12-08 15:54:09,221 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-12-08 15:54:09,574 WARN L180 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 46 [2018-12-08 15:54:09,803 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2018-12-08 15:54:09,825 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 15:54:09,826 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-12-08 15:54:09,826 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 15:54:09,826 INFO L451 ceAbstractionStarter]: At program point L561(line 561) the Hoare annotation is: true [2018-12-08 15:54:09,826 INFO L451 ceAbstractionStarter]: At program point myexitENTRY(lines 560 562) the Hoare annotation is: true [2018-12-08 15:54:09,826 INFO L448 ceAbstractionStarter]: For program point myexitFINAL(lines 560 562) no Hoare annotation was computed. [2018-12-08 15:54:09,826 INFO L448 ceAbstractionStarter]: For program point myexitEXIT(lines 560 562) no Hoare annotation was computed. [2018-12-08 15:54:09,826 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atEXIT(lines 595 601) no Hoare annotation was computed. [2018-12-08 15:54:09,826 INFO L451 ceAbstractionStarter]: At program point sll_circular_get_data_atENTRY(lines 595 601) the Hoare annotation is: true [2018-12-08 15:54:09,827 INFO L444 ceAbstractionStarter]: At program point L596-2(lines 596 599) the Hoare annotation is: (let ((.cse0 (= sll_circular_get_data_at_~index |sll_circular_get_data_at_#in~index|)) (.cse1 (= |sll_circular_get_data_at_#in~head.base| sll_circular_get_data_at_~head.base)) (.cse2 (= sll_circular_get_data_at_~head.offset |sll_circular_get_data_at_#in~head.offset|))) (and (or (and .cse0 .cse1 .cse2) (forall ((v_main_~s~0.base_BEFORE_CALL_21 (_ BitVec 32))) (let ((.cse3 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_21) (_ bv0 32))) (.cse4 (select (select |#memory_int| v_main_~s~0.base_BEFORE_CALL_21) (_ bv4 32)))) (or (not (= (_ bv0 32) .cse3)) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_21) (_ bv0 32))) (bvadd .cse3 (_ bv4 32))) (_ bv4294967295 32)) (bvneg (bvneg .cse4)))) (not (= (bvadd .cse4 (_ bv4294967294 32)) (_ bv0 32)))))) (bvsgt (bvadd |sll_circular_get_data_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) (and (= (select (select |#memory_$Pointer$.base| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|) sll_circular_get_data_at_~head.base) (= sll_circular_get_data_at_~head.offset (select (select |#memory_$Pointer$.offset| |sll_circular_get_data_at_#in~head.base|) |sll_circular_get_data_at_#in~head.offset|)) (= (bvadd sll_circular_get_data_at_~index (_ bv1 32)) |sll_circular_get_data_at_#in~index|))) (or (and .cse0 (and .cse1 .cse2)) (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) (_ bv4 32))))) (forall ((v_main_~s~0.base_BEFORE_CALL_14 (_ BitVec 32))) (let ((.cse5 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_14) (_ bv0 32)))) (or (= v_main_~s~0.base_BEFORE_CALL_14 .cse5) (not (= (_ bv3 32) (select (select |#memory_int| .cse5) (bvadd (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_14) (_ bv0 32)) (_ bv4 32)))))))) (and (forall ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32)) (v_prenex_6 (_ BitVec 32))) (let ((.cse6 (select (select |#memory_$Pointer$.offset| v_prenex_6) (_ bv0 32)))) (or (not (= .cse6 (_ bv0 32))) (not (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset))) (not (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| v_prenex_6) (_ bv0 32))) (bvadd .cse6 (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))) (= sll_circular_create_~last~0.base v_prenex_6)))) (forall ((v_main_~s~0.base_BEFORE_CALL_20 (_ BitVec 32))) (let ((.cse7 (select (select |#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_20) (_ bv0 32))) (.cse8 (select (select |#memory_$Pointer$.offset| v_main_~s~0.base_BEFORE_CALL_20) (_ bv0 32)))) (or (= v_main_~s~0.base_BEFORE_CALL_20 .cse7) (not (= (_ bv0 32) .cse8)) (not (= (bvadd (select (select |#memory_int| .cse7) (bvadd .cse8 (_ bv4 32))) (_ bv4294967293 32)) (_ bv0 32))))))) (bvsgt |sll_circular_get_data_at_#in~index| (_ bv0 32))))) [2018-12-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point L596-3(lines 596 599) no Hoare annotation was computed. [2018-12-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point sll_circular_get_data_atFINAL(lines 595 601) no Hoare annotation was computed. [2018-12-08 15:54:09,827 INFO L444 ceAbstractionStarter]: At program point L576(line 576) the Hoare annotation is: (or (bvsgt (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32)) (_ bv1 32)) (and (= sll_circular_create_~head~0.offset (_ bv0 32)) (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base) (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1)))) [2018-12-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point L576-1(line 576) no Hoare annotation was computed. [2018-12-08 15:54:09,827 INFO L444 ceAbstractionStarter]: At program point L573(line 573) 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|) (= |sll_circular_create_#in~len| sll_circular_create_~len)) [2018-12-08 15:54:09,827 INFO L444 ceAbstractionStarter]: At program point L575-2(lines 575 580) the Hoare annotation is: (let ((.cse1 (bvadd |sll_circular_create_#in~len| (_ bv4294967295 32))) (.cse0 (= sll_circular_create_~head~0.offset (_ bv0 32))) (.cse2 (= sll_circular_create_~head~0.base sll_circular_create_~last~0.base))) (or (and (= (select (select |#memory_$Pointer$.base| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset) sll_circular_create_~last~0.base) .cse0 (= .cse1 sll_circular_create_~len) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| sll_circular_create_~head~0.base) sll_circular_create_~head~0.offset)) (not .cse2)) (and (bvsgt .cse1 (_ bv1 32)) .cse0) (and .cse0 .cse2 (= |sll_circular_create_#in~len| sll_circular_create_~len) (= (bvadd (select |#valid| sll_circular_create_~head~0.base) (_ bv1 1)) (_ bv0 1))))) [2018-12-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point L573-1(line 573) no Hoare annotation was computed. [2018-12-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point L575-3(lines 575 580) no Hoare annotation was computed. [2018-12-08 15:54:09,827 INFO L444 ceAbstractionStarter]: At program point sll_circular_createENTRY(lines 572 583) 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-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point sll_circular_createFINAL(lines 572 583) no Hoare annotation was computed. [2018-12-08 15:54:09,827 INFO L448 ceAbstractionStarter]: For program point sll_circular_createEXIT(lines 572 583) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 15:54:09,828 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 609 628) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point L624(line 624) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 609 628) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L444 ceAbstractionStarter]: At program point L620(line 620) the Hoare annotation is: (let ((.cse6 (select |#memory_$Pointer$.offset| main_~s~0.base))) (let ((.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse0 (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select .cse6 main_~s~0.offset) (_ bv4 32))) (_ bv4294967295 32))) (.cse2 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) (.cse4 (= (select .cse6 (_ bv0 32)) (_ bv0 32))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and (= .cse0 (bvneg (bvneg main_~len~0))) .cse1 (= .cse2 main_~expected~0) (= main_~i~0 (_ bv0 32)) .cse3 .cse4 (= (bvadd main_~len~0 main_~i~0) main_~expected~0)) (let ((.cse5 (bvneg main_~i~0))) (and (= (_ bv1 32) (bvadd .cse5 .cse2)) .cse1 (= .cse0 (bvneg (bvneg (bvadd .cse2 .cse5 (_ bv1 32))))) (= (bvadd main_~expected~0 (_ bv4294967295 32)) (bvadd .cse5 .cse2 main_~i~0)) .cse4 .cse3 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))))))) [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point L620-1(lines 620 622) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L444 ceAbstractionStarter]: At program point L616(line 616) the Hoare annotation is: (let ((.cse0 (= main_~s~0.offset (_ bv0 32))) (.cse1 (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base main_~s~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset) (_ bv0 32))))) (.cse2 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (.cse3 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse4 (= (select (select |#memory_$Pointer$.offset| main_~s~0.base) (_ bv0 32)) (_ bv0 32))) (.cse5 (not (= (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32)) main_~s~0.base)))) (or (and (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32)))) .cse0 .cse1 .cse2 .cse3 .cse4 (= (bvadd (bvneg main_~len~0) main_~new_data~0 (_ bv4294967295 32)) (_ bv0 32)) .cse5 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= main_~len~0 main_~new_data~0) .cse0 .cse1 .cse2 (= main_~i~0 (_ bv0 32)) .cse3 .cse4 .cse5))) [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point L618-2(lines 618 623) no Hoare annotation was computed. [2018-12-08 15:54:09,828 INFO L448 ceAbstractionStarter]: For program point L616-1(lines 614 617) no Hoare annotation was computed. [2018-12-08 15:54:09,829 INFO L444 ceAbstractionStarter]: At program point L618-3(lines 618 623) the Hoare annotation is: (let ((.cse8 (bvsgt main_~i~0 (_ bv0 32))) (.cse6 (= main_~i~0 (_ bv0 32)))) (let ((.cse7 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse3 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))))) (.cse4 (let ((.cse9 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)))) (or (and .cse8 .cse9) (and .cse9 .cse6)))) (.cse5 (= main_~s~0.offset (_ bv0 32)))) (let ((.cse0 (and .cse8 (and .cse3 .cse4 .cse5))) (.cse1 (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~s~0.base) main_~s~0.offset)) (bvadd (select .cse7 main_~s~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (bvneg (bvneg main_~len~0)))) (.cse2 (= (select .cse7 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= (_ bv2 32) main_~i~0)) (and .cse1 .cse0 .cse2 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse3 .cse4 .cse5 .cse6 .cse2))))) [2018-12-08 15:54:09,829 INFO L444 ceAbstractionStarter]: At program point L618-4(lines 618 623) the Hoare annotation is: (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32)) [2018-12-08 15:54:09,829 INFO L444 ceAbstractionStarter]: At program point L612(line 612) 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-08 15:54:09,829 INFO L444 ceAbstractionStarter]: At program point L614-2(lines 614 617) the Hoare annotation is: (let ((.cse8 (select |#memory_$Pointer$.offset| main_~s~0.base)) (.cse7 (select |#memory_$Pointer$.base| main_~s~0.base))) (let ((.cse2 (exists ((sll_circular_create_~last~0.base (_ BitVec 32)) (sll_circular_create_~last~0.offset (_ BitVec 32))) (and (not (= sll_circular_create_~last~0.base main_~s~0.base)) (= (select (select |#memory_$Pointer$.offset| sll_circular_create_~last~0.base) sll_circular_create_~last~0.offset) (_ bv0 32))))) (.cse3 (exists ((sll_circular_create_~last~0.offset (_ BitVec 32))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~s~0.base) (_ bv0 32))) sll_circular_create_~last~0.offset) main_~s~0.base))) (.cse6 (not (= (select .cse7 (_ bv0 32)) main_~s~0.base))) (.cse0 (= main_~len~0 (select (select |#memory_int| main_~s~0.base) (bvadd main_~s~0.offset (_ bv4 32))))) (.cse1 (= main_~s~0.offset (_ bv0 32))) (.cse4 (= (bvadd main_~len~0 (_ bv4294967294 32)) (_ bv0 32))) (.cse5 (= (select .cse8 (_ bv0 32)) (_ bv0 32)))) (or (and .cse0 (= main_~len~0 main_~new_data~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and .cse1 .cse2 .cse3 (= main_~i~0 (_ bv0 32)) .cse4 .cse5 .cse6) (and (= (bvadd (select (select |#memory_int| (select .cse7 main_~s~0.offset)) (bvadd (select .cse8 main_~s~0.offset) (_ bv4 32))) (_ bv4294967295 32)) (bvneg (bvneg main_~len~0))) .cse0 .cse1 .cse4 .cse5 (= (_ bv2 32) main_~i~0))))) [2018-12-08 15:54:09,829 INFO L448 ceAbstractionStarter]: For program point L612-1(line 612) no Hoare annotation was computed. [2018-12-08 15:54:09,829 INFO L448 ceAbstractionStarter]: For program point L614-3(lines 614 617) no Hoare annotation was computed. [2018-12-08 15:54:09,829 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 609 628) 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-08 15:54:09,829 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 626) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L444 ceAbstractionStarter]: At program point L621(lines 609 628) the Hoare annotation is: false [2018-12-08 15:54:09,830 INFO L451 ceAbstractionStarter]: At program point sll_circular_destroyENTRY(lines 584 594) the Hoare annotation is: true [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point sll_circular_destroyEXIT(lines 584 594) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point L585(lines 585 593) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L451 ceAbstractionStarter]: At program point L587-2(lines 587 591) the Hoare annotation is: true [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point L587-3(lines 587 591) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point L585-2(lines 584 594) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atEXIT(lines 602 608) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L444 ceAbstractionStarter]: At program point sll_circular_update_atENTRY(lines 602 608) 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 .cse0 (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) (_ bv4 32))))) (bvsgt (bvadd |sll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32))) (or (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32)) .cse0))) [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point sll_circular_update_atFINAL(lines 602 608) no Hoare annotation was computed. [2018-12-08 15:54:09,830 INFO L444 ceAbstractionStarter]: At program point L603-2(lines 603 606) the Hoare annotation is: (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse3 (= |sll_circular_update_at_#in~data| sll_circular_update_at_~data)) (.cse4 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (let ((.cse0 (and (= |sll_circular_update_at_#in~head.base| sll_circular_update_at_~head.base) (= sll_circular_update_at_~head.offset |sll_circular_update_at_#in~head.offset|) (= sll_circular_update_at_~index |sll_circular_update_at_#in~index|) .cse1 .cse2 .cse3 .cse4))) (and (or .cse0 (bvsgt |sll_circular_update_at_#in~index| (_ bv0 32))) (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) (_ bv4 32))))) (bvsgt (bvadd |sll_circular_update_at_#in~index| (_ bv4294967295 32)) (_ bv0 32)) .cse0 (and (= (bvadd sll_circular_update_at_~index (_ bv1 32)) |sll_circular_update_at_#in~index|) .cse1 (= (select (select |#memory_$Pointer$.offset| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.offset) .cse2 .cse3 .cse4 (= (select (select |#memory_$Pointer$.base| |sll_circular_update_at_#in~head.base|) |sll_circular_update_at_#in~head.offset|) sll_circular_update_at_~head.base)))))) [2018-12-08 15:54:09,830 INFO L448 ceAbstractionStarter]: For program point L603-3(lines 603 606) no Hoare annotation was computed. [2018-12-08 15:54:09,830 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-08 15:54:09,831 INFO L448 ceAbstractionStarter]: For program point node_createFINAL(lines 563 571) no Hoare annotation was computed. [2018-12-08 15:54:09,831 INFO L451 ceAbstractionStarter]: At program point L566(line 566) the Hoare annotation is: true [2018-12-08 15:54:09,831 INFO L448 ceAbstractionStarter]: For program point node_createEXIT(lines 563 571) no Hoare annotation was computed. [2018-12-08 15:54:09,831 INFO L448 ceAbstractionStarter]: For program point L565(lines 565 567) no Hoare annotation was computed. [2018-12-08 15:54:09,831 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 565 567) no Hoare annotation was computed. [2018-12-08 15:54:09,837 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 15:54:09,838 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 15:54:09,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,840 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,842 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 15:54:09,842 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 15:54:09,842 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,843 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,845 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-08 15:54:09,847 INFO L168 Benchmark]: Toolchain (without parser) took 108118.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 220.7 MB). Free memory was 938.0 MB in the beginning and 806.5 MB in the end (delta: 131.5 MB). Peak memory consumption was 352.2 MB. Max. memory is 11.5 GB. [2018-12-08 15:54:09,847 INFO L168 Benchmark]: CDTParser took 0.17 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-08 15:54:09,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. [2018-12-08 15:54:09,848 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.80 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-08 15:54:09,848 INFO L168 Benchmark]: Boogie Preprocessor took 21.91 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-08 15:54:09,848 INFO L168 Benchmark]: RCFGBuilder took 231.17 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. [2018-12-08 15:54:09,848 INFO L168 Benchmark]: TraceAbstraction took 107555.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 806.5 MB in the end (delta: 276.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 11.5 GB. [2018-12-08 15:54:09,850 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.17 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 286.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -189.8 MB). Peak memory consumption was 39.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.80 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 231.17 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: 38.5 MB). Peak memory consumption was 38.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 107555.44 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 86.0 MB). Free memory was 1.1 GB in the beginning and 806.5 MB in the end (delta: 276.1 MB). Peak memory consumption was 362.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 626]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 575]: Loop Invariant [2018-12-08 15:54:09,852 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 15:54:09,853 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 15:54:09,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,853 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2018-12-08 15:54:09,854 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2018-12-08 15:54:09,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2018-12-08 15:54:09,854 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((#memory_$Pointer$[head][head] == last && head == 0bv32) && ~bvadd64(\old(len), 4294967295bv32) == len) && 0bv32 == #memory_$Pointer$[head][head]) && !(head == last)) || (~bvsgt32(~bvadd64(\old(len), 4294967295bv32), 1bv32) && head == 0bv32)) || (((head == 0bv32 && head == last) && \old(len) == len) && ~bvadd64(\valid[head], 1bv1) == 0bv1) - 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...