./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/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 35d30cdccac93bddd26c3755048a0b29ad39c8fa .............................................................................................................................................................................................................................................................................................................................................................................. 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_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/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 35d30cdccac93bddd26c3755048a0b29ad39c8fa .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:21:45,000 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:21:45,001 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:21:45,009 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:21:45,009 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:21:45,010 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:21:45,011 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:21:45,012 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:21:45,013 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:21:45,013 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:21:45,014 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:21:45,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:21:45,015 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:21:45,015 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:21:45,016 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:21:45,017 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:21:45,017 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:21:45,018 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:21:45,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:21:45,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:21:45,021 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:21:45,022 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:21:45,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:21:45,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:21:45,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:21:45,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:21:45,026 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:21:45,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:21:45,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:21:45,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:21:45,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:21:45,028 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:21:45,028 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:21:45,028 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:21:45,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:21:45,029 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:21:45,030 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 13:21:45,039 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:21:45,040 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:21:45,040 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:21:45,040 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:21:45,040 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:21:45,041 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:21:45,041 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:21:45,042 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:21:45,042 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:21:45,042 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:21:45,042 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:21:45,043 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:21:45,044 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:21:45,044 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:21:45,044 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:21:45,045 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:21:45,045 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:21:45,045 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:21:45,045 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_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-18 13:21:45,068 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:21:45,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:21:45,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:21:45,079 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:21:45,080 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:21:45,080 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 13:21:45,116 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/6be80936e/b301b650091c4574839b734f2cf8b045/FLAG95724f039 [2018-11-18 13:21:45,527 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:21:45,527 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 13:21:45,533 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/6be80936e/b301b650091c4574839b734f2cf8b045/FLAG95724f039 [2018-11-18 13:21:45,541 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/6be80936e/b301b650091c4574839b734f2cf8b045 [2018-11-18 13:21:45,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:21:45,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:21:45,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:21:45,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:21:45,548 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:21:45,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,551 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce852d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45, skipping insertion in model container [2018-11-18 13:21:45,551 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,560 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:21:45,578 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:21:45,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:21:45,702 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:21:45,715 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:21:45,727 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:21:45,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45 WrapperNode [2018-11-18 13:21:45,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:21:45,728 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:21:45,728 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:21:45,728 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:21:45,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:21:45,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:21:45,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:21:45,744 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:21:45,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... [2018-11-18 13:21:45,803 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:21:45,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:21:45,804 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:21:45,804 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:21:45,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:21:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:21:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 13:21:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-18 13:21:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 13:21:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 13:21:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 13:21:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 13:21:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-18 13:21:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-18 13:21:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-18 13:21:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-18 13:21:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:21:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:21:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:21:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 13:21:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:21:45,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:21:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:21:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:21:45,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:21:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 13:21:46,026 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:21:46,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:46 BoogieIcfgContainer [2018-11-18 13:21:46,027 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:21:46,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:21:46,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:21:46,030 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:21:46,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:21:45" (1/3) ... [2018-11-18 13:21:46,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36388205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:21:46, skipping insertion in model container [2018-11-18 13:21:46,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:45" (2/3) ... [2018-11-18 13:21:46,031 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36388205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:21:46, skipping insertion in model container [2018-11-18 13:21:46,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:46" (3/3) ... [2018-11-18 13:21:46,033 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 13:21:46,041 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:21:46,047 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:21:46,060 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:21:46,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:21:46,083 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:21:46,083 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:21:46,083 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:21:46,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:21:46,084 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:21:46,084 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:21:46,084 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:21:46,099 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 13:21:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:21:46,103 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:46,103 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:46,105 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:46,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 420200068, now seen corresponding path program 1 times [2018-11-18 13:21:46,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:46,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:46,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:46,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:46,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:46,227 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:21:46,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:46,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:21:46,229 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:46,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 13:21:46,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:21:46,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:21:46,244 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-18 13:21:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:46,262 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-18 13:21:46,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:21:46,263 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-18 13:21:46,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:46,269 INFO L225 Difference]: With dead ends: 89 [2018-11-18 13:21:46,269 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 13:21:46,272 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:21:46,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 13:21:46,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 13:21:46,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 13:21:46,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 13:21:46,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-18 13:21:46,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:46,300 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 13:21:46,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 13:21:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 13:21:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:21:46,302 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:46,303 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:46,303 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:46,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash -2037654064, now seen corresponding path program 1 times [2018-11-18 13:21:46,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:46,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:46,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:46,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:46,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:46,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:21:46,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:46,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:46,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:46,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:46,363 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-18 13:21:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:46,381 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-18 13:21:46,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:46,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-18 13:21:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:46,383 INFO L225 Difference]: With dead ends: 80 [2018-11-18 13:21:46,383 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 13:21:46,383 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:46,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 13:21:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-18 13:21:46,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 13:21:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 13:21:46,390 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-18 13:21:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:46,390 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 13:21:46,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 13:21:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 13:21:46,391 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:46,391 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:46,391 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:46,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:46,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1079029284, now seen corresponding path program 1 times [2018-11-18 13:21:46,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:46,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:46,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:46,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:46,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:21:46,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:21:46,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-18 13:21:46,436 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-11-18 13:21:46,438 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [6], [9], [11], [13], [17], [18], [22], [25], [38], [39], [43], [48], [51], [56], [68], [71], [74], [76], [80], [87], [88], [92], [94], [95], [96], [97], [98], [99], [100], [101], [102], [103], [104], [108], [109], [110] [2018-11-18 13:21:46,463 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-18 13:21:46,463 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-18 13:21:46,529 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translateStore(MappedTerm2Expression.java:291) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:157) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.MappedTerm2Expression.translate(MappedTerm2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.AssumptionBuilder.constructBoogieAssumeStatement(AssumptionBuilder.java:75) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.getCachedCodeBlock(TermConjunctEvaluator.java:273) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.applyPost(TermConjunctEvaluator.java:296) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$4(TermConjunctEvaluator.java:178) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computeFixpoint(TermConjunctEvaluator.java:198) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.lambda$1(TermConjunctEvaluator.java:150) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.util.TermConjunctEvaluator.computePost(TermConjunctEvaluator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormanCachedPostOperation.applyPost(PoormanCachedPostOperation.java:308) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.applyPost(PoormansAbstractPostOperator.java:217) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:119) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.PoormansAbstractPostOperator.apply(PoormansAbstractPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:217) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) ... 20 more [2018-11-18 13:21:46,531 INFO L168 Benchmark]: Toolchain (without parser) took 987.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 961.9 MB in the beginning and 1.1 GB in the end (delta: -106.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:46,532 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:21:46,533 INFO L168 Benchmark]: CACSL2BoogieTranslator took 182.48 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:46,533 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:21:46,534 INFO L168 Benchmark]: Boogie Preprocessor took 59.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:46,534 INFO L168 Benchmark]: RCFGBuilder took 223.27 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:46,535 INFO L168 Benchmark]: TraceAbstraction took 503.46 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:46,537 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 182.48 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.8 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 15.28 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -194.1 MB). Peak memory consumption was 14.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 223.27 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 503.46 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: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:391) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-5842f4b [2018-11-18 13:21:47,974 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:21:47,975 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:21:47,982 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:21:47,982 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:21:47,983 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:21:47,984 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:21:47,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:21:47,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:21:47,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:21:47,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:21:47,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:21:47,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:21:47,989 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:21:47,990 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:21:47,990 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:21:47,991 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:21:47,992 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:21:47,993 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:21:47,995 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:21:47,995 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:21:47,996 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:21:47,998 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:21:47,998 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:21:47,998 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:21:47,999 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:21:48,000 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:21:48,000 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:21:48,001 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:21:48,001 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:21:48,002 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:21:48,002 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:21:48,002 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:21:48,002 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:21:48,003 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:21:48,004 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:21:48,004 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-18 13:21:48,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:21:48,015 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:21:48,016 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:21:48,016 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:21:48,016 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:21:48,016 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:21:48,016 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:21:48,016 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:21:48,017 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:21:48,017 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:21:48,017 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:21:48,017 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 13:21:48,018 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 13:21:48,019 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:21:48,019 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:21:48,019 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:21:48,019 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:21:48,019 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:21:48,019 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:21:48,019 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:21:48,020 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:21:48,020 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:21:48,020 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:21:48,020 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:21:48,020 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:21:48,020 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-18 13:21:48,020 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:21:48,021 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 13:21:48,021 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 13:21:48,021 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_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/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 -> 35d30cdccac93bddd26c3755048a0b29ad39c8fa [2018-11-18 13:21:48,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:21:48,059 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:21:48,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:21:48,062 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:21:48,062 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:21:48,063 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/../../sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 13:21:48,099 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/62b58908d/7847b7aeabf24f4e80664058302d6c65/FLAGbc5ea1030 [2018-11-18 13:21:48,404 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:21:48,404 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/sv-benchmarks/c/ldv-regression/ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 13:21:48,408 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/62b58908d/7847b7aeabf24f4e80664058302d6c65/FLAGbc5ea1030 [2018-11-18 13:21:48,418 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/data/62b58908d/7847b7aeabf24f4e80664058302d6c65 [2018-11-18 13:21:48,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:21:48,421 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:21:48,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:21:48,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:21:48,425 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:21:48,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53e13833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48, skipping insertion in model container [2018-11-18 13:21:48,428 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:21:48,452 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:21:48,571 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:21:48,576 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:21:48,590 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:21:48,605 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:21:48,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48 WrapperNode [2018-11-18 13:21:48,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:21:48,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:21:48,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:21:48,606 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:21:48,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,618 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:21:48,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:21:48,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:21:48,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:21:48,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,629 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,640 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... [2018-11-18 13:21:48,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:21:48,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:21:48,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:21:48,644 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:21:48,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:21:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-18 13:21:48,727 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-18 13:21:48,727 INFO L138 BoogieDeclarations]: Found implementation of procedure malloc [2018-11-18 13:21:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure init [2018-11-18 13:21:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2018-11-18 13:21:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-18 13:21:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-18 13:21:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-18 13:21:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-18 13:21:48,728 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2018-11-18 13:21:48,728 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2018-11-18 13:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:21:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-18 13:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:21:48,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 13:21:48,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 13:21:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:21:48,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:21:48,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 13:21:48,944 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:21:48,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:48 BoogieIcfgContainer [2018-11-18 13:21:48,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:21:48,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:21:48,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:21:48,948 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:21:48,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:21:48" (1/3) ... [2018-11-18 13:21:48,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93ff5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:21:48, skipping insertion in model container [2018-11-18 13:21:48,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:48" (2/3) ... [2018-11-18 13:21:48,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@93ff5d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:21:48, skipping insertion in model container [2018-11-18 13:21:48,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:48" (3/3) ... [2018-11-18 13:21:48,950 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3_forlist_true-termination.c_true-unreach-call.i [2018-11-18 13:21:48,956 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:21:48,960 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:21:48,971 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:21:48,990 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 13:21:48,990 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:21:48,990 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:21:48,990 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:21:48,991 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:21:48,991 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:21:48,991 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:21:48,991 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:21:48,991 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:21:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-18 13:21:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-18 13:21:49,005 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:49,005 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:49,007 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:49,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:49,011 INFO L82 PathProgramCache]: Analyzing trace with hash 420200068, now seen corresponding path program 1 times [2018-11-18 13:21:49,013 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:21:49,014 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:21:49,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:49,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:49,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:21:49,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:21:49,123 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (2)] Exception during sending of exit command (exit): Broken pipe [2018-11-18 13:21:49,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:49,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 13:21:49,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 13:21:49,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 13:21:49,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:21:49,143 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 2 states. [2018-11-18 13:21:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:49,166 INFO L93 Difference]: Finished difference Result 89 states and 116 transitions. [2018-11-18 13:21:49,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 13:21:49,167 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 40 [2018-11-18 13:21:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:49,173 INFO L225 Difference]: With dead ends: 89 [2018-11-18 13:21:49,173 INFO L226 Difference]: Without dead ends: 44 [2018-11-18 13:21:49,175 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 13:21:49,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-18 13:21:49,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-18 13:21:49,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-18 13:21:49,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2018-11-18 13:21:49,208 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 40 [2018-11-18 13:21:49,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:49,209 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2018-11-18 13:21:49,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 13:21:49,209 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2018-11-18 13:21:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 13:21:49,210 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:49,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:49,211 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:49,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:49,211 INFO L82 PathProgramCache]: Analyzing trace with hash -2037654064, now seen corresponding path program 1 times [2018-11-18 13:21:49,212 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:21:49,212 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:21:49,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:49,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:21:49,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:21:49,310 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:21:49,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:49,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:49,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:49,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:49,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:49,316 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand 3 states. [2018-11-18 13:21:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:49,346 INFO L93 Difference]: Finished difference Result 80 states and 94 transitions. [2018-11-18 13:21:49,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:49,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-11-18 13:21:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:49,349 INFO L225 Difference]: With dead ends: 80 [2018-11-18 13:21:49,349 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 13:21:49,349 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:49,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 13:21:49,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-18 13:21:49,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-18 13:21:49,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-11-18 13:21:49,354 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 43 [2018-11-18 13:21:49,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:49,355 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-11-18 13:21:49,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:49,355 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-11-18 13:21:49,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-18 13:21:49,356 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:49,356 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:49,356 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:49,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:49,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1079029284, now seen corresponding path program 1 times [2018-11-18 13:21:49,357 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:21:49,357 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:21:49,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:49,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:21:49,460 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:21:49,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:21:49,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:21:49,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:21:49,525 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:21:49,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:49,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:21:49,586 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 13:21:49,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:49,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 13:21:49,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:49,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:21:49,610 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-11-18 13:21:49,630 INFO L477 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 6 treesize of output 4 [2018-11-18 13:21:49,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:49,648 INFO L477 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 6 treesize of output 4 [2018-11-18 13:21:49,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:49,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:21:49,654 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:12 [2018-11-18 13:21:55,730 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2018-11-18 13:21:55,745 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:21:55,747 INFO L477 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 22 treesize of output 26 [2018-11-18 13:21:55,748 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:55,768 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:21:55,769 INFO L477 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 22 treesize of output 26 [2018-11-18 13:21:55,770 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:55,783 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-11-18 13:21:55,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:32 [2018-11-18 13:21:55,975 INFO L477 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 6 treesize of output 4 [2018-11-18 13:21:55,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:55,985 INFO L477 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 6 treesize of output 4 [2018-11-18 13:21:55,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:55,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:21:55,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-18 13:21:56,022 INFO L477 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 6 treesize of output 4 [2018-11-18 13:21:56,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:56,030 INFO L477 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 6 treesize of output 4 [2018-11-18 13:21:56,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:56,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:21:56,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2018-11-18 13:21:56,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-18 13:21:56,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:56,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2018-11-18 13:21:56,129 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:21:56,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-18 13:21:56,137 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:27 [2018-11-18 13:21:56,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-18 13:21:56,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:21:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:21:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 14] total 18 [2018-11-18 13:21:56,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-18 13:21:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-18 13:21:56,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=404, Unknown=2, NotChecked=0, Total=462 [2018-11-18 13:21:56,422 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 18 states. [2018-11-18 13:22:03,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:03,898 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-11-18 13:22:03,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-18 13:22:03,899 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 46 [2018-11-18 13:22:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:22:03,901 INFO L225 Difference]: With dead ends: 115 [2018-11-18 13:22:03,901 INFO L226 Difference]: Without dead ends: 80 [2018-11-18 13:22:03,902 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=157, Invalid=897, Unknown=2, NotChecked=0, Total=1056 [2018-11-18 13:22:03,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-18 13:22:03,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2018-11-18 13:22:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-18 13:22:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2018-11-18 13:22:03,916 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 46 [2018-11-18 13:22:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:22:03,916 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2018-11-18 13:22:03,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-18 13:22:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2018-11-18 13:22:03,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-18 13:22:03,918 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:22:03,918 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:22:03,918 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:22:03,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:03,918 INFO L82 PathProgramCache]: Analyzing trace with hash -898411088, now seen corresponding path program 1 times [2018-11-18 13:22:03,919 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:22:03,919 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:22:03,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:04,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:04,029 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 13:22:04,029 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 13:22:04,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:22:04,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:22:04,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:22:04,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:22:04,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:22:04,032 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand 3 states. [2018-11-18 13:22:04,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:04,070 INFO L93 Difference]: Finished difference Result 127 states and 156 transitions. [2018-11-18 13:22:04,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:22:04,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-11-18 13:22:04,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:22:04,072 INFO L225 Difference]: With dead ends: 127 [2018-11-18 13:22:04,072 INFO L226 Difference]: Without dead ends: 85 [2018-11-18 13:22:04,073 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:22:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-18 13:22:04,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2018-11-18 13:22:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-18 13:22:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 93 transitions. [2018-11-18 13:22:04,084 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 93 transitions. Word has length 50 [2018-11-18 13:22:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:22:04,084 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 93 transitions. [2018-11-18 13:22:04,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:22:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-11-18 13:22:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-18 13:22:04,087 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:22:04,087 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:22:04,087 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:22:04,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:04,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1240488140, now seen corresponding path program 1 times [2018-11-18 13:22:04,088 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:22:04,088 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:22:04,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:04,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:04,276 INFO L477 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-11-18 13:22:04,279 INFO L477 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-11-18 13:22:04,279 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 13:22:04,315 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:22:04,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:22:04,318 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,330 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 13:22:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:22:04,420 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:22:04,615 INFO L477 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 15 treesize of output 13 [2018-11-18 13:22:04,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-18 13:22:04,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:22:04,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:22:04,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-18 13:22:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:22:04,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:22:04,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:22:04,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:04,848 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:04,880 INFO L477 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-11-18 13:22:04,883 INFO L477 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-11-18 13:22:04,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,885 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,890 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 13:22:04,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:22:04,894 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:22:04,894 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:04,900 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 13:22:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:22:04,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:22:05,017 INFO L477 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 15 treesize of output 13 [2018-11-18 13:22:05,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 5 [2018-11-18 13:22:05,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:05,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:22:05,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:22:05,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:18 [2018-11-18 13:22:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:22:05,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:22:05,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 15, 14] total 27 [2018-11-18 13:22:05,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 13:22:05,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 13:22:05,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2018-11-18 13:22:05,108 INFO L87 Difference]: Start difference. First operand 79 states and 93 transitions. Second operand 27 states. [2018-11-18 13:22:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:06,410 INFO L93 Difference]: Finished difference Result 130 states and 155 transitions. [2018-11-18 13:22:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 13:22:06,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-11-18 13:22:06,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:22:06,412 INFO L225 Difference]: With dead ends: 130 [2018-11-18 13:22:06,412 INFO L226 Difference]: Without dead ends: 114 [2018-11-18 13:22:06,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 179 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=268, Invalid=1538, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 13:22:06,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-18 13:22:06,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 97. [2018-11-18 13:22:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-18 13:22:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 117 transitions. [2018-11-18 13:22:06,427 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 117 transitions. Word has length 51 [2018-11-18 13:22:06,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:22:06,427 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 117 transitions. [2018-11-18 13:22:06,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 13:22:06,427 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 117 transitions. [2018-11-18 13:22:06,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-18 13:22:06,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:22:06,429 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:22:06,429 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:22:06,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:06,430 INFO L82 PathProgramCache]: Analyzing trace with hash -411039927, now seen corresponding path program 1 times [2018-11-18 13:22:06,430 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:22:06,430 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:22:06,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:06,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 13:22:06,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:22:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 13:22:06,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:22:06,529 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:22:06,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:06,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:06,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:06,770 INFO L477 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-11-18 13:22:06,772 INFO L477 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-11-18 13:22:06,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:06,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:06,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:06,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 13:22:06,923 INFO L477 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 24 treesize of output 18 [2018-11-18 13:22:06,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-18 13:22:06,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:06,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:06,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:06,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-18 13:22:06,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-18 13:22:06,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:22:07,210 INFO L477 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 14 treesize of output 12 [2018-11-18 13:22:07,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-18 13:22:07,222 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:07,226 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:22:07,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:22:07,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:9 [2018-11-18 13:22:07,471 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 13:22:07,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:22:07,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 17, 15] total 34 [2018-11-18 13:22:07,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-18 13:22:07,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-18 13:22:07,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1023, Unknown=0, NotChecked=0, Total=1122 [2018-11-18 13:22:07,488 INFO L87 Difference]: Start difference. First operand 97 states and 117 transitions. Second operand 34 states. [2018-11-18 13:22:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:22:09,284 INFO L93 Difference]: Finished difference Result 179 states and 224 transitions. [2018-11-18 13:22:09,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 13:22:09,284 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-18 13:22:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:22:09,285 INFO L225 Difference]: With dead ends: 179 [2018-11-18 13:22:09,285 INFO L226 Difference]: Without dead ends: 130 [2018-11-18 13:22:09,286 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=1785, Unknown=0, NotChecked=0, Total=1980 [2018-11-18 13:22:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-11-18 13:22:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 119. [2018-11-18 13:22:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-11-18 13:22:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2018-11-18 13:22:09,300 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 54 [2018-11-18 13:22:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:22:09,300 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2018-11-18 13:22:09,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-18 13:22:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2018-11-18 13:22:09,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-18 13:22:09,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:22:09,303 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:22:09,303 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:22:09,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:22:09,303 INFO L82 PathProgramCache]: Analyzing trace with hash 839664781, now seen corresponding path program 1 times [2018-11-18 13:22:09,303 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:22:09,304 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:22:09,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:09,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:09,443 INFO L477 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-11-18 13:22:09,445 INFO L477 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-11-18 13:22:09,445 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,454 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 13:22:09,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:22:09,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:22:09,465 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 13:22:09,519 INFO L477 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 23 treesize of output 18 [2018-11-18 13:22:09,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:22:09,522 INFO L477 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 25 [2018-11-18 13:22:09,523 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,527 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 13:22:09,581 INFO L477 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 26 treesize of output 20 [2018-11-18 13:22:09,583 INFO L477 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 20 treesize of output 5 [2018-11-18 13:22:09,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,585 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-18 13:22:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 13:22:09,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:22:09,802 INFO L477 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 14 treesize of output 12 [2018-11-18 13:22:09,816 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:22:09,816 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,825 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-11-18 13:22:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 13:22:09,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:22:09,853 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:22:09,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:22:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:22:09,906 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:22:09,912 INFO L477 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-11-18 13:22:09,914 INFO L477 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-11-18 13:22:09,914 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,921 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 13:22:09,923 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:22:09,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:22:09,926 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,927 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:09,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 13:22:28,456 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-18 13:22:28,463 INFO L477 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 23 treesize of output 18 [2018-11-18 13:22:28,467 INFO L477 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 18 treesize of output 19 [2018-11-18 13:22:28,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:28,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:28,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:22:28,480 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:22 [2018-11-18 13:22:30,511 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:22:30,512 INFO L477 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-11-18 13:22:30,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:30,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:30,515 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:30,515 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-18 13:22:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 13:22:30,519 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:22:30,632 INFO L477 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 14 treesize of output 12 [2018-11-18 13:22:30,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:22:30,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:22:30,645 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:30,646 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:22:30,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-11-18 13:22:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-18 13:22:30,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:22:30,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9, 7] total 20 [2018-11-18 13:22:30,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-18 13:22:30,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-18 13:22:30,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=273, Unknown=10, NotChecked=0, Total=380 [2018-11-18 13:22:30,672 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 20 states. [2018-11-18 13:22:56,331 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 13:23:07,097 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2018-11-18 13:23:24,199 WARN L180 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-18 13:23:38,418 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 13:23:42,023 WARN L180 SmtUtils]: Spent 3.59 s on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-18 13:23:49,695 WARN L180 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 33 DAG size of output: 29 [2018-11-18 13:23:53,799 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-11-18 13:24:01,427 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-11-18 13:24:08,511 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 29 DAG size of output: 25 [2018-11-18 13:24:39,157 WARN L180 SmtUtils]: Spent 3.20 s on a formula simplification. DAG size of input: 31 DAG size of output: 27 [2018-11-18 13:24:43,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:24:43,216 INFO L93 Difference]: Finished difference Result 216 states and 269 transitions. [2018-11-18 13:24:43,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-18 13:24:43,218 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-11-18 13:24:43,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:24:43,219 INFO L225 Difference]: With dead ends: 216 [2018-11-18 13:24:43,220 INFO L226 Difference]: Without dead ends: 203 [2018-11-18 13:24:43,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 196 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 64.1s TimeCoverageRelationStatistics Valid=391, Invalid=1076, Unknown=15, NotChecked=0, Total=1482 [2018-11-18 13:24:43,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-11-18 13:24:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 163. [2018-11-18 13:24:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-18 13:24:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 200 transitions. [2018-11-18 13:24:43,248 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 200 transitions. Word has length 55 [2018-11-18 13:24:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:24:43,248 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 200 transitions. [2018-11-18 13:24:43,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-18 13:24:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 200 transitions. [2018-11-18 13:24:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 13:24:43,249 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:24:43,250 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:24:43,250 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:24:43,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1801169556, now seen corresponding path program 2 times [2018-11-18 13:24:43,250 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:24:43,250 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:24:43,267 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 13:24:43,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:24:43,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:24:43,405 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:43,504 INFO L477 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-11-18 13:24:43,506 INFO L477 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-11-18 13:24:43,506 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,508 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,514 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:24:43,560 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 13:24:43,562 INFO L477 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 7 treesize of output 1 [2018-11-18 13:24:43,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:43,567 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-18 13:24:43,706 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 13:24:43,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:24:44,088 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 13:24:44,108 INFO L477 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 14 treesize of output 5 [2018-11-18 13:24:44,108 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-18 13:24:44,305 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:24:44,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:24:44,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:24:44,313 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:24:44,347 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:24:44,347 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:24:44,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:44,359 INFO L477 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-11-18 13:24:44,362 INFO L477 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-11-18 13:24:44,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,366 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:24:44,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 13:24:44,379 INFO L477 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 7 treesize of output 1 [2018-11-18 13:24:44,379 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,380 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,384 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2018-11-18 13:24:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:24:44,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:24:44,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2018-11-18 13:24:44,533 INFO L477 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 14 treesize of output 5 [2018-11-18 13:24:44,533 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:44,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:24:44,545 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:18 [2018-11-18 13:24:44,574 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-18 13:24:44,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:24:44,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17, 16] total 32 [2018-11-18 13:24:44,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 13:24:44,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 13:24:44,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2018-11-18 13:24:44,591 INFO L87 Difference]: Start difference. First operand 163 states and 200 transitions. Second operand 32 states. [2018-11-18 13:24:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:24:46,725 INFO L93 Difference]: Finished difference Result 263 states and 324 transitions. [2018-11-18 13:24:46,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 13:24:46,726 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-11-18 13:24:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:24:46,728 INFO L225 Difference]: With dead ends: 263 [2018-11-18 13:24:46,728 INFO L226 Difference]: Without dead ends: 239 [2018-11-18 13:24:46,729 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 535 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=389, Invalid=2581, Unknown=0, NotChecked=0, Total=2970 [2018-11-18 13:24:46,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-11-18 13:24:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 224. [2018-11-18 13:24:46,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-11-18 13:24:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 279 transitions. [2018-11-18 13:24:46,758 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 279 transitions. Word has length 59 [2018-11-18 13:24:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:24:46,758 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 279 transitions. [2018-11-18 13:24:46,758 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 13:24:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 279 transitions. [2018-11-18 13:24:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-18 13:24:46,759 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:24:46,760 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:24:46,760 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:24:46,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:24:46,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1333235006, now seen corresponding path program 1 times [2018-11-18 13:24:46,760 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:24:46,760 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:24:46,775 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:24:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:24:46,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:24:46,879 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-18 13:24:46,881 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-18 13:24:46,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,882 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-18 13:24:46,923 INFO L477 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 21 treesize of output 16 [2018-11-18 13:24:46,928 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:46,929 INFO L477 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 16 treesize of output 23 [2018-11-18 13:24:46,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,956 INFO L477 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-11-18 13:24:46,958 INFO L477 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-11-18 13:24:46,958 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,960 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,969 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:37, output treesize:29 [2018-11-18 13:24:46,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 13:24:46,992 INFO L477 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 7 treesize of output 1 [2018-11-18 13:24:46,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:46,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:47,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:24:47,009 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:24:47,010 INFO L477 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 13 treesize of output 10 [2018-11-18 13:24:47,010 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:24:47,011 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:47,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:24:47,017 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:35, output treesize:10 [2018-11-18 13:25:06,170 WARN L180 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 25 [2018-11-18 13:25:12,237 INFO L477 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 31 treesize of output 24 [2018-11-18 13:25:12,243 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2018-11-18 13:25:12,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,249 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,260 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:25:12,262 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:25:12,262 INFO L477 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 13 treesize of output 10 [2018-11-18 13:25:12,263 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,263 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:50, output treesize:12 [2018-11-18 13:25:12,291 INFO L477 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 8 treesize of output 6 [2018-11-18 13:25:12,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2018-11-18 13:25:12,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:12,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:7 [2018-11-18 13:25:18,236 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:25:18,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:25:18,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:25:18,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:25:18,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:25:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:25:18,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:25:18,581 INFO L477 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-11-18 13:25:18,582 INFO L477 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-11-18 13:25:18,582 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,589 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:25:18,624 INFO L477 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 11 treesize of output 9 [2018-11-18 13:25:18,626 INFO L477 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 9 treesize of output 1 [2018-11-18 13:25:18,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-18 13:25:18,723 INFO L477 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 23 treesize of output 18 [2018-11-18 13:25:18,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:25:18,726 INFO L477 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 25 [2018-11-18 13:25:18,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 13:25:18,876 INFO L477 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 26 treesize of output 20 [2018-11-18 13:25:18,879 INFO L477 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 20 treesize of output 5 [2018-11-18 13:25:18,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,880 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:18,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-18 13:25:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 13:25:18,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:25:19,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 13:25:19,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-18 13:25:19,299 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:25:19,301 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:19,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:25:19,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-18 13:25:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-18 13:25:19,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:25:19,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 10] total 36 [2018-11-18 13:25:19,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-18 13:25:19,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-18 13:25:19,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1527, Unknown=7, NotChecked=0, Total=1722 [2018-11-18 13:25:19,386 INFO L87 Difference]: Start difference. First operand 224 states and 279 transitions. Second operand 36 states. [2018-11-18 13:25:55,329 WARN L180 SmtUtils]: Spent 5.74 s on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-11-18 13:26:10,914 WARN L180 SmtUtils]: Spent 4.30 s on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2018-11-18 13:26:53,305 WARN L180 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-18 13:31:56,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:31:56,192 INFO L93 Difference]: Finished difference Result 466 states and 575 transitions. [2018-11-18 13:31:56,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-11-18 13:31:56,192 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 59 [2018-11-18 13:31:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:31:56,194 INFO L225 Difference]: With dead ends: 466 [2018-11-18 13:31:56,194 INFO L226 Difference]: Without dead ends: 369 [2018-11-18 13:31:56,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 152 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2635 ImplicationChecksByTransitivity, 134.3s TimeCoverageRelationStatistics Valid=1382, Invalid=8468, Unknown=50, NotChecked=0, Total=9900 [2018-11-18 13:31:56,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-11-18 13:31:56,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 252. [2018-11-18 13:31:56,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-18 13:31:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 317 transitions. [2018-11-18 13:31:56,219 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 317 transitions. Word has length 59 [2018-11-18 13:31:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:31:56,219 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 317 transitions. [2018-11-18 13:31:56,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-18 13:31:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 317 transitions. [2018-11-18 13:31:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 13:31:56,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:31:56,220 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:31:56,220 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:31:56,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:31:56,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1272538437, now seen corresponding path program 2 times [2018-11-18 13:31:56,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:31:56,220 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:31:56,232 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 13:31:56,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:31:56,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:31:56,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:31:56,360 INFO L477 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-11-18 13:31:56,361 INFO L477 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-11-18 13:31:56,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,363 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,373 INFO L477 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-11-18 13:31:56,374 INFO L477 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-11-18 13:31:56,375 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,376 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,382 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2018-11-18 13:31:56,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 13:31:56,397 INFO L477 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 7 treesize of output 1 [2018-11-18 13:31:56,397 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,405 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2018-11-18 13:31:56,406 INFO L477 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 7 treesize of output 1 [2018-11-18 13:31:56,407 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,407 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,411 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:28, output treesize:10 [2018-11-18 13:31:56,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:31:56,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:31:56,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 13:31:56,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 13:31:56,808 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:33, output treesize:5 [2018-11-18 13:31:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:31:56,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:31:56,867 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:31:56,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:31:56,905 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:31:56,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:31:56,909 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:31:56,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 13:31:56,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 7 treesize of output 6 [2018-11-18 13:31:56,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:16 [2018-11-18 13:31:56,973 INFO L477 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 6 treesize of output 4 [2018-11-18 13:31:56,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,980 INFO L477 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 6 treesize of output 4 [2018-11-18 13:31:56,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:56,985 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2018-11-18 13:31:57,267 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:31:57,267 INFO L477 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 23 treesize of output 29 [2018-11-18 13:31:57,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:57,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-18 13:31:57,281 INFO L477 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 23 treesize of output 29 [2018-11-18 13:31:57,281 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:57,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:57,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:32 [2018-11-18 13:31:57,305 INFO L477 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 6 treesize of output 4 [2018-11-18 13:31:57,305 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:57,313 INFO L477 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 6 treesize of output 4 [2018-11-18 13:31:57,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:57,317 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:57,317 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2018-11-18 13:31:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:31:57,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:31:57,501 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-11-18 13:31:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-18 13:31:57,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:31:57,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12, 11] total 27 [2018-11-18 13:31:57,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-18 13:31:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-18 13:31:57,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=567, Unknown=0, NotChecked=0, Total=702 [2018-11-18 13:31:57,726 INFO L87 Difference]: Start difference. First operand 252 states and 317 transitions. Second operand 27 states. [2018-11-18 13:31:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:31:58,888 INFO L93 Difference]: Finished difference Result 282 states and 349 transitions. [2018-11-18 13:31:58,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-18 13:31:58,888 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 62 [2018-11-18 13:31:58,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:31:58,889 INFO L225 Difference]: With dead ends: 282 [2018-11-18 13:31:58,889 INFO L226 Difference]: Without dead ends: 90 [2018-11-18 13:31:58,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2018-11-18 13:31:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-18 13:31:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2018-11-18 13:31:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-18 13:31:58,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2018-11-18 13:31:58,899 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 62 [2018-11-18 13:31:58,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:31:58,900 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2018-11-18 13:31:58,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-18 13:31:58,900 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2018-11-18 13:31:58,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-18 13:31:58,900 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:31:58,900 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:31:58,900 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:31:58,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:31:58,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1450216219, now seen corresponding path program 2 times [2018-11-18 13:31:58,901 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:31:58,901 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:31:58,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:31:58,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:31:58,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:31:59,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:31:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:31:59,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:31:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:31:59,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:31:59,080 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:31:59,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:31:59,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:31:59,123 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:31:59,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:31:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:31:59,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:31:59,138 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:31:59,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:31:59,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5] total 8 [2018-11-18 13:31:59,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 13:31:59,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 13:31:59,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:31:59,159 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand 8 states. [2018-11-18 13:31:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:31:59,195 INFO L93 Difference]: Finished difference Result 137 states and 160 transitions. [2018-11-18 13:31:59,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 13:31:59,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-11-18 13:31:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:31:59,196 INFO L225 Difference]: With dead ends: 137 [2018-11-18 13:31:59,196 INFO L226 Difference]: Without dead ends: 89 [2018-11-18 13:31:59,197 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-18 13:31:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-18 13:31:59,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-11-18 13:31:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-18 13:31:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2018-11-18 13:31:59,205 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 63 [2018-11-18 13:31:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:31:59,205 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2018-11-18 13:31:59,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 13:31:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2018-11-18 13:31:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 13:31:59,206 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:31:59,206 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:31:59,206 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:31:59,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:31:59,206 INFO L82 PathProgramCache]: Analyzing trace with hash 192977702, now seen corresponding path program 1 times [2018-11-18 13:31:59,207 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:31:59,207 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:31:59,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 13:31:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:31:59,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:31:59,558 INFO L477 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 24 treesize of output 18 [2018-11-18 13:31:59,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-18 13:31:59,559 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:59,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:59,566 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:59,566 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-18 13:31:59,594 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 13:31:59,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:31:59,715 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:31:59,716 INFO L477 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 4 [2018-11-18 13:31:59,717 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:31:59,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:59,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:31:59,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-11-18 13:31:59,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-18 13:31:59,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-18 13:31:59,807 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 13:31:59,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:31:59,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:31:59,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:11 [2018-11-18 13:32:00,084 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:32:00,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:32:00,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:32:00,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:32:00,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:32:00,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:32:00,154 INFO L477 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 24 treesize of output 18 [2018-11-18 13:32:00,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-18 13:32:00,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:00,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:00,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:00,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-18 13:32:00,169 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 13:32:00,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:32:00,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 13:32:00,195 INFO L477 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 4 [2018-11-18 13:32:00,196 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:00,197 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:00,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:00,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:4 [2018-11-18 13:32:00,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-18 13:32:00,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-18 13:32:00,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-18 13:32:00,216 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:32:00,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:32:00,220 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:11 [2018-11-18 13:32:00,270 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-18 13:32:00,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:32:00,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18, 16] total 32 [2018-11-18 13:32:00,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-18 13:32:00,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-18 13:32:00,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=897, Unknown=0, NotChecked=0, Total=992 [2018-11-18 13:32:00,287 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand 32 states. [2018-11-18 13:32:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:32:02,027 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-11-18 13:32:02,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-18 13:32:02,027 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-18 13:32:02,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:32:02,028 INFO L225 Difference]: With dead ends: 131 [2018-11-18 13:32:02,028 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 13:32:02,029 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 250 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1608, Unknown=0, NotChecked=0, Total=1806 [2018-11-18 13:32:02,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 13:32:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-18 13:32:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 13:32:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2018-11-18 13:32:02,038 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 71 [2018-11-18 13:32:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:32:02,038 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2018-11-18 13:32:02,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-18 13:32:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2018-11-18 13:32:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-18 13:32:02,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:32:02,039 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:32:02,039 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:32:02,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:32:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1279909914, now seen corresponding path program 2 times [2018-11-18 13:32:02,040 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:32:02,040 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:32:02,055 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 13:32:02,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:32:02,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:32:02,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:32:02,345 INFO L477 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-11-18 13:32:02,347 INFO L477 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-11-18 13:32:02,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:02,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:02,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:02,354 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:32:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 13:32:02,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:32:02,994 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 13:32:03,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 13:32:03,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,017 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:32:03,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 13:32:03,021 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:9 [2018-11-18 13:32:03,402 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 24 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-18 13:32:03,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:32:03,405 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:32:03,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 13:32:03,452 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 13:32:03,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:32:03,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:32:03,485 INFO L477 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-11-18 13:32:03,487 INFO L477 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-11-18 13:32:03,488 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-18 13:32:03,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2018-11-18 13:32:03,609 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-18 13:32:03,609 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:03,614 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2018-11-18 13:32:25,864 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-18 13:32:25,871 INFO L477 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 34 treesize of output 27 [2018-11-18 13:32:25,876 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:32:25,879 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:32:25,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2018-11-18 13:32:25,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:25,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:25,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 13:32:25,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:24 [2018-11-18 13:32:26,084 INFO L477 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 15 treesize of output 11 [2018-11-18 13:32:26,087 INFO L477 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-11-18 13:32:26,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:32:26,098 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:26,101 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:32:26,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-18 13:32:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-18 13:32:26,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:32:26,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-18 13:32:26,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 21] total 44 [2018-11-18 13:32:26,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-18 13:32:26,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-18 13:32:26,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=2181, Unknown=10, NotChecked=0, Total=2352 [2018-11-18 13:32:26,489 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 44 states. [2018-11-18 13:33:07,666 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 13:33:16,558 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-18 13:33:20,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:33:20,041 INFO L93 Difference]: Finished difference Result 136 states and 140 transitions. [2018-11-18 13:33:20,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-18 13:33:20,041 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 71 [2018-11-18 13:33:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:33:20,042 INFO L225 Difference]: With dead ends: 136 [2018-11-18 13:33:20,042 INFO L226 Difference]: Without dead ends: 76 [2018-11-18 13:33:20,043 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 189 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1182 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=491, Invalid=5042, Unknown=17, NotChecked=0, Total=5550 [2018-11-18 13:33:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-18 13:33:20,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-18 13:33:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 13:33:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-11-18 13:33:20,051 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 71 [2018-11-18 13:33:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:33:20,051 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-11-18 13:33:20,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-18 13:33:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-18 13:33:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-18 13:33:20,052 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:33:20,052 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:33:20,052 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:33:20,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:33:20,052 INFO L82 PathProgramCache]: Analyzing trace with hash 38451117, now seen corresponding path program 3 times [2018-11-18 13:33:20,053 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 13:33:20,053 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 13:33:20,067 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 13:33:20,355 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 13:33:20,355 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:33:20,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:33:20,404 INFO L477 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-11-18 13:33:20,406 INFO L477 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-11-18 13:33:20,406 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,407 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,412 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:33:20,423 INFO L477 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 11 treesize of output 9 [2018-11-18 13:33:20,424 INFO L477 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 9 treesize of output 1 [2018-11-18 13:33:20,424 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,428 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-18 13:33:20,467 INFO L477 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 23 treesize of output 18 [2018-11-18 13:33:20,470 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:33:20,471 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:33:20,471 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 35 [2018-11-18 13:33:20,472 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-18 13:33:20,541 INFO L477 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 26 treesize of output 20 [2018-11-18 13:33:20,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:33:20,544 INFO L477 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 20 treesize of output 10 [2018-11-18 13:33:20,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,546 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-18 13:33:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 31 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:33:20,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:33:20,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 13:33:20,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2018-11-18 13:33:20,763 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,765 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-18 13:33:20,812 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:33:20,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 13:33:20,814 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_054b7e9c-e78f-4bf1-9207-2b52ca55ba93/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 13:33:20,821 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 13:33:20,935 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 13:33:20,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 13:33:20,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 13:33:20,967 INFO L477 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-11-18 13:33:20,970 INFO L477 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-11-18 13:33:20,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:17, output treesize:13 [2018-11-18 13:33:20,980 INFO L477 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 11 treesize of output 9 [2018-11-18 13:33:20,981 INFO L477 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 9 treesize of output 1 [2018-11-18 13:33:20,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,986 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:18, output treesize:7 [2018-11-18 13:33:20,991 INFO L477 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 21 treesize of output 16 [2018-11-18 13:33:20,992 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:33:20,993 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:33:20,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 33 [2018-11-18 13:33:20,994 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:20,998 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-18 13:33:21,007 INFO L477 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 26 treesize of output 20 [2018-11-18 13:33:21,010 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 13:33:21,011 INFO L477 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 20 treesize of output 10 [2018-11-18 13:33:21,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,013 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:5 [2018-11-18 13:33:21,020 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-18 13:33:21,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 13:33:21,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-18 13:33:21,120 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-18 13:33:21,120 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 13:33:21,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:7 [2018-11-18 13:33:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-18 13:33:21,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2018-11-18 13:33:21,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 14, 10] total 21 [2018-11-18 13:33:21,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-18 13:33:21,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-18 13:33:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2018-11-18 13:33:21,163 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 21 states. [2018-11-18 13:33:22,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:33:22,189 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-18 13:33:22,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-18 13:33:22,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 75 [2018-11-18 13:33:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:33:22,189 INFO L225 Difference]: With dead ends: 76 [2018-11-18 13:33:22,190 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:33:22,190 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 277 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=262, Invalid=1144, Unknown=0, NotChecked=0, Total=1406 [2018-11-18 13:33:22,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:33:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:33:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:33:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:33:22,191 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2018-11-18 13:33:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:33:22,191 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:33:22,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-18 13:33:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:33:22,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:33:22,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:33:22,678 WARN L180 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 58 [2018-11-18 13:33:26,530 WARN L180 SmtUtils]: Spent 3.71 s on a formula simplification. DAG size of input: 115 DAG size of output: 79 [2018-11-18 13:33:27,102 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 47 [2018-11-18 13:33:27,225 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point mallocFINAL(lines 46 49) no Hoare annotation was computed. [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point mallocEXIT(lines 46 49) no Hoare annotation was computed. [2018-11-18 13:33:27,517 INFO L421 ceAbstractionStarter]: At program point mallocENTRY(lines 46 49) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |#memory_$Pointer$.base| |~#pp~0.base|))) (= |old(~counter~0)| ~counter~0) (= |old(~counter~0)| (_ bv0 32)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,517 INFO L421 ceAbstractionStarter]: At program point initENTRY(lines 15 21) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|)) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 17 20) no Hoare annotation was computed. [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point L17-3(lines 17 20) no Hoare annotation was computed. [2018-11-18 13:33:27,517 INFO L421 ceAbstractionStarter]: At program point L17-4(lines 17 20) the Hoare annotation is: (or (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point initEXIT(lines 15 21) no Hoare annotation was computed. [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point L17-5(lines 15 21) no Hoare annotation was computed. [2018-11-18 13:33:27,517 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (let ((.cse1 (select |#memory_int| |~#pstate~0.base|)) (.cse0 (select |old(#memory_int)| |~#pstate~0.base|))) (and (or (not (= (bvadd (select .cse0 |~#pstate~0.offset|) (_ bv4294967295 32)) (_ bv0 32))) (= (_ bv1 32) (select .cse1 |~#pstate~0.offset|))) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(~counter~0)| ~counter~0) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (let ((.cse2 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (or (= (bvadd (select .cse1 .cse2) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv1 32) (select .cse0 .cse2))))))) [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L25-1(lines 25 31) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L25-3(lines 25 31) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L421 ceAbstractionStarter]: At program point L25-4(lines 25 31) the Hoare annotation is: (let ((.cse1 (= |old(#memory_int)| |#memory_int|)) (.cse5 (= f_~i~1 (_ bv0 32))) (.cse2 (= |f_#in~pointer.offset| f_~pointer.offset)) (.cse3 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) (.cse4 (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (.cse6 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse8 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse7 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse0 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (and (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) .cse0)) (and .cse1 .cse2 .cse3 .cse4 .cse5) .cse6 (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) .cse7)) .cse8) (let ((.cse9 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (and .cse1 .cse2 .cse3 (= (bvadd f_~i~1 (_ bv4294967295 32)) (_ bv0 32)) .cse4) (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) (and .cse1 .cse5 .cse2 .cse3 .cse4) (not (= (_ bv0 32) (select .cse7 .cse9))) .cse6 .cse8 (not (= (bvadd (select .cse7 |~#pp~0.offset|) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select .cse0 .cse9) (_ bv0 32))))))) [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L25-5(lines 23 32) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point fEXIT(lines 23 32) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L421 ceAbstractionStarter]: At program point fENTRY(lines 23 32) the Hoare annotation is: (let ((.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse0 (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse3 (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|)) (.cse1 (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (and (or .cse0 (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) .cse1)) .cse2 (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) .cse3)) .cse4) (let ((.cse5 (bvadd |~#pp~0.offset| (_ bv4 32)))) (or (not (= (_ bv1 32) (select (select |old(#memory_int)| |~#pstate~0.base|) |~#pstate~0.offset|))) (not (= (_ bv0 32) (select .cse3 .cse5))) .cse2 .cse0 .cse4 (not (= (bvadd (select .cse3 |~#pp~0.offset|) (_ bv4294967295 32)) (_ bv0 32))) (not (= (select .cse1 .cse5) (_ bv0 32))))))) [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 36 42) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L36-3(lines 36 42) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L421 ceAbstractionStarter]: At program point L36-4(lines 36 42) the Hoare annotation is: (let ((.cse19 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse20 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (let ((.cse17 (select .cse20 |~#pp~0.offset|)) (.cse13 (select .cse20 (bvadd |~#pp~0.offset| (_ bv4 32)))) (.cse18 (select .cse19 |~#pstate~0.offset|)) (.cse11 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (let ((.cse4 (select |#memory_int| |~#pstate~0.base|)) (.cse5 (bvadd (bvmul (_ bv4 32) g_~i~2) |~#pstate~0.offset|)) (.cse2 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse19 .cse11 (_ bv1 32))) |#memory_int|)) (.cse7 (not (= (_ bv1 32) .cse18))) (.cse0 (= (_ bv2 32) g_~i~2)) (.cse1 (= g_~i~2 (_ bv0 32))) (.cse6 (not (= (_ bv1 32) (select .cse19 .cse11)))) (.cse8 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse15 (= |g_#in~pointer.offset| .cse13)) (.cse9 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse12 (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse19 |~#pstate~0.offset| (_ bv2 32))) |#memory_int|)) (.cse3 (= (bvadd g_~i~2 (_ bv4294967295 32)) (_ bv0 32))) (.cse14 (= |g_#in~pointer.offset| g_~pointer.offset)) (.cse16 (not (= (bvadd .cse17 (_ bv4294967295 32)) (_ bv0 32))))) (and (or .cse0 (and .cse1 .cse2) (and .cse3 (= (bvadd (select .cse4 .cse5) (_ bv4294967295 32)) (_ bv0 32))) .cse6 .cse7 .cse8 .cse9) (let ((.cse10 (= |g_#in~pointer.offset| .cse17))) (or (and .cse2 .cse0) .cse8 (and .cse10 (= (bvadd (select (store .cse4 .cse5 (_ bv2 32)) .cse11) (_ bv4294967295 32)) (_ bv0 32)) .cse12) (not (= (_ bv2 32) .cse13)) (and .cse12 .cse10 .cse14) (and .cse0 .cse15) (and .cse2 .cse14) .cse6 .cse7 .cse9 .cse16)) (or .cse0 (and .cse12 .cse1 .cse14) .cse6 .cse8 (not .cse15) .cse9 (not (= (_ bv2 32) |g_#in~pointer.offset|)) (and .cse12 .cse3 .cse14) (not (= (_ bv2 32) .cse18)) .cse16))))) [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L36-5(lines 34 43) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point gEXIT(lines 34 43) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-18 13:33:27,518 INFO L425 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L421 ceAbstractionStarter]: At program point L39-2(line 39) the Hoare annotation is: (let ((.cse5 (select |old(#memory_int)| |~#pstate~0.base|))) (let ((.cse0 (not (= (_ bv1 32) (select .cse5 (bvadd |~#pstate~0.offset| (_ bv4 32)))))) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse3 (not (= (_ bv0 32) |~#pp~0.offset|))) (.cse1 (select .cse5 |~#pstate~0.offset|))) (and (or .cse0 (not (= (_ bv1 32) .cse1)) .cse2 .cse3) (let ((.cse4 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (or .cse0 .cse2 (not (= |g_#in~pointer.offset| (select .cse4 (bvadd |~#pp~0.offset| (_ bv4 32))))) .cse3 (not (= (_ bv2 32) |g_#in~pointer.offset|)) (not (= (_ bv2 32) .cse1)) (not (= (bvadd (select .cse4 |~#pp~0.offset|) (_ bv4294967295 32)) (_ bv0 32)))))))) [2018-11-18 13:33:27,519 INFO L421 ceAbstractionStarter]: At program point gENTRY(lines 34 43) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| |~#pstate~0.base|)) (.cse6 (bvadd |~#pstate~0.offset| (_ bv4 32)))) (let ((.cse1 (not (= (_ bv1 32) (select .cse0 .cse6)))) (.cse5 (select .cse0 |~#pstate~0.offset|)) (.cse2 (not (= (_ bv0 32) |~#pstate~0.offset|))) (.cse4 (not (= (_ bv0 32) |~#pp~0.offset|)))) (and (let ((.cse3 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (or (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse0 |~#pstate~0.offset| (_ bv2 32))) |#memory_int|) .cse1 .cse2 (not (= |g_#in~pointer.offset| (select .cse3 (bvadd |~#pp~0.offset| (_ bv4 32))))) .cse4 (not (= (_ bv2 32) |g_#in~pointer.offset|)) (not (= (_ bv2 32) .cse5)) (not (= (bvadd (select .cse3 |~#pp~0.offset|) (_ bv4294967295 32)) (_ bv0 32))))) (or (= (store |old(#memory_int)| |~#pstate~0.base| (store .cse0 .cse6 (_ bv1 32))) |#memory_int|) .cse1 (not (= (_ bv1 32) .cse5)) .cse2 .cse4)))) [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point L39-3(line 39) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point __blast_assertEXIT(lines 4 7) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point __blast_assertFINAL(lines 4 7) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L428 ceAbstractionStarter]: At program point __blast_assertENTRY(lines 4 7) the Hoare annotation is: true [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 6) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= |~#pstate~0.offset| (_ bv0 32)) (= (select |#memory_$Pointer$.offset| |~#pp~0.base|) ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000)) (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |#memory_$Pointer$.base| |~#pp~0.base|)) (= (_ bv0 32) |~#pp~0.offset|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-18 13:33:27,519 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-18 13:33:27,519 INFO L421 ceAbstractionStarter]: At program point L62(line 62) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |~#pstate~0.base|))) (let ((.cse0 (not (= main_~a~0.offset ~counter~0))) (.cse1 (= (bvadd (select .cse6 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))) (.cse2 (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32))) (.cse3 (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32))) (.cse4 (select .cse6 |~#pstate~0.offset|))) (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and .cse0 .cse1 .cse2 .cse3 (= (_ bv1 32) .cse4)) (let ((.cse5 (select |#memory_$Pointer$.offset| |~#pp~0.base|))) (and .cse0 (= (bvadd (select .cse5 (bvadd |~#pp~0.offset| (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 (= (_ bv1 32) (select .cse5 |~#pp~0.offset|)) .cse3 (= (_ bv2 32) .cse4))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|))))) [2018-11-18 13:33:27,519 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 51 69) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|)) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-11-18 13:33:27,520 INFO L421 ceAbstractionStarter]: At program point L61(line 61) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (select |#memory_int| |~#pstate~0.base|))) (and (not (= main_~a~0.offset ~counter~0)) (= (bvadd (select .cse0 (bvadd |~#pp~0.offset| (_ bv4 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select .cse1 (bvadd |~#pstate~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select .cse0 |~#pp~0.offset|)) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select .cse1 |~#pstate~0.offset|)))) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,520 INFO L421 ceAbstractionStarter]: At program point L60(line 60) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (and (not (= main_~a~0.offset ~counter~0)) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (bvadd main_~a~0.offset (_ bv1 32)) main_~b~0.offset) (= (_ bv0 32) main_~a~0.base)) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,520 INFO L421 ceAbstractionStarter]: At program point L60-1(line 60) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (let ((.cse0 (select |#memory_$Pointer$.offset| |~#pp~0.base|)) (.cse1 (bvadd |~#pp~0.offset| (_ bv4 32)))) (and (not (= main_~a~0.offset ~counter~0)) (= (_ bv0 32) (select .cse0 .cse1)) (= (_ bv1 32) (select .cse0 |~#pp~0.offset|)) (= (bvadd main_~b~0.offset (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |~#pstate~0.base|) |~#pstate~0.offset|)) (= (select (select |#memory_$Pointer$.base| |~#pp~0.base|) .cse1) (_ bv0 32)))) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,520 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-11-18 13:33:27,520 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 51 69) no Hoare annotation was computed. [2018-11-18 13:33:27,520 INFO L421 ceAbstractionStarter]: At program point L56(line 56) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd main_~a~0.offset (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (= (bvadd ~counter~0 (_ bv4294967295 32)) main_~a~0.offset) (= (_ bv0 32) main_~a~0.base)) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,520 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-18 13:33:27,520 INFO L425 ceAbstractionStarter]: For program point L56-1(line 56) no Hoare annotation was computed. [2018-11-18 13:33:27,520 INFO L421 ceAbstractionStarter]: At program point L54(line 54) the Hoare annotation is: (or (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|)) (and (= |old(#memory_int)| |#memory_int|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))) [2018-11-18 13:33:27,521 INFO L421 ceAbstractionStarter]: At program point L54-1(line 54) the Hoare annotation is: (or (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (bvadd ~counter~0 (_ bv4294967295 32)) (_ bv0 32)) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.base)| |~#pp~0.base|))) (not (= (bvadd |old(~counter~0)| (_ bv4294967295 32)) (_ bv0 32))) (not (= (_ bv0 32) |~#pstate~0.offset|)) (not (= ((as const (Array (_ BitVec 32) (_ BitVec 32))) #b00000000000000000000000000000000) (select |old(#memory_$Pointer$.offset)| |~#pp~0.base|))) (not (= (_ bv0 32) |~#pp~0.offset|))) [2018-11-18 13:33:27,521 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 51 69) no Hoare annotation was computed. [2018-11-18 13:33:27,523 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:108) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:92) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:537) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:237) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:194) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 13:33:27,525 INFO L168 Benchmark]: Toolchain (without parser) took 699104.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 209.7 MB). Free memory was 949.7 MB in the beginning and 819.2 MB in the end (delta: 130.6 MB). Peak memory consumption was 340.3 MB. Max. memory is 11.5 GB. [2018-11-18 13:33:27,525 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:33:27,526 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.41 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:33:27,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.94 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:33:27,526 INFO L168 Benchmark]: Boogie Preprocessor took 20.23 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:33:27,526 INFO L168 Benchmark]: RCFGBuilder took 301.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:33:27,526 INFO L168 Benchmark]: TraceAbstraction took 698578.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 819.2 MB in the end (delta: 305.7 MB). Peak memory consumption was 359.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:33:27,527 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.41 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.94 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.23 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 301.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -191.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 698578.74 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.1 GB in the beginning and 819.2 MB in the end (delta: 305.7 MB). Peak memory consumption was 359.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (const (_ BitVec 32) (Array (_ BitVec 32) (_ BitVec 32))) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...