./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2n_remove_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_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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 a3189d7d4e71631c5441bd903e5049703e07b8be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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 a3189d7d4e71631c5441bd903e5049703e07b8be ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: We have to descend beyond store chains. Introduce auxiliary variables only for arrays of lower dimension to avoid non-termination. --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:27:15,199 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:27:15,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:27:15,206 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:27:15,206 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:27:15,207 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:27:15,207 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:27:15,208 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:27:15,209 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:27:15,210 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:27:15,210 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:27:15,210 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:27:15,211 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:27:15,211 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:27:15,212 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:27:15,212 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:27:15,213 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:27:15,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:27:15,214 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:27:15,215 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:27:15,216 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:27:15,216 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:27:15,218 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:27:15,218 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:27:15,218 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:27:15,218 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:27:15,219 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:27:15,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:27:15,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:27:15,220 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:27:15,220 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:27:15,221 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:27:15,221 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:27:15,221 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:27:15,222 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:27:15,222 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:27:15,222 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 09:27:15,229 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:27:15,229 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:27:15,230 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:27:15,230 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:27:15,230 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:27:15,230 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:27:15,230 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:27:15,230 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 09:27:15,230 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:27:15,231 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:27:15,231 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:27:15,232 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:27:15,232 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:27:15,233 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:27:15,233 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:27:15,233 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:27:15,233 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 09:27:15,233 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:27:15,233 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 09:27:15,233 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 09:27:15,233 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_eb8171ff-2337-496c-bbea-1916bd42f903/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 -> a3189d7d4e71631c5441bd903e5049703e07b8be [2018-12-02 09:27:15,251 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:27:15,257 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:27:15,259 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:27:15,260 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:27:15,260 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:27:15,261 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 09:27:15,296 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/d8c8fef41/be208829d6d94dffb7190a367054aa77/FLAGc1f8a9d51 [2018-12-02 09:27:15,707 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:27:15,707 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 09:27:15,714 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/d8c8fef41/be208829d6d94dffb7190a367054aa77/FLAGc1f8a9d51 [2018-12-02 09:27:15,722 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/d8c8fef41/be208829d6d94dffb7190a367054aa77 [2018-12-02 09:27:15,723 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:27:15,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:27:15,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:27:15,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:27:15,727 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:27:15,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:15,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15b06587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15, skipping insertion in model container [2018-12-02 09:27:15,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:15,733 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:27:15,751 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:27:15,897 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:27:15,940 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:27:15,963 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:27:15,984 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:27:15,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15 WrapperNode [2018-12-02 09:27:15,985 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:27:15,985 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:27:15,985 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:27:15,985 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:27:15,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:15,998 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,002 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:27:16,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:27:16,003 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:27:16,003 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:27:16,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... [2018-12-02 09:27:16,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:27:16,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:27:16,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:27:16,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:27:16,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:27:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 09:27:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 09:27:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:27:16,050 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 09:27:16,050 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 09:27:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:27:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:27:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2018-12-02 09:27:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2018-12-02 09:27:16,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:27:16,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:27:16,198 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:27:16,199 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 09:27:16,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:27:16 BoogieIcfgContainer [2018-12-02 09:27:16,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:27:16,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:27:16,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:27:16,201 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:27:16,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:27:15" (1/3) ... [2018-12-02 09:27:16,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2a4708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:27:16, skipping insertion in model container [2018-12-02 09:27:16,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:27:15" (2/3) ... [2018-12-02 09:27:16,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2a4708 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:27:16, skipping insertion in model container [2018-12-02 09:27:16,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:27:16" (3/3) ... [2018-12-02 09:27:16,203 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 09:27:16,208 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:27:16,212 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:27:16,221 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:27:16,238 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:27:16,238 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:27:16,238 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:27:16,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:27:16,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:27:16,238 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:27:16,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:27:16,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:27:16,248 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-02 09:27:16,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 09:27:16,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:16,252 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:16,253 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:16,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1372320445, now seen corresponding path program 1 times [2018-12-02 09:27:16,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:16,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:16,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:16,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:16,359 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-02 09:27:16,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:27:16,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 09:27:16,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:27:16,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 09:27:16,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 09:27:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 09:27:16,373 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2018-12-02 09:27:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:16,408 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-12-02 09:27:16,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 09:27:16,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-02 09:27:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:16,414 INFO L225 Difference]: With dead ends: 59 [2018-12-02 09:27:16,414 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 09:27:16,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:27:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 09:27:16,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-12-02 09:27:16,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 09:27:16,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-02 09:27:16,441 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 17 [2018-12-02 09:27:16,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:16,441 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-02 09:27:16,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 09:27:16,442 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-02 09:27:16,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-02 09:27:16,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:16,442 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] [2018-12-02 09:27:16,442 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:16,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:16,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1863972896, now seen corresponding path program 1 times [2018-12-02 09:27:16,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:16,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:16,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:16,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:27:16,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:27:16,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:27:16,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 09:27:16,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:27:16,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:27:16,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:27:16,503 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 5 states. [2018-12-02 09:27:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:16,533 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-12-02 09:27:16,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:27:16,533 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-12-02 09:27:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:16,534 INFO L225 Difference]: With dead ends: 51 [2018-12-02 09:27:16,534 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 09:27:16,535 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-02 09:27:16,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 09:27:16,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-12-02 09:27:16,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 09:27:16,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-02 09:27:16,540 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2018-12-02 09:27:16,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:16,540 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-02 09:27:16,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:27:16,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-02 09:27:16,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 09:27:16,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:16,541 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-02 09:27:16,542 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:16,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:16,542 INFO L82 PathProgramCache]: Analyzing trace with hash 929796551, now seen corresponding path program 1 times [2018-12-02 09:27:16,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:16,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:16,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:16,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:16,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:16,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:27:16,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:16,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:16,589 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-12-02 09:27:16,590 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [13], [17], [20], [23], [26], [27], [33], [39], [41], [43], [45], [49], [50], [54], [55], [56], [62], [64], [65], [66], [67], [68], [69], [70], [71], [72], [73], [74] [2018-12-02 09:27:16,612 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 09:27:16,613 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 09:27:16,791 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 09:27:16,791 INFO L272 AbstractInterpreter]: Visited 32 different actions 92 times. Merged at 10 different actions 28 times. Widened at 1 different actions 1 times. Performed 719 root evaluator evaluations with a maximum evaluation depth of 3. Performed 719 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 4 fixpoints after 3 different actions. Largest state had 27 variables. [2018-12-02 09:27:16,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:16,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 09:27:16,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:16,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:27:16,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:16,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 09:27:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:16,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:27:16,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:16,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:27:16,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 09:27:16,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 10 [2018-12-02 09:27:16,975 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 09:27:16,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 09:27:16,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 09:27:16,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:27:16,975 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 8 states. [2018-12-02 09:27:17,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:27:17,027 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-12-02 09:27:17,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:27:17,028 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-12-02 09:27:17,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:27:17,028 INFO L225 Difference]: With dead ends: 58 [2018-12-02 09:27:17,028 INFO L226 Difference]: Without dead ends: 43 [2018-12-02 09:27:17,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:27:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-02 09:27:17,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-12-02 09:27:17,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-02 09:27:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2018-12-02 09:27:17,033 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2018-12-02 09:27:17,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:27:17,033 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2018-12-02 09:27:17,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 09:27:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2018-12-02 09:27:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 09:27:17,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:27:17,035 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:27:17,035 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:27:17,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:27:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash 205996707, now seen corresponding path program 2 times [2018-12-02 09:27:17,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 09:27:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:27:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 09:27:17,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 09:27:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:27:17,609 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:27:17,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:17,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 09:27:17,610 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 09:27:17,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 09:27:17,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:27:17,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:27:17,617 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 09:27:17,617 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 09:27:17,646 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 09:27:17,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:27:17,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:27:17,663 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-02 09:27:17,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,667 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:27:17,786 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-02 09:27:17,788 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-02 09:27:17,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,790 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,796 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-02 09:27:17,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 10 treesize of output 9 [2018-12-02 09:27:17,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,799 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,803 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:17,803 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:38, output treesize:30 [2018-12-02 09:27:26,229 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification that was a NOOP. DAG size: 29 [2018-12-02 09:27:26,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,247 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 30 treesize of output 31 [2018-12-02 09:27:26,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 09:27:26,253 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,256 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 20 treesize of output 16 [2018-12-02 09:27:26,256 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,260 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,266 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,284 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 30 treesize of output 31 [2018-12-02 09:27:26,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-12-02 09:27:26,289 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,291 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 20 treesize of output 16 [2018-12-02 09:27:26,291 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,299 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,308 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 1 xjuncts. [2018-12-02 09:27:26,308 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:72, output treesize:50 [2018-12-02 09:27:26,377 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,382 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 32 treesize of output 31 [2018-12-02 09:27:26,393 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 2 case distinctions, treesize of input 18 treesize of output 27 [2018-12-02 09:27:26,393 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 09:27:26,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:26,438 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,442 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 32 treesize of output 31 [2018-12-02 09:27:26,455 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 18 treesize of output 27 [2018-12-02 09:27:26,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-12-02 09:27:26,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:26,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 4 xjuncts. [2018-12-02 09:27:26,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:76, output treesize:309 [2018-12-02 09:27:26,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,642 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,643 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-12-02 09:27:26,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,651 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,651 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:76, output treesize:70 [2018-12-02 09:27:26,819 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:26,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 148 [2018-12-02 09:27:26,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 129 [2018-12-02 09:27:26,828 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-02 09:27:26,844 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-02 09:27:26,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 106 [2018-12-02 09:27:26,867 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 102 treesize of output 87 [2018-12-02 09:27:26,868 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-02 09:27:26,875 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-02 09:27:26,885 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 09:27:26,885 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:176, output treesize:94 [2018-12-02 09:27:26,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 114 [2018-12-02 09:27:26,975 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 0 case distinctions, treesize of input 89 treesize of output 93 [2018-12-02 09:27:26,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:26,985 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 121 [2018-12-02 09:27:27,014 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 0 case distinctions, treesize of input 55 treesize of output 51 [2018-12-02 09:27:27,014 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,037 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 1 xjuncts. [2018-12-02 09:27:27,037 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:144, output treesize:120 [2018-12-02 09:27:27,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 103 [2018-12-02 09:27:27,113 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 5 [2018-12-02 09:27:27,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,123 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 59 treesize of output 43 [2018-12-02 09:27:27,123 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-02 09:27:27,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:27:27,133 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:27:27,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2018-12-02 09:27:27,151 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 25 treesize of output 5 [2018-12-02 09:27:27,151 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:27:27,158 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,159 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:27,164 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-02 09:27:27,164 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:131, output treesize:7 [2018-12-02 09:27:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 09:27:27,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:27:28,000 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-02 09:27:29,718 WARN L180 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 213 DAG size of output: 123 [2018-12-02 09:27:29,727 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 151 treesize of output 142 [2018-12-02 09:27:29,731 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-02 09:27:29,731 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:29,767 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:29,777 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 32 treesize of output 36 [2018-12-02 09:27:29,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-12-02 09:27:29,783 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:29,786 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 26 treesize of output 36 [2018-12-02 09:27:29,786 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:29,793 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:29,802 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:29,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:29,972 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:29,973 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:29,974 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:29,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 134 treesize of output 142 [2018-12-02 09:27:29,981 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-02 09:27:29,981 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:30,007 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 15 treesize of output 11 [2018-12-02 09:27:30,007 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,025 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,162 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-02 09:27:30,174 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-02 09:27:30,273 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 154 treesize of output 105 [2018-12-02 09:27:30,325 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-02 09:27:30,325 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:30,337 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,342 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 54 treesize of output 62 [2018-12-02 09:27:30,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 09:27:30,383 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,385 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 31 [2018-12-02 09:27:30,389 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,403 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 4 case distinctions, treesize of input 26 treesize of output 50 [2018-12-02 09:27:30,403 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-12-02 09:27:30,431 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:27:30,444 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-12-02 09:27:30,465 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,466 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 45 treesize of output 40 [2018-12-02 09:27:30,468 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 15 treesize of output 11 [2018-12-02 09:27:30,469 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,476 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,476 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,476 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 17 treesize of output 11 [2018-12-02 09:27:30,477 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,481 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,482 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,483 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 47 treesize of output 40 [2018-12-02 09:27:30,485 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 15 treesize of output 11 [2018-12-02 09:27:30,485 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,492 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,493 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,494 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2018-12-02 09:27:30,498 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-12-02 09:27:30,509 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:30,511 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,512 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 45 treesize of output 40 [2018-12-02 09:27:30,514 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 15 treesize of output 11 [2018-12-02 09:27:30,514 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,521 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,522 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 15 treesize of output 5 [2018-12-02 09:27:30,522 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,527 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,536 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,543 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,606 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 151 treesize of output 142 [2018-12-02 09:27:30,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2018-12-02 09:27:30,610 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,638 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,646 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 32 treesize of output 36 [2018-12-02 09:27:30,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-12-02 09:27:30,653 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,655 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 26 treesize of output 36 [2018-12-02 09:27:30,655 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,661 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,668 INFO L267 ElimStorePlain]: Start of recursive call 29: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,687 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,728 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:30,728 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 134 [2018-12-02 09:27:30,810 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 2 case distinctions, treesize of input 24 treesize of output 38 [2018-12-02 09:27:30,811 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-12-02 09:27:30,848 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,850 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 47 treesize of output 38 [2018-12-02 09:27:30,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:30,854 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 15 treesize of output 11 [2018-12-02 09:27:30,855 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,864 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,865 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,865 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 17 treesize of output 11 [2018-12-02 09:27:30,865 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,871 INFO L267 ElimStorePlain]: Start of recursive call 34: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,874 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:27:30,876 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 41 treesize of output 38 [2018-12-02 09:27:30,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:27:30,879 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 15 treesize of output 11 [2018-12-02 09:27:30,880 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,890 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-02 09:27:30,890 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,895 INFO L267 ElimStorePlain]: Start of recursive call 37: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,918 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:30,949 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:27:30,960 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:27:30,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 65 [2018-12-02 09:27:31,010 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-02 09:27:31,010 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:31,021 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 19 treesize of output 19 [2018-12-02 09:27:31,023 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 15 treesize of output 11 [2018-12-02 09:27:31,023 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-12-02 09:27:31,027 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:31,034 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:27:31,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 8 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-02 09:27:31,050 INFO L202 ElimStorePlain]: Needed 45 recursive calls to eliminate 18 variables, input treesize:607, output treesize:36 [2018-12-02 09:27:57,270 WARN L180 SmtUtils]: Spent 7.66 s on a formula simplification that was a NOOP. DAG size: 111 [2018-12-02 09:28:24,307 WARN L180 SmtUtils]: Spent 8.42 s on a formula simplification that was a NOOP. DAG size: 111 [2018-12-02 09:28:40,533 WARN L180 SmtUtils]: Spent 11.92 s on a formula simplification. DAG size of input: 381 DAG size of output: 249 [2018-12-02 09:28:40,536 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-02 09:28:40,552 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-02 09:28:40,553 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:28:40,568 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:28:40,569 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-02 09:28:40,589 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-02 09:28:40,590 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-02 09:28:40,606 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-02 09:28:40,607 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-02 09:28:40,626 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-02 09:28:46,024 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-02 09:28:46,041 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-02 09:28:46,042 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-02 09:28:46,065 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-02 09:28:46,066 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-02 09:28:46,081 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-02 09:28:53,332 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-02 09:28:53,353 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-02 09:28:53,354 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:28:53,381 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:28:53,382 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-02 09:28:53,399 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-02 09:28:59,720 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-02 09:28:59,731 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-02 09:28:59,732 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-02 09:28:59,744 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-02 09:28:59,745 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-02 09:28:59,762 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:03,826 INFO L267 ElimStorePlain]: Start of recursive call 31: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:03,845 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:03,846 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-02 09:29:03,863 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-02 09:29:03,864 INFO L267 ElimStorePlain]: Start of recursive call 35: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:03,889 INFO L267 ElimStorePlain]: Start of recursive call 34: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:07,692 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:07,702 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:07,703 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:07,723 INFO L267 ElimStorePlain]: Start of recursive call 38: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:07,725 INFO L267 ElimStorePlain]: Start of recursive call 41: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:07,737 INFO L267 ElimStorePlain]: Start of recursive call 40: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:11,029 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:11,041 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:11,042 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:11,065 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:11,066 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:11,081 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:13,420 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:13,432 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:13,433 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:13,449 INFO L267 ElimStorePlain]: Start of recursive call 50: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:13,450 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:13,462 INFO L267 ElimStorePlain]: Start of recursive call 52: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:14,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 20 dim-0 vars, 8 dim-2 vars, End of recursive call: 48 dim-0 vars, and 12 xjuncts. [2018-12-02 09:29:14,997 INFO L202 ElimStorePlain]: Needed 53 recursive calls to eliminate 28 variables, input treesize:1043, output treesize:1139 [2018-12-02 09:29:53,867 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-12-02 09:29:54,068 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 09:29:54,070 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:61) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:621) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:122) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:371) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:650) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:191) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.simplify(SmtUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:354) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) 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) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 46 more [2018-12-02 09:29:54,076 INFO L168 Benchmark]: Toolchain (without parser) took 158352.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.1 MB in the beginning and 883.0 MB in the end (delta: 65.1 MB). Peak memory consumption was 203.0 MB. Max. memory is 11.5 GB. [2018-12-02 09:29:54,077 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:29:54,077 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -123.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:29:54,078 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.38 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-02 09:29:54,078 INFO L168 Benchmark]: Boogie Preprocessor took 16.85 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-02 09:29:54,078 INFO L168 Benchmark]: RCFGBuilder took 179.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:29:54,078 INFO L168 Benchmark]: TraceAbstraction took 157875.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 883.0 MB in the end (delta: 163.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. [2018-12-02 09:29:54,079 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 260.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -123.5 MB). Peak memory consumption was 30.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.38 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 16.85 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. * RCFGBuilder took 179.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 157875.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 50.3 MB). Free memory was 1.0 GB in the beginning and 883.0 MB in the end (delta: 163.5 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-635dfa2 [2018-12-02 09:29:55,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 09:29:55,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 09:29:55,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 09:29:55,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 09:29:55,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 09:29:55,117 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 09:29:55,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 09:29:55,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 09:29:55,120 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 09:29:55,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 09:29:55,121 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 09:29:55,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 09:29:55,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 09:29:55,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 09:29:55,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 09:29:55,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 09:29:55,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 09:29:55,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 09:29:55,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 09:29:55,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 09:29:55,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 09:29:55,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 09:29:55,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 09:29:55,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 09:29:55,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 09:29:55,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 09:29:55,133 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 09:29:55,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 09:29:55,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 09:29:55,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 09:29:55,134 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 09:29:55,135 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 09:29:55,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 09:29:55,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 09:29:55,135 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 09:29:55,135 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-12-02 09:29:55,142 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 09:29:55,143 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 09:29:55,143 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 09:29:55,143 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 09:29:55,143 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 09:29:55,143 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 09:29:55,143 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 09:29:55,144 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 09:29:55,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 09:29:55,145 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 09:29:55,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 09:29:55,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 09:29:55,146 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 09:29:55,146 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 09:29:55,146 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-12-02 09:29:55,146 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 09:29:55,146 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-02 09:29:55,146 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-02 09:29:55,146 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_eb8171ff-2337-496c-bbea-1916bd42f903/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 -> a3189d7d4e71631c5441bd903e5049703e07b8be [2018-12-02 09:29:55,164 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 09:29:55,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 09:29:55,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 09:29:55,175 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 09:29:55,175 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 09:29:55,175 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/../../sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 09:29:55,212 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/44c3ee527/46bcf966a53c4c09820bcdae08c5fa51/FLAG20fc7856b [2018-12-02 09:29:55,630 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 09:29:55,630 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/sv-benchmarks/c/list-simple/sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 09:29:55,638 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/44c3ee527/46bcf966a53c4c09820bcdae08c5fa51/FLAG20fc7856b [2018-12-02 09:29:55,646 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/data/44c3ee527/46bcf966a53c4c09820bcdae08c5fa51 [2018-12-02 09:29:55,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 09:29:55,648 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 09:29:55,649 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 09:29:55,649 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 09:29:55,651 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 09:29:55,652 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,653 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1e626f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55, skipping insertion in model container [2018-12-02 09:29:55,653 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 09:29:55,677 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 09:29:55,833 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:29:55,841 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 09:29:55,900 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 09:29:55,922 INFO L195 MainTranslator]: Completed translation [2018-12-02 09:29:55,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55 WrapperNode [2018-12-02 09:29:55,923 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 09:29:55,923 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 09:29:55,923 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 09:29:55,923 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 09:29:55,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 09:29:55,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 09:29:55,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 09:29:55,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 09:29:55,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,958 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,963 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... [2018-12-02 09:29:55,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 09:29:55,965 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 09:29:55,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 09:29:55,965 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 09:29:55,965 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:29:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2018-12-02 09:29:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2018-12-02 09:29:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 09:29:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-12-02 09:29:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-12-02 09:29:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-12-02 09:29:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-12-02 09:29:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 09:29:55,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 09:29:55,999 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 09:29:56,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure sll_remove_first [2018-12-02 09:29:56,000 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_remove_first [2018-12-02 09:29:56,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 09:29:56,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 09:29:56,194 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 09:29:56,194 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 09:29:56,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:29:56 BoogieIcfgContainer [2018-12-02 09:29:56,195 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 09:29:56,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 09:29:56,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 09:29:56,197 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 09:29:56,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:29:55" (1/3) ... [2018-12-02 09:29:56,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c50045a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:29:56, skipping insertion in model container [2018-12-02 09:29:56,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:29:55" (2/3) ... [2018-12-02 09:29:56,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c50045a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:29:56, skipping insertion in model container [2018-12-02 09:29:56,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:29:56" (3/3) ... [2018-12-02 09:29:56,199 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_remove_all_true-unreach-call_true-valid-memsafety.i [2018-12-02 09:29:56,204 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 09:29:56,209 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 09:29:56,218 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 09:29:56,235 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 09:29:56,235 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 09:29:56,235 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 09:29:56,235 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 09:29:56,235 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 09:29:56,235 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 09:29:56,235 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 09:29:56,236 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 09:29:56,236 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 09:29:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-12-02 09:29:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 09:29:56,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:29:56,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:29:56,249 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:29:56,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:29:56,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1372320445, now seen corresponding path program 1 times [2018-12-02 09:29:56,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:29:56,255 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:29:56,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:29:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:29:56,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:29:56,363 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-02 09:29:56,363 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:29:56,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 09:29:56,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 09:29:56,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 09:29:56,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 09:29:56,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 09:29:56,376 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 5 states. [2018-12-02 09:29:56,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:29:56,438 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2018-12-02 09:29:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 09:29:56,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 09:29:56,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:29:56,445 INFO L225 Difference]: With dead ends: 63 [2018-12-02 09:29:56,445 INFO L226 Difference]: Without dead ends: 35 [2018-12-02 09:29:56,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-02 09:29:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-02 09:29:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-12-02 09:29:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 09:29:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-12-02 09:29:56,474 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 17 [2018-12-02 09:29:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:29:56,474 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-12-02 09:29:56,474 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 09:29:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-12-02 09:29:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 09:29:56,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:29:56,475 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] [2018-12-02 09:29:56,475 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:29:56,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:29:56,476 INFO L82 PathProgramCache]: Analyzing trace with hash 102544868, now seen corresponding path program 1 times [2018-12-02 09:29:56,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:29:56,476 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:29:56,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:29:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:29:56,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:29:56,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:29:56,587 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:29:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 09:29:56,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:29:56,707 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:29:56,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:29:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:29:56,738 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:29:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 09:29:56,755 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 09:29:56,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-12-02 09:29:56,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 6] total 10 [2018-12-02 09:29:56,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:29:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:29:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:29:56,772 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2018-12-02 09:29:56,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:29:56,932 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-02 09:29:56,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 09:29:56,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2018-12-02 09:29:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:29:56,933 INFO L225 Difference]: With dead ends: 56 [2018-12-02 09:29:56,934 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 09:29:56,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-02 09:29:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 09:29:56,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-12-02 09:29:56,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 09:29:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-02 09:29:56,942 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 26 [2018-12-02 09:29:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:29:56,942 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-02 09:29:56,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:29:56,943 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-02 09:29:56,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-02 09:29:56,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:29:56,944 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:29:56,944 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:29:56,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:29:56,944 INFO L82 PathProgramCache]: Analyzing trace with hash -766166080, now seen corresponding path program 1 times [2018-12-02 09:29:56,945 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:29:56,945 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:29:56,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:29:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:29:57,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:29:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 09:29:57,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:29:57,099 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 09:29:57,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 09:29:57,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/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-02 09:29:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 09:29:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 09:29:57,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:29:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 09:29:57,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:29:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-12-02 09:29:57,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-12-02 09:29:57,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 6] total 10 [2018-12-02 09:29:57,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 09:29:57,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 09:29:57,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-02 09:29:57,246 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 10 states. [2018-12-02 09:29:57,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 09:29:57,339 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-02 09:29:57,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 09:29:57,339 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2018-12-02 09:29:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 09:29:57,340 INFO L225 Difference]: With dead ends: 50 [2018-12-02 09:29:57,341 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 09:29:57,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2018-12-02 09:29:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 09:29:57,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-02 09:29:57,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 09:29:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-02 09:29:57,347 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-12-02 09:29:57,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 09:29:57,348 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-02 09:29:57,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 09:29:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-02 09:29:57,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-02 09:29:57,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 09:29:57,349 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 09:29:57,349 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 09:29:57,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 09:29:57,349 INFO L82 PathProgramCache]: Analyzing trace with hash 205996707, now seen corresponding path program 2 times [2018-12-02 09:29:57,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 09:29:57,349 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_eb8171ff-2337-496c-bbea-1916bd42f903/bin-2019/utaipan/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:29:57,362 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 09:29:57,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 09:29:57,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 09:29:57,552 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 09:29:57,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-02 09:29:57,567 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,571 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 09:29:57,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:29:57,650 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-02 09:29:57,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,654 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,669 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-02 09:29:57,671 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-02 09:29:57,672 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,674 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-12-02 09:29:57,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:57,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 09:29:57,864 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 09:29:57,871 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 18 treesize of output 7 [2018-12-02 09:29:57,872 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,876 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:57,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-12-02 09:29:57,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-12-02 09:29:57,944 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 18 treesize of output 7 [2018-12-02 09:29:57,944 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,946 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,952 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:57,965 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:70, output treesize:48 [2018-12-02 09:29:58,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:58,019 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:29:58,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 09:29:58,024 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 0 case distinctions, treesize of input 14 treesize of output 7 [2018-12-02 09:29:58,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:58,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 09:29:58,066 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 14 treesize of output 7 [2018-12-02 09:29:58,066 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,085 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,085 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:67, output treesize:54 [2018-12-02 09:29:58,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:58,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:58,213 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:58,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2018-12-02 09:29:58,214 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:62, output treesize:56 [2018-12-02 09:29:58,699 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 09:29:58,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 121 [2018-12-02 09:29:58,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 102 [2018-12-02 09:29:58,709 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-02 09:29:58,732 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-02 09:29:58,784 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:29:58,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 88 [2018-12-02 09:29:58,788 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 0 case distinctions, treesize of input 50 treesize of output 39 [2018-12-02 09:29:58,788 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,801 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 09:29:58,822 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:138, output treesize:79 [2018-12-02 09:29:58,928 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:29:58,968 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:29:58,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 127 [2018-12-02 09:29:58,974 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 0 case distinctions, treesize of input 76 treesize of output 80 [2018-12-02 09:29:58,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:58,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,034 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:29:59,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 129 [2018-12-02 09:29:59,061 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 0 case distinctions, treesize of input 47 treesize of output 39 [2018-12-02 09:29:59,061 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,074 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,106 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 1 xjuncts. [2018-12-02 09:29:59,106 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:129, output treesize:121 [2018-12-02 09:29:59,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2018-12-02 09:29:59,218 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 47 treesize of output 28 [2018-12-02 09:29:59,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,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 13 treesize of output 5 [2018-12-02 09:29:59,233 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,242 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:29:59,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-12-02 09:29:59,272 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 13 treesize of output 5 [2018-12-02 09:29:59,272 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,285 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-02 09:29:59,285 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,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, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-12-02 09:29:59,291 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,293 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:29:59,297 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:116, output treesize:7 [2018-12-02 09:29:59,353 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 09:29:59,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 09:30:03,704 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 116 [2018-12-02 09:30:04,155 WARN L180 SmtUtils]: Spent 448.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-12-02 09:30:05,033 WARN L180 SmtUtils]: Spent 876.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-12-02 09:30:05,889 WARN L180 SmtUtils]: Spent 855.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-12-02 09:30:12,098 WARN L180 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 153 DAG size of output: 67 [2018-12-02 09:30:12,171 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-02 09:30:12,241 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-02 09:30:12,396 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 47 treesize of output 41 [2018-12-02 09:30:12,401 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-02 09:30:12,402 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,430 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 09:30:12,451 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 40 treesize of output 40 [2018-12-02 09:30:12,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-12-02 09:30:12,466 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 28 treesize of output 12 [2018-12-02 09:30:12,466 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,473 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,490 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,505 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,566 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 100 treesize of output 77 [2018-12-02 09:30:12,626 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-02 09:30:12,626 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,658 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-12-02 09:30:12,661 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 12 [2018-12-02 09:30:12,661 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,665 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,668 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-02 09:30:12,889 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 09:30:12,890 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: We have to descend beyond store chains. Introduce auxiliary variables only for arrays of lower dimension to avoid non-termination. at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:190) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:383) 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.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-02 09:30:12,896 INFO L168 Benchmark]: Toolchain (without parser) took 17247.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.4 MB). Free memory was 939.3 MB in the beginning and 869.3 MB in the end (delta: 70.0 MB). Peak memory consumption was 283.4 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:12,897 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 09:30:12,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 274.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:12,898 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.69 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-02 09:30:12,898 INFO L168 Benchmark]: Boogie Preprocessor took 22.45 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-02 09:30:12,899 INFO L168 Benchmark]: RCFGBuilder took 229.90 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:12,899 INFO L168 Benchmark]: TraceAbstraction took 16699.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 869.3 MB in the end (delta: 228.3 MB). Peak memory consumption was 299.6 MB. Max. memory is 11.5 GB. [2018-12-02 09:30:12,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 274.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -183.2 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.69 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.45 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. * RCFGBuilder took 229.90 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: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16699.52 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 869.3 MB in the end (delta: 228.3 MB). Peak memory consumption was 299.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: We have to descend beyond store chains. Introduce auxiliary variables only for arrays of lower dimension to avoid non-termination. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: We have to descend beyond store chains. Introduce auxiliary variables only for arrays of lower dimension to avoid non-termination.: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:253) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...